Cod sursa(job #2035108)
Utilizator | Data | 8 octombrie 2017 22:03:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int prim[2005],cnt=0,N;
f>>N;
for(int i=2;i<=N;i=i+1){
prim[i]=1;
}
for(int i=2;i<=N;i=i+1){
if(prim[i]){
cnt++;
for(int j=i+i;j<=N;j=j+i){
prim[j]=0;
}
}
}
g<<cnt;
return 0;
}