Cod sursa(job #2331915)
Utilizator | Data | 30 ianuarie 2019 10:19:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX = 2000005;
int prim[NMAX];
int main()
{
int n;
fin >> n;
int rasp=0;
for(int i=2;i<=n;i++)
{
if(prim[i]==0)
{
rasp++;
for(int j=1;i*j<=n;j++)
{
prim[j*i]=1;
}
}
}
fout << rasp;
return 0;
}