spoj/cubefr.cpp at master · nick9999/spoj · GitHub

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
#include<stdio.h>
char ina[1000001];
int ar[1000001];
int main()
{
	int t,i,j,temp,sol,in,fi,ans,mi,n;
	scanf("%d",&t);
	for(i=2;i<101;i++)
	{
		temp=i*i*i;
		j=temp;
		while(temp<1000001)
		{
			ina[temp]=1;
			temp=temp+j;
		}
	}
		ans=2;
		ar[0]=0;ar[1]=1;
		for(i=2;i<1000001;i++)
	{

		if(ina[i]!=1)
			ar[ans++]=i;
	}
	for(j=1;j<=t;j++)
	{
		scanf("%d", &n);
		if(ina[n]==1)
			printf("Case %d: Not Cube Free\n", j);
		else
		{
			for(i=0;i<ans;i++)
			{
				in =0;
				fi = ans;
				while(in<=fi)
				{
					if(in==fi)
					{
						if(ar[in]==n)
						{
							sol= in;
							break;
						}
					}
					else
					{
						mi = (in+fi)/2;
						if(ar[mi]==n)
						{
							sol = mi;
							break;
						}
						else if(ar[mi]<n)
							in = mi +1;
						else
							fi = mi-1;
					}
				}
				printf("Case %d: %d\n", j, sol);
				break;
			}
		}
	}
	return 0;
}