Cod sursa(job #484935)
Utilizator | Data | 16 septembrie 2010 15:43:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream.h>
int n,i,j,k=0;
char s[2000001];
int main()
{ifstream q("ciur.in");
ofstream w("ciur.out");
q>>n;
for(i=2;i<=n;i++)
s[i]=1;
for(i=2;i<=n;i++)
{if(s[i]==1)
{k++;
for(j=i+i;j<=n;j+=i)
s[j]=0;}}
w<<k;
return 0;}