Cod sursa(job #2605607)
Utilizator | Data | 25 aprilie 2020 15:36:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
short prim[2000001], x;
int k;
int main()
{
fin>>x;
prim[0]=1;
prim[1]=1;
for(int i=2;i<=x;i++)
{
if(prim[i]==0)
{
++k;
for(int j=2;j*i<=x;j++)
prim[i*j]=1;
}
}
fout<<k;
return 0;
}