Cod sursa(job #2793024)
Utilizator | Data | 2 noiembrie 2021 18:27:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int ciur[2000005], n, nr;
///ifstream cin("ciur.in");
///ofstream cout("ciur.out");
int main()
{
cin>>n;
for ( int d = 2; d * d <= n; d++)
if ( ciur[d] == 0 )
for ( int i = d * d; i <= n; i = i + d )
ciur[i] = 1;
for(int i=2;i<=n;i++)
if(ciur[i] == 0)
nr++;
cout<<nr;
return 0;
}