Cod sursa(job #1460371)
| Utilizator | Data | 12 iulie 2015 14:56:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
long ciur(int len){
bool v[200000];
int x = 0;
for(int i = 2; i <= len; i++){
v[i * 2] = 1;
v[i * 3] = 1;
v[i * 5] = 1;
v[i * 7] = 1;
if(v[i] != 1){
x++;
}
}
return x;
}
int main(){
long x;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> x;
fout << ciur(x);
return 0;
}
