Cod sursa(job #3286989)
Utilizator | Data | 14 martie 2025 21:28:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
//ifstream cin("euclid2.in");
//ofstream cout("euclid2.out");
int cnt,n;
const int Valmax=2000000;
int v[Valmax+1];
int main()
{
cin>>n;
v[0]=1;
v[1]=1;
for(int i=2; i<=Valmax; i++)
for(int j=2; i*j<=Valmax; j++)
v[i*j]=1;
for(int i=1; i<=n; i++)
if(v[i]==0)
cnt++;
cout<<cnt;
return 0;
}