Cod sursa(job #3202929)
Utilizator | Data | 12 februarie 2024 18:00:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int nr_prime(int n)
{
for(int i = 2; i <= n; ++i){
if(v[i] == 0)
for(int j = 2*i; j <= n; j+=i){
if(j%i == 0)
v[j] = 1;
}
}
unsigned c = 0;
for(int i = 2; i <= n; ++i)
if(v[i] == 0)
c++;
return c;
}
int main()
{
int n;
f >> n;
fout << nr_prime(n);
return 0;
}