Cod sursa(job #1167799)
| Utilizator | Data | 5 aprilie 2014 22:26:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main(){
int n;
f >> n;
//cin >> n;
std::vector<bool> nonprim(2000001,false);
nonprim[1] = true;
nonprim[2] = false;
int nrprim = 0;
int i, j;
for (i=2; i<=n; i++){
if (!nonprim[i]){
nrprim++;
for (j=i; j<=n; j+=i) nonprim[j] = true;
}
}
g << nrprim;
//cout << nrprim;
}
