Cod sursa(job #3301811)
| Utilizator | Data | 30 iunie 2025 09:09:16 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
const int max_size = 1e6 * 2;
ifstream f("ciur.in");
ofstream g("ciur.out");
int fr[max_size];
int main() {
int n;
f >> n;
int i,j,c=0;
for(i=2; i<=n; i++) {
if(fr[i]==0) {
for(j=i+i; j<=n; j+=i) {
fr[j]=1;
}
}
}
for(i=2; i<=n; i++) {
if(fr[i]==0) {
c++;
}
}
g<<c;
f.close();
g.close();
return 0;
}