CUBEFR  Cube Free Numbers
A cube free number is a number who’s none of the divisor is a cube number (A cube number is a cube of a integer like 8 (2 * 2 * 2) , 27 (3 * 3 * 3) ). So cube free numbers are 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18 etc (we will consider 1 as cube free). 8, 16, 24, 27, 32 etc are not cube free number. So the position of 1 among the cube free numbers is 1, position of 2 is 2, 3 is 3 and position of 10 is 9. Given a positive number you have to say if its a cube free number and if yes then tell its position among cube free numbers.
Input
First line of the test case will be the number of test case T (1 <= T <= 100000) . Then T lines follows. On each line you will find a integer number n (1 <= n <= 1000000).
Output
For each input line, print a line containing “Case I: ”, where I is the test case number. Then if it is not a cube free number then print “Not Cube Free”. Otherwise print its position among the cube free numbers.
Example
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
hide comments
nilabja16180:
20170322 21:34:44
EASY! AC IN ONE GO! 

kass_97:
20161231 09:52:23
Simple sieve, AC at once


kira28:
20161228 13:23:52
another sieve ques :/ 

madhavgaba:
20161224 05:24:35
modify sieve and precompute......AC in third go;) 

surajmall:
20161023 11:13:20
seieve and some smart work needed 

kmrrv:
20160915 19:20:27
beware of output format 

karan_batra:
20160828 11:13:57
AC in one go :D. Simple modification of sieve. 

agralalarocks:
20160726 22:49:19
Could someone please take a look at my code its VAKNIg on ideone 

hmp:
20160705 03:08:52
why same code giving compilation error with C++14 and AC with C++4.3.2 

praval_singhal:
20160603 20:55:44
First the very first Time used lower_bound. Got AC :)

Added by:  Muhammad Ridowan 
Date:  20110614 
Time limit:  0.100s1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own. For alternate thanks Sayef Azad Sakin 