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