Information
- ID
- 6936
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 1
- Tags
- # Submissions
- 2
- Accepted
- 1
- Uploaded By
#include<iostream>
using namespace std;
bool a[5440];
int main(){
int n;
cin>>n;
for(int i=2;i<=n;i++){
for(int j=0;j<=n;j+=i){
a[j]=!a[j];
}
}
for(int i=1;i<=n;i++){
if(!a[i])cout<<i<<' ';
}
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.