Cod sursa(job #768298)
Utilizator | Data | 16 iulie 2012 16:01:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int N = 2000001;
bool c[N];
int main()
{
int n,j,i,b,nr=0;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i*i<n;i++)
{
if(!c[i])
for(j=i*i;j<=n;j+=i)
c[j]=true;
}
for(i=2;i<=n;i++)
if(!c[i]) nr++;
fout<<nr<<"\n";
return 0;
}