Cod sursa(job #384356)
Utilizator | Data | 19 ianuarie 2010 22:16:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{long long n, b=0, i, j;
fstream f("ciur.in", ios::in);
fstream go("ciur.out", ios::out);
f>>n;
if(n%2!=0)
for(i=n; i>=2; i-=2)
{ int g=0;
for(j=2; (j<i)&&(g==0); j++)
if((i%j)==0)
g=1;
if(g==0)
b++;
}
else for(i=n; i>=2; i-=2)
{ int g=0;
for(j=2; (j<i)&&(g==0); j++)
if((i%j)==0)
g=1;
if(g==0)
b++;
if(i==n)
i++;}
go<<b+1;
}