Cod sursa(job #2858282)
Utilizator | Data | 27 februarie 2022 12:43:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
long long n, prim=0, ciur[2000002], i, j, cif;
int main()
{
in>>n;
for(i=2; i<=n; i++)
{
if(ciur[i]==0)
{
prim++;
/*j=i*i;
cif=i+1;
while(j<=n)
{
ciur[j]=1;
j=i*cif;
cif++;
}*/
for(j=i+i; j<=n; j=j+i)
ciur[j]=1;
}
}
out<<prim;
return 0;
}