Cod sursa(job #345628)
Utilizator | Data | 3 septembrie 2009 20:43:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream.h>
#include<fstream.h>
main()
{
int n,i,j,k=2,d;
fstream f("ciur.in", ios::in);
fstream g("ciur.out",ios::out);
f>>n;
if(n!=1)
for(i=4; i<=n; i++)
{
d=0;
for(j=2; j<=i/2; j++)
if(i%j==0)d++;
if(d==0)k++;
}
g<<k;
f.close();
g.close();
return 0;
}