Cod sursa(job #596039)
Utilizator | Data | 15 iunie 2011 16:46:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream.h>
char v[2000001];
int i,j,n,p;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
f.close();
p=0;
for(i=2; i<=n; i++)
if(v[i]==0)
{
p++;
for(j=i+i; j<=n; j+=i)
v[j]=1;
}
g<<p;
g.close();
return 0;
}