Cod sursa(job #415077)
Utilizator | Data | 10 martie 2010 21:24:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
char prim[2000005];
int j,n,i,nrc=0;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
prim[i]= 1;
for(i=2;i<=n;i++)
if(prim[i])
{
nrc++;
for(j= i+i ; j<=n; j+=i)
prim[j] = 0;
}
fout<<nrc;
return 0;
}