Cod sursa(job #1657845)
Utilizator | Data | 20 martie 2016 20:38:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000001];
int main()
{
int n;
fin>>n;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
for(int j=i+i;j<=n;j+=i)
ciur[j]=1;
int cont=0;
for(int i=2;i<=n;i++)
if(ciur[i]==0) cont++;
fout<<cont;
return 0;
}