1019 General Palindromic Number
题目大意是让你把一个数转化为给定的进制数,然后判断该进制数是否是回文串。水题~
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <iostream> #include <cstring> #include <string> #include <sstream> #include <string> #include <cstdio> #include <cmath> #include <algorithm> #include <map> #define maxn 105 #define INF 0x3f3f3f3f #define EPS 1e-6 #define pi acos(-1.0) using namespace std; typedef long long ll; int n,b; int a[maxn]; int main() { scanf("%d%d",&n,&b); int t=n,p=0; while(t) { a[p++]=t%b; t=t/b; } int flag=0; for(int i=0;i<p;i++) { if(a[i]!=a[p-i-1]) { flag=1; break; } } if(flag) printf("No\n"); else printf("Yes\n"); printf("%d",a[p-1]); for(int i=p-2;i>=0;i--) printf(" %d",a[i]); printf("\n"); }