Cod sursa(job #2547406)
Utilizator | Data | 15 februarie 2020 12:22:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
unsigned ciur[2000001];
int main()
{
long unsigned n, i, j, primes = 0;
fin>>n;
for(i=2;i<=n;i++)
{
if(ciur[i] == 0)
{
primes += 1;
j=i;
while(j<=n)
{
ciur[j] = 1;
j += i;
}
}
}
fout<<primes;
return 0;
}