Cod sursa(job #678531)
| Utilizator | Data | 11 februarie 2012 21:33:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
using namespace std;
#include<fstream>
bool ciur[2000001];
int main()
{
ifstream fcin("ciur.in");
ofstream fcout("ciur.out");
long long n,i,nr=0,j;
fcin>>n;
for(i=1;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
if(ciur[i]==1)
for(j=i+i;j<=n;j+=i)
ciur[j]=0;
for(i=1;i<=n;i++)
if(ciur[i])nr++;
fcout<<nr;
fcin.close();
fcout.close();
return 0;
}
