Cod sursa(job #1877850)
Utilizator | Data | 13 februarie 2017 19:11:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
long int x,k;
bool f[2001001];
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>x;
for(int i=2;i<=x;i++)
f[i]=1;
for(int i=2;i<=x;i++){
if(i%2==0||i%3==0||i%5==0||i%7==0) f[i]=0;
if(i==2||i==3||i==5||i==7) f[i]=1;
}
for(int i=2;i<=x;i++){
if(f[i]){
k++;
}
}
cout<<k;
return 0;
}