-
Notifications
You must be signed in to change notification settings - Fork 0
/
UVA_10110.cpp
78 lines (70 loc) · 1.41 KB
/
UVA_10110.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <stdio.h>
#include <math.h>
#define N 70000
int k,nk,var[(N/32)+1];
long long primes[N],e[N];
void bsieve();
void decomp(long long n);
bool checkprime(int n,int pos);
int setnotprime(int n,int pos);
int main(void)
{
long long n,i;
bsieve();
while(1)
{
scanf("%lld",&n);
if(n==0)
break;
decomp(n);
long out=1;
for(i=0;i<nk;i++)
out=out*(e[i]+1);
if(out%2==0)
printf("no\n");
else
printf("yes\n");
nk=0;
}
return 0;
}
void bsieve()
{
long long i,j;
for(i=3;i<=N;i++)
if(!checkprime(var[i/32],i%32))
for(j=i*i;j<=N;j+=2*i)
var[j/32]=setnotprime(var[j/32],j%32);
primes[k++]=2;
for(i=3;i<=N;i+=2)
if(!checkprime(var[i/32],i%32))
primes[k++]=i;
}
bool checkprime(int n,int pos)
{
return (bool) (n&(1<<pos));
}
int setnotprime(int n,int pos)
{
return n|(1<<pos);
}
void decomp(long long n)
{
int i,cnt,sqrtn=sqrt(n);
for(i=0;i<k && primes[i]<=sqrtn;i++)
{
if(n%primes[i]==0)
{
cnt=0;
while(n%primes[i]==0)
{
cnt++;
n/=primes[i];
}
if(cnt>0)
e[nk++]=cnt;
}
}
if(n!=1)
e[nk++]=1;
}