Cod sursa(job #2298857)
Utilizator | Data | 8 decembrie 2018 16:11:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long n;
int cnt;
int prim[2000000000];
int main()
{
int i,j;
fin>>n;
for(i=2; i<=n; i++)
prim[i]=1;
for(i=2; i<=n; i++)
if(prim[i]!=0)
{
cnt++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
fout<<cnt;
}