Cod sursa(job #362471)
Utilizator | Data | 9 noiembrie 2009 20:40:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
long n,ind=2,cont=0;
char a[2000002];
int main()
{
long var;
ifstream f("ciur.in");
f>>n;
f.close();
while(ind<=n)
{
cont++;
var=ind*2;
while(var<=n)
{
a[var]='*';
var+=ind;
}
do
{
ind++;
}while(a[ind]=='*');
}
ofstream g("ciur.out");
g<<cont;
g.close();
return 0;
}