Cod sursa(job #159431)
Utilizator | Data | 14 martie 2008 09:42:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,nd,nr=1;
int main()
{
f>>n;
if (n<2)
g<<"0";
else
if (n==2)
g<<"1";
else
{
for(i=3;i<=n;i=i+2)
{for(d=i/2;d>=2;d++)
if (i%d==0)
nd++;
if(nd==0);
nr++;}
g<<nr;
f.close();
g.close();
return 0;
}