fork download
  1. #include <iostream>
  2. #include <iomanip>
  3. #include <cstdio>
  4. #include <cmath>
  5. #include <cstdlib>
  6. #include <ctime>
  7. #include <cstring>
  8. #include <limits>
  9. #include<stack>
  10. #include<queue>
  11. #include <vector>
  12. #include <queue>
  13. #include <map>
  14. #include <set>
  15. #include <utility>
  16. #include <algorithm>
  17. #include <sstream>
  18. using namespace std;
  19. #define pb push_back
  20. #define mp make_pair
  21. #define ff first
  22. #define ss second
  23. #define sz size()
  24. #define ln length()
  25. #define rep(i,n) for(int i=0;i<n;i++)
  26. #define fu(i,a,n) for(int i=a;i<=n;i++)
  27. #define fd(i,n,a) for(int i=n;i>=a;i--)
  28. #define all(a) a.begin(),a.end()
  29. #define si(n) scanf("%d",&n)
  30. #define gl(n) cin >> n
  31. #define pi(n) printf("%d",n)
  32. #define pl(n) cout << n
  33. #define ps printf(" ")
  34. #define pn printf("\n")
  35.  
  36. int main()
  37. {
  38. int a[1000000];
  39. memset(a,0,sizeof(a));
  40. for(long long i=2;i*i*i<=1000000;i++)
  41. {
  42. for(long long k=2;;k++)
  43. {
  44. for(long long j=i*i*i;j<=1000000;j*=k)
  45. {
  46. a[j]=-1;
  47. }
  48. if((i*i*i*k) > 1000000)
  49. break;
  50. }
  51. }
  52. int k=1;
  53. for(int i=1;i<=1000000;i++)
  54. if(a[i]==0)
  55. a[i]=k++;
  56. int T;
  57. si(T);
  58. for(int i=1;i<=T;i++)
  59. {
  60. int N;
  61. si(N);
  62. printf("Case %d: ",i);
  63. if(a[N]==-1)
  64. printf("Not Cube Free\n");
  65. else
  66. printf("%d\n",a[N]);
  67. }
  68. return 0;
  69. }
  70.  
Success #stdin #stdout 0s 6520KB
stdin
10

1

2

3

4

5

6

7

8

9

10
stdout
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