Cod sursa(job #254202)
Utilizator | Data | 6 februarie 2009 23:35:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
int a[25000], c;
int main()
{
int n, i , j;
fin>>n;
for(i=2; i*i<n; i++)
for(j=2; j*i<n; j++)
{
if(a[i*j]==0)
a[i*j]=1;
}
for(i=2; i<n; i++)
if(a[i]==0)
c++;
fout<<c;
return 0;
}