Cod sursa(job #1631754)
Utilizator | Data | 5 martie 2016 18:37:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool not_prim[2000003]={0};
int i,n,contor=0;
fin>>n;
for(i=2;i<=n;i++)
if(not_prim[i]==false)
{
for(int j=2*i;j<=n;j+=i)
not_prim[j]=true;
contor++;
}
fout<<contor;
return 0;
}