Cod sursa(job #1364777)
Utilizator | Data | 27 februarie 2015 20:13:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
bool ciur[20000000];
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int i,j,n,cnt=0;
cin>>n;
for (i=2;i<n;i++){
if(ciur[i]==0){
cnt++;
for(j=i+i;j<=1;j+=i)
ciur[i]=1;
}
}
cout<<cnt;
return 0;
}