Cod sursa(job #3293888)
Utilizator | Data | 12 aprilie 2025 22:30:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
short int ciur[2000001];
int main()
{
int n, nrprime = 0;
cin>>n;
for(int i = 2; i <= n; ++i)
{
if(ciur[i] == 0)
{
++nrprime;
for(int j = i * 2; j <= n; j += i )
{
ciur[j] = 1;
}
}
}
cout<<nrprime;
return 0;
}