Cod sursa(job #3263032)
Utilizator | Data | 12 decembrie 2024 20:44:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
const int VMAX = 2e6;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool v[VMAX+1];
int main()
{
int n;
cin>>n;
int prime = n-1;
for (int i = 2; i*i<=n; i++)
{
if (v[i]==0)
{
for (int j = i*i; j<=n; j+=i)
{
v[j]=1;
prime--;
}
}
}
cout<<prime;
return 0;
}