Cod sursa(job #2729410)
| Utilizator | Data | 24 martie 2021 18:06:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int main()
{
int sieve[2000002];
long int n,totalprime;
ifstream f;
f.open("ciur.in");
f>>n;
totalprime = n-1;
for(int i=0; i<=n; i++)
sieve[i] = 0;
f.close();
for(int i=2; i<=n; i++)
if(!sieve[i])
for(int j = 2*i; j <= n; j += i)
if(!sieve[j])
{
sieve[j] = 1;
totalprime = totalprime-1;
}
ofstream g;
g.open("ciur.out");
g<<totalprime;
g.close();
return 0;
}
