标签：code display cin 代码 lap out 技术 names check
int j = p - 1, k = 0; while (k < j&&a[j--]==a[k++]) ; if (k == j) t++; int j = p , k = -1; while (k < j&&a[--j]==a[++k]) ; if (k == j) t++; int j = p , k = -1; while (k < j&&a[--j]==a[++k]) ; if (k >= j) t++; int j = p -1, k = 0; while (k < j){ if(a[k++]!=a[j--])break; } if (k >= j) t++;
正确代码：
#include <iostream> #include <string.h> using namespace std; bool check(int x) { int a[20],t = 0; for (int i = 2; i <= 10; i++) { int q = x, p = 0; memset(a, 0, sizeof(int) * 20); while (q) { a[p++] = q % i; q /= i; } int j = p - 1, k = 0; while (k < j) { if (a[j] != a[k]) break; j--; k++; } if (k >= j)t++; if (t == 2)return 1; } return 0; } int main() { int N, S, count = 0; cin >> N >> S; for (int i = S + 1; count < N; i++) { if (check(i)) { count++; cout << i << endl; } } return 0; }
标签：code display cin 代码 lap out 技术 names check
原文地址：https://www.cnblogs.com/czc1999/p/10363207.html
