Cod sursa(job #2922941)
| Utilizator | Data | 10 septembrie 2022 18:43:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n;
cin>>n;
if (n < 2 || n > 2000000)
return 1;
int A[n + 1];
A[2] = 2;
for (int i = 2; i <= sqrt(n) + 1; i++)
{
for (int j = i + 1; j <= n; j++)
{
if (j % i == 0)
{
A[j] = -1;
}
else if (A[j] != -1)
{
A[j] = j;
}
}
}
int cnt = 0;
for (int i = 2, lim = n + 1; i < lim; i++)
{
if (A[i] != -1)
cnt++;
}
cout<<cnt;
cin.close();
cout.close();
return 0;
}