Cod sursa(job #241132)
Utilizator | Data | 9 ianuarie 2009 15:18:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int main ()
{
long int N,m,k,i,j;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>N;
k=1;
for(i=3;i<=N;i=i+2);
{m=0;
for(j=3;j<=i/2;j=j+2)
if(i%j==0)
m++;
if (m==0)
k++;
}
out<<k;
in.close();
out.close();
return 0;
}