Cod sursa(job #2535570)
| Utilizator | Data | 1 februarie 2020 00:49:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int main() {
bool ciur[2000000];
int k = 0 , n , i , j , m , x[5000];
ifstream fin("ciur.in");
fin>>n;
fin.close();
ciur[0] = ciur[1] = 1;
for(i = 4 ; i <= n ; i+=2) {
ciur[i] = 1;
}
for(i = 3 ; i <= n ; i+=2) {
if(ciur[i]==0) {
for(j = i*i ; j <= n ; j+=i) {
ciur[j] = 1;
}
}
}
j = 0;
for(i = 2; i <= n ; i++) {
if(ciur[i] == 0) {
x[++j] = ciur[i];
}
}
ofstream fout("ciur.out");
fout<<j;
fout.close();
}
