POJ 1811 Prime Test【素数判定与大数分解】

题目来戳呀

Description

Given a big integer number, you are required to find out whether it’s a prime number.

Input

The first line contains the number of test cases T (1 <= T <= 20 ), then the following T lines each contains an integer number N (2 <= N < 254).

Output

For each test case, if N is a prime number, output a line containing the word “Prime”, otherwise, output a line containing the smallest prime factor of N.

Sample Input

2
5
10

Sample Output

Prime
2

题意：
经典的大素数题了。
是素数输出“”Prime“”，不是素数就输出最小因数。
想法：
套mr和pr的模板←_←
代码注释来自这里

#include <cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<ctime>
#include<iostream>
using namespace std;
const int s=8;//随机算法判定次数，一般8~10次就够了
typedef long long ll;
/*计算ret = (a*b)%c*/
ll mult_mod(ll a,ll b,ll c)
{
    a%=c;