Cod sursa(job #3284928)
Utilizator | Data | 12 martie 2025 12:58:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n , cnt = 0 , Ciur[2000001];
int main()
{
fin >> n;
Ciur[1] = 1;
for(int i = 2 ; i <= n ; i++)
if(Ciur[i] == 0)
for(int j = 2 ; i * j <= n ; j++)
Ciur[j * i] = 1;
for(int i = 1 ; i <= n ; i++)
if(Ciur[i] == 0)
cnt++;
fout << cnt;
return 0;
}