Cod sursa(job #705313)
Utilizator | Data | 4 martie 2012 00:34:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int main()
{
int N,i,prim,j,ok;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
prim=1;
for(i=3;i<=N;i+=2)
{
ok=1;
for(j=3;j<i;j++)
if(i%j==0) {ok=0;continue;}
if(ok==1) prim++;
}
fout<<prim;
fin.close(), fout.close();
}