PAT-A1009 Product of Polynomials (25)（模拟）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
using namespace std;

#define MAX 500

int isPalin(int a[], int c)
{
for (int i = 0; i < c/2; i++)
if (a[i] != a[c-1])
return 0;
return 1;
}

int main()
{
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
int N = 0, base = 0, cnt = 0;
int trans[MAX];
cin >> N >> base;
while (N)
{
trans[cnt++] = N%base;
N /= base;
}

if (isPalin(trans, cnt))
cout << "Yes" << endl;
else
cout << "No" << endl;

if (0 == cnt)
cout << 0;
else
{
for (int i = cnt-1; i >= 0; i--)
{
cout << trans[i];
if (i != 0)
cout << " ";
}
}
return 0;
}