Cod sursa(job #271972)
Utilizator | Data | 6 martie 2009 10:43:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
int i,j,n,k,s;
char ciur[2000002];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=(n/2);i++)
for(j=2;(j*i)<=n;j++)
ciur[j*i]=1;
for(i=2;i<n;i++)
if(ciur[i]==0)
s=s+1;
g<<s<<'\n';
return 0;
}