Cod sursa(job #2980898)
Utilizator | Data | 16 februarie 2023 21:44:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int ciur[1001];
int main()
{
int n, nr;
nr = 0;
fin >> n;
for(int i = 2;i <= n;i++)
{
if(ciur[i] == 0)
{
for(int j = 2 * i;j <= n;j+=i)
ciur[j] = 1;
}
}
for(int i = 2;i <= n;i++)
if(ciur[i] == 0)
nr++;
fout << nr;
return 0;
}