LightOj 1370 - Bi-shoe and Phi-shoe

 // Accepted
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#define sf scanf
#define pf printf
#define sfint(a,b) scanf("%d %d",&a,&b)
#define sfl(a,b) scanf("%ld %ld",&a,&b)
#define sfll(a,b) scanf("%lld %lld",&a,&b)
#define sfd(a,b) scanf("%lf %lf",&a,&b)
#define sff(a,b) scanf("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define LL long long
#define L long
#define mem(c,v) memset(c,v,sizeof(c))
#define ui unsigned int
#define cp(a) cout<<" "<<a<<" "<<endl
#define ull unsigned long long int
#define nl puts("")
#define sq(x) ((x)*(x))
#define all(x) x.begin(),x.end()
#define mx7 20000100
#define mx6 1500000
#define mx5 1000005
#define inf 1<<30                                           //infinity value
#define eps 1e-9
#define mx (65540)
#define mod 1000000007
#define pb push_back
#define pi acos(-1.0)
#define sz size()
#define gc getchar ()


using namespace std;
//..................................................................................................................

template<class T> T setbit(T n, T pos){n=n|(1<<pos); return n;}
template<class T> T checkbit(T n, T pos){n=n&(1<<pos); return n;}
template<class T> T gcd(T a, T b ) {return b==0?a:gcd(b,a%b);}
template<class T> T large(T a, T b ) {return a>b?a:b;}
template<class T> T small(T a, T b ) {return a<b?a:b;}

bool flag[mx5+10];

void seieve()
{
    mem(flag,false);
    flag[0]=flag[1]=true;

    LL i,j,x=(long)sqrt(double(mx5));

    for(i=4;i<=mx5;i+=2)flag[i]=true;

    for(i=3;i<=x;i+=2)
    {
        if(!flag[i])
        {
            for(j=i*i;j<=mx5;j+=i+i)
            {
                flag[j]=true;
            }
        }
    }

//    for(i=2;i<=mx5;i++)
//    {
//        if(!flag[i])
//        {
//            //cout << i << " ";
//            prm.push_back(i);
//        }
//    }
//
//    plen=prm.size();
}

int main()
{
    seieve();

    int tc,t=0;
    sf("%d",&tc);

    while(tc--)
    {
        LL n,i,j;
        LL ans=0;

        sf("%lld",&n);

        for(i=0;i<n;i++)
        {
            LL num;
            sf("%lld",&num);

            for(j=num+1;;j++)
            {
                if(!flag[j])
                {
                    ans+=j;
                    break;
                }
            }

            //cp(ans);
        }

        pf("Case %d: %lld Xukha\n",++t,ans);
    }

    return 0;
}