Cod sursa(job #557244)
Utilizator | Data | 16 martie 2011 15:29:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
char ciur[2000000];
int nr, i , j,n;
int main()
{
fi>>n;
nr=0;
for(i=2;i<n;i++)
ciur[i]=1;
for(i=2; i*i<=n; i++)
if(ciur[i]==1)
for(j=2;j*i<=n;j++)
ciur[i*j]=0;
for(i=2;i<n;i++)
if(ciur[i]==1)
nr++;
fo<<nr;
}