Cod sursa(job #1460489)
| Utilizator | Data | 12 iulie 2015 19:41:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000000];
int ciur(int len){
int x = 1;
for(int i = 2; i <= len; i++){
if(!v[i]){
for(int j = i*2; j <= len; j+=i){
if(!v[j]){
v[j] = 1;
x++;
}
}
}
}
return len-x;
}
int main(){
int x;
fin >> x;
fout << ciur(x);
return 0;
}
