1015. Reversible Primes (20)

1.需要熟悉进制转换的方法

2.进制转换的第一步，通过求余求出string，此时的string恰好是倒序的

正确的进制转换：

while (num != 0)
		{//求余，把它转化为d进制格式的数，但求出来的string刚好是反的
			char c = num%d + '0';
			s += c;
			num /= d;
		}
		for (int i = 0; i < s.size() / 2; i++)
			swap(s[i], s[s.size() - 1 - i]);

源代码如下：

//#include<string>
//#include <iomanip>
#include<vector>
#include <algorithm>
//#include<stack>
#include<set>
#include<queue>
#include<map>
//#include<unordered_set>
//#include<unordered_map>
//#include <sstream>
//#include "func.h"
//#include <list>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
using namespace std;
int main(void)
{
	vector<bool> prime(150000, true);
	prime[0] = false;
	prime[1] = false;
	prime[2] = true;
	for (int i = 2; i < 150000; i++)
	{
		if (prime[i])
		{
			for (int j = 2; j*i < 150000; j++)
			{
				prime[j*i] = false;
			}
		}
	}

	int n, d;
	while (scanf("%d", &n) != EOF)
	{
		if (n < 0) return 0;//以负数结束
		cin >> d;
		int num = n;
		string s = "";
		while (num != 0)
		{//求余，把它转化为d进制格式的数，但求出来的string刚好是反的
			char c = num%d + '0';
			s += c;
			num /= d;
		}
		//for (int i = 0; i < s.size() / 2; i++)
		//	swap(s[i], s[s.size() - 1 - i]);
		int reverse = 0;
		for (int i = 0; i < s.size(); i++)
		{
			reverse = (s[i] - '0') + reverse * d;
		}
		if (prime[n] && prime[reverse]) cout << "Yes" << endl;
		else cout << "No" << endl;
	}

	return 0;
}