Cod sursa(job #3361118)
| Utilizator | Data | 20 iulie 2026 16:05:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[9000000];
int y=0;
int ciure(int n){
for(int i=2;i<=n;i++){
ciur[i]=1;
}
ciur[0]=0;
ciur[1]=0;
for(int i=0;i<=n;i++){
if(ciur[i]==1){
y++;
for(int j=2;j*i<=n;j++){
ciur[i*j]=0;
}
}
}
}
int main() {
int n;
fin >> nr;
ciure(n);
fout<<y;
}
