PAT A1015 Reversible Primes

PAT A1015 Reversible Primes

Sample Input:

73 10
23 2
23 10
-2

Sample Output:

Yes
Yes
No

• 思路 1：

1. 先判断n是不是素数，若不是输出No，若是进一步判断
2. 将n转化为radix进制，逆转（因为用数组从低位开存，相当于逆转了），在转化为十进制，判断这个数是否是素数

• code 1:

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int ans[maxn], len = 0;
void change(int n, int radix){
	do{
		ans[len++] = n % radix ;
		n /= radix;
	}while(n > 0);
}
int toDecimal(int n, int radix){
	int res = 0;
	for(int i = 0; i < len; i++)
		res = res * radix + ans[i];
	return res;
}
bool isPrime(int x){
	if(x <= 1) return false;
	for(int i = 2; i * i <= x; ++i){
		if(x % i == 0) return false;
	}
	return true;
}
int main(){
	int n, radix;
	while(1){
		scanf("%d", &n);
		if(n < 0) return 0;
		else scanf("%d", &radix);
		if(isPrime(n)){
			len = 0;
			change(n, radix);
			int com = toDecimal(n, radix);
			if(isPrime(com)) printf("Yes\n");
			else printf("No\n"); 
		}else printf("No\n"); 
	}

}

• T2 code:

#include <bits/stdc++.h>
using namespace std;

bool isPrime(int x){
	if(x < 2) return false;
	int sqr = (int)sqrt(1.0 * x);
	for(int i = 2; i <= sqr; ++i){
		if(x % i == 0) return false;
	}
	return true;
}	//TIPS：最好用isPrime判断，素数表可能会范围出错 
string Change(int n, int radix){
	if(radix == 10) return to_string(n);
	string ans;
	do{
		char dig = n % radix + '0';
		ans = dig + ans; 
		n /= radix;
	}while(n);
	return ans;
}
int toDecimal(string s, int radix){
	int ans = 0;
	for(int i = 0; i < s.size(); ++i){
		ans = ans * radix + s[i] - '0';
	}
	return ans;
}
string Rev(string n){
	reverse(n.begin(), n.end());
	return n;
}
int main(){
	int n, radix;
	while(scanf("%d %d", &n, &radix) == 2){
		if(isPrime(n) && isPrime(toDecimal(Rev(Change(n, radix)), radix))) printf("Yes\n");	//注意n == 1 
		else printf("No\n");
	}
	return 0;
} 

• T3 code:

#include <bits/stdc++.h>
using namespace std;

bool isPrime(int n)
{
    if(n < 2) return false;
    int sqr = sqrt(1.0 * n);
    for(int i = 2; i <= sqr; ++i)
    {
        if(n % i == 0) return false;
    }
    return true;
}
int Change(int n, int b)
{
    int ans = 0;
    do{
        ans = ans * b + n % b;
        n /= b;
    }while(n);
    return ans;
}
int main()
{
    int n1, n2;
    while(scanf("%d", &n1) != EOF && n1 > 0)
    {
        scanf("%d", &n2);
        printf("%s\n", isPrime(n1) && isPrime(Change(n1, n2)) ? "Yes" : "No");
    }
    return 0;
}

• T4 code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isPrime(int x)
{
    if(x < 2) return false;
    int sqr = sqrt(1.0 * x);
    for(int i = 2; i <= sqr; ++i)
    {
        if(x % i == 0) return false;
    }
    return true;
}
ll Change(int x, int b)
{
    ll ans = 0, d = 1;
    do{
        ans += x % b * d;
        x /= b;
        d *= 10;
    }while(x > 0);
    return ans;
}
int ToDecimal(ll n, int b)
{
    int ans = 0;
    do{
        int dig = n % 10;
        n /= 10;
        ans = ans * b + dig;
    }while(n > 0);
    return ans;
}
int main()
{
    int n, b;
    while(scanf("%d %d", &n, &b) != EOF && n > 0)
    {
        if(!isPrime(n))
        {
            printf("No\n");
            continue;
        }
        int other = ToDecimal(Change(n, b), b);
        printf("%s\n", isPrime(other) ? "Yes" : "No");
    }
    return 0;
}