poj 1811 Prime Test【 随机素数测试与大数分解】

Prime Test
Time Limit: 6000MS Memory Limit: 65536K
Total Submissions: 29925 Accepted: 7631
Case Time Limit: 4000MS
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
Source

POJ Monthly

直接套bin神的板子。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>

using namespace std;

//****************************************************************
// Miller_Rabin 算法进行素数测试
//速度快，而且可以判断 < 2^63的数
//****************************************************************
const int S = 10;//随机算法判定次数，S越大，判错概率越小 一般8-10足够


//计算 (a*b)%c.   a,b都是long long的数，直接相乘可能溢出的
//  a,b,c <2^63
long long mult_mod(long long a, long long b, long long c)
{
    a %= c;
    b %= c;
    long