忘了说了有多组测试数据，不好意思。

这不是楼上的做法吗，这个方法首先就排除了在oj上马上就TLE了

Description

Your task is simple.
Give you a number N, you should judge whether N is a prime number or not.
Input

There are multiple test cases. For each test case, there is an integer N(2<=N<=10^18).
Output

For each test case, you should output whether N is a prime number or not.
If N is a prime number , you should output "It is a prime number."; otherwise you should output "It is not a prime number.";
Sample Input

2
4
Sample Output

It is a prime number.
It is not a prime number.

TLE了

http://acm.fzu.这个oj上

很感谢，但是这个代码肯定过不了的，交上去就TLE了，求正解，据说是pollard算法做的但是数论的我不是太会啊！拜托~~