1015 Reversible Primes (20 分)

太蠢了，难怪第3个测试点一直过不了，是两个数都是素数才能输出Yes,太蠢了，弄了这么长时间。。。。。。

#include "pch.h"
#include <iostream>
#include<string.h>
#include<stdio.h>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int prime[100000],primes[100000];
void make_table()
{
	int cnt = 0;
	memset(prime, 1, sizeof(prime));
	prime[0] = 0;
	prime[1] = 0;
	for (int i = 2; i < 100000; i++)
	{
		if (prime[i])
		{
			primes[cnt++] = i;
			for (long j = i +i; j < 100000; j += i)
				prime[j] = 0;
		}
	}

}
int renum(int num, int radix)
{
	int res[32];
	int cnt = 0, sum = 0,index=1;
	while (num != 0)
	{
		res[cnt++] = num % radix;
		num /= radix;
	}
	for (int i = 0; i < cnt; i++)
		sum = sum * radix+ res[i];
	return sum;
}
int main()
{
	int n, d;
	make_table();
	while (cin >> n>>d)
	{
		if (n < 0)
			break;
		if (prime[renum(n, d)]&&prime[n])
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
}