Cod sursa(job #3128746)
| Utilizator | Data | 10 mai 2023 19:43:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool erath[2000005];
int main()
{
int n;
int cnt=0;
f>>n;
for(int div = 2;div*div<=n;div++){
if(erath[div]==1){
continue;
}
for(int multiplu = 2*div;multiplu<=n;multiplu+=div){
erath[multiplu]=1;
}
}
for(int i = 2;i<=n;i++){
if(erath[i]==0){
cnt++;
}
}
g<<cnt;
return 0;
}
