Cod sursa(job #3362156)
| Utilizator | Data | 3 august 2026 17:20:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int LIM = 2000001;
bool ciur[LIM]={0};
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, cnt=0;
fin>>n;
ciur[0] = 1;//0 e prim
ciur[1] = 1;
for(int i=2; i*i<=n; i++){
if(ciur[i]==0)
for(int j=i*i; j<=n; j+=i)
ciur[j]=1;
}
for(int i=2; i<=n; i++)
if(ciur[i]==0)
cnt++;
fout<<cnt;
return 0;
}
