Bi-shoe and Phi-shoe LightOJ - 1370

lucky number表示比x小的且与x互质的数的个数

#include<cstring>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cctype>
using namespace std;
const int mx=1e6+1000;
bool a[mx];
long long sum;
int i,k,j,t,n,kase=0;
int main(){
	k=sqrt(mx)+1;
	memset(a,0,sizeof(a));
	a[0]=a[1]=1;
	for(i=2;i<=k;i++){
		if(a[i]==0){
		for(j=2;j*i<=mx;j++){
			a[i*j]=1;
		}}
	}
	cin>>t;
	while(t--){
		sum=0;
		cin>>n;
		while(n--){
			cin>>i;
			for(j=i+1;j<=mx;j++){
				if(a[j]==0){
					sum+=j;
					break;
				}
			}
		
		}
		cout<<"Case "<<++kase<<": "<<sum<<" Xukha"<<endl;
	}
	
	return 0;
}