HDU 3826 Squarefree number(无平方因子数)

Squarefree number(传送门)
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Problem Description
In mathematics, a squarefree number is one which is divisible by no perfect squares, except 1. For example, 10 is square-free but 18 is not, as it is divisible by 9 = 3^2. Now you need to determine whether an integer is squarefree or not.
Input
The first line contains an integer T indicating the number of test cases.
For each test case, there is a single line contains an integer N.

Technical Specification

1. 1 <= T <= 20
2. 2 <= N <= 10^18

Output
For each test case, output the case number first. Then output “Yes” if N is squarefree, “No” otherwise.

Sample Input
2
30
75
Sample Output
Case 1: Yes
Case 2: No

ps:在看紫书的无平方因子数，搜到了这题。因为任何一个数可以分解为若干个素数的乘积，那么对于完全平方数也是一样的，它也可以分解为若干个素数的乘积。这题的数据最大规模 $n$ 为$10^{18}$, 那么我们可以枚举 $1$~$10^6$之间的素数，判断n 能为被某个素数整除两次，如果可以就说明存在平方因子。当在$10^6$范围里都找不到的话($n > 10^6$)，那么说明即使存在它的素平方因子，素平方因子也是大于$10^6$, 那么我们直接对n开平方判断，$\sqrt n$是否是一个整数即可。

#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int maxn = 1e6+5;
bool pjprime[maxn];
vector<int> prime;
void init()
{
    memset(pjprime, 0, sizeof pjprime);
    pjprime[0] = pjprime[1] = 1;
    for(int i = 2; i * i <= maxn; i++)
        if(!pjprime[i])
        {
            for(int j = i * i; j < maxn; j += i)
            {
                pjprime[j] = 1;
            }
        }
    for(int i = 2; i < maxn; i++)
        if(pjprime[i] == 0)prime.push_back(i);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    init();
    int T;
    cin>>T;
    for(int i = 1; i <= T; i++)
    {
        long long n;
        cin>>n;
        int flag = 1;
        for(int j = 0; j < prime.size(); j++)
        {
            long long temp = n;
            if(temp % prime[j] == 0){
                temp = temp / prime[j];
                if(temp % prime[j] == 0){
                    flag = 0;
                    break;
                }
            }
        }
        if(n > 1000000){
            long long tt = sqrt((double) n);
            if(tt * tt == n)flag = 0;
        }
        cout<<"Case "<<i<<": ";
        if(flag)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}