CF 317D Game with Powers

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))

using namespace std;

bool pd[100005];
int n;
/*打表
char SG[1100000000];
int getsg(int S)
{
    if(SG[S]!=-1) return SG[S];
    bool hash[32]={0};
    for(int i=1; i<=30; i++)
    if(S&(1<<(i-1)))
    {
        int tmS=S;
        for(int j=i; j<=30; j+=i)
            if(tmS&(1<<(j-1))) tmS-=1<<(j-1);
        hash[getsg(tmS)]=1;
    }
    for(int i=0; i<=30; i++)
    if(!hash[i])
        return SG[S]=i;
}
void init()
{
    memset(SG,-1,sizeof(SG));
    SG[0]=0;
    getsg((1<<30)-1);
    for(int i=1; i<=30; i++)
        printf("%d,",SG[(1<<i)-1]);
}
*/

int SG[]={0,1,2,1,4,3,2,1,5,6,2,1,8,7,5,9,8,7,3,4,7,4,2,1,10,9,3,6,11,12,14};

int main()
{
    scanf("%d",&n);
    long long ans=1;
    memset(pd,0,sizeof(pd));
    long long i,cut=0;
    for(i=2; i<=floor(sqrt(n)); i++)
    if(!pd[i])
    {
        int num=0;
        for(long long j=i; j<=n; j*=i)
        {
            if(j<=floor(sqrt(n))) pd[j]=1;
            else cut++;
            ++num;
        }
        ans^=SG[num];
    }
    ans^=(n-i+1-cut)&1;
    if(ans==0)
        printf("Petya\n");
    else
        printf("Vasya\n");
    return 0;
}