1019 General Palindromic Number
代码如下:
1 #include<iostream> 2 3 using namespace std; 4 int jishu = 0; 5 int stem[50000] = {0}; 6 void trans(int n,int base){ 7 while(n != 0){ 8 stem[jishu++] = n%base; 9 n /= base; 10 } 11 } 12 int main(){ 13 int n,base; 14 cin >> n >> base; 15 trans(n,base); 16 //cout << jishu ; 17 bool flag = false; 18 for(int i = 0; i < jishu/2; i++){ 19 if(stem[i] != stem[jishu-i-1]){ 20 flag = !flag; 21 break; 22 } 23 } 24 if(flag) cout << "No" << endl; 25 else cout << "Yes" << endl; 26 for(int i = jishu-1; i > 0; i--){ 27 cout << stem[i] << " "; 28 } 29 cout << stem[0]; 30 return 0; 31 }