Cod sursa(job #1011000)
Utilizator | Data | 16 octombrie 2013 00:58:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream f("ciur.in");
ofstream o("ciur.out");
int n = 0; f >> n;
bool a[2000001];
int nr = 0;
for (int i = 0; i < n; i++){
a[i] = false;
}
for (int i = 2; i < n ; i++)
{
if (a[i]==false){
nr++;
for (int j = i; j < n; j += i){
a[j] = true;
}
}
}
o << nr;
o.close();
return 0;
}