SPOJ Solution-Cube Free Numbers-Solution in C, C++, Java, Python

Sample Input:
10
1
2
3
4
5
6
7
8
9
10

Sample Output:
Case 1: 1
Case 2: 2
Case 3: 3
Case 4: 4
Case 5: 5
Case 6: 6
Case 7: 7
Case 8: Not Cube Free
Case 9: 8
Case 10: 9

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
 
#define MOD (ll)1000000007
#define pb 	push_back
#define EPS 1e-9
#define FOR(i, n)	for(int i = 0;i < n; i++)
#define pi(a)   printf("%d\n", a)
#define all(c)  c.begin(), c.end()
#define tr(container, it)   for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define gc getchar_unlocked

template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T mod_exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=(x*b)%m;b=(b*b)%m;p=p>>1;}return x;}
template <typename T> T invFermat(T a, T p){return mod_exp(a, p-2, p);}
template <typename T> T exp(T b, T p){T x = 1;while(p){if(p&1)x=(x*b);b=(b*b);p=p>>1;}return x;}

void si(int &x){
    register int c = gc();
    x = 0;
    int neg = 0;
    for(;((c<48 || c>57) && c != '-');c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}

int cube[1000005];
vector<int> res;
void precal(){
	for(int i = 2;i <= 100; i++){
		cube[i*i*i] = 1;
	}
	for(int i = 8;i <= 1000000; i++){
		if(cube[i]){
			for(int j = 2*i; j <= 1000000; j+=i){
				cube[j] = 1;
			}
		}
	}
	for(int i = 1;i <= 1000000; i++){
		if(!cube[i])
			res.pb(i);
	}
}


int main(){
    int t;
    si(t);
    precal();
    int kase = 1;
    while(t--){
    	int n;
    	si(n);
    	if(cube[n]){
    		printf("Case %d: Not Cube Free\n", kase);
    	}else{
    		//find pos of n in res
    		int pos = lower_bound(res.begin(), res.end(), n)-res.begin()+1;
    		printf("Case %d: %d\n", kase, pos);
    	}
    	kase++;
    }
    return 0;
}

Copy The Code & Try With Live Editor

Input

Output