Cod sursa(job #3350118)
| Utilizator | Data | 5 aprilie 2026 16:21:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000005];
int main()
{
int n, ct=0, i;
fin>>n;
ciur[0]=1;
ciur[1]=1;
for(i=2; i*i<=n; i++)
if(ciur[i]==0)
for(int j=i*i; j<=n; j+=i)
ciur[j]=1;
for(i=2; i<=n; i++)
if(ciur[i]==0)
ct++;
fout<<ct;
return 0;
}
