Cod sursa(job #1596938)
Utilizator | Data | 11 februarie 2016 15:26:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define MAX 2000003
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char v[MAX];
//int prim[100000];
long n,k;
int main() {
in >> n;
for(long long i = 2; i <= n; i++) {
if(v[i] == 0) {
k++;
long long mult = i*i;
while(mult < MAX-3) {
v[mult] = 1;
mult += i;
}
}
}
out << k;
return 0;
}