Cod sursa(job #1130982)
| Utilizator | Data | 28 februarie 2014 16:57:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define NMAX 2000001
bool Prim[NMAX];
int N,Count;
void Read(){
f>>N;
}
void Solve(){
for (int i = 1; i <= N; i++) {
Prim[i] = true;
}
for (int i = 2; i <= N; i++) {
if (Prim[i] == true) {
Count++;
for (int j = i + i; j <= N; j+= i) {
Prim[j] = false;
}
}
}
}
void Write(){
g<<Count;
}
int main(){
Read();
Solve();
Write();
}