Cod sursa(job #384353)
Utilizator | Data | 19 ianuarie 2010 22:11:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 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;
for(i=n; i>=2; i--)
{if(i%2!=0)
{int g=0;
for(j=2; (j<i)&&(g==0); j++)
if((i%j)==0)
g=1;
if(g==0)
b++;
if(n%2!=0) i--;}}
if(n%2!=0)
go<<b+1;
else go<<b;
}