➤ Problem Link : CUBEFR
👉 Hint : edit please
✅ C++ Solution :
#include<bits/stdc++.h>
using namespace std;
bool arr[1000001];
int val[1000001];
void setCubeFree(int n)
{
for(int i=2;i<=100;i++)
arr[i*i*i]=1;
for(int i=2;i<n;i++)
{
if(arr[i])
{
for(int j=2*i;j<=n;j+=i)
arr[j]=1;
}
}
int k=0;
for(int i=1;i<=n;i++)
{
if(!arr[i])
{
k++;
val[i]=k;
}
}
}
int main()
{
setCubeFree(1000000);
int t;
cin>>t;
for(int i=1;i<=t;i++)
{
int n;
cin>>n;
if(arr[n])
cout<<"Case "<<i<<": Not Cube Free"<<endl;
else
cout<<"Case "<<i<<": "<<val[n]<<endl;
}
}
Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook.
😇Happy Learning!!
I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.