Cod sursa(job #588170)
Utilizator | Data | 7 mai 2011 10:13:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
#define N 2000001
int main()
{long n,t,j,k;
char a[N];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(j=2;j<=n;j++)
a[j]='0';
k=n-1;
for(j=2;j*j<=n;j++)
if(a[j]=='0')
for(t=2;t*j<=n;t++)
if(a[t*j]=='0')
a[t*j]='1',k--;
g<<k;
return 0;}