Cod sursa(job #1446757)
| Utilizator | Data | 2 iunie 2015 19:03:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<iostream>
using namespace std;
typedef int var;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool p[2000005];
var ciur(var t) {
var cnt = t-1;
var i;
for(i=2; i*i<=t; i++) {
if(p[i] == 0) {
for(var j=i*i; j<=t; j+=i) {
if(p[j] == 0)
cnt--;
p[j] = 1;
}
}
}
return cnt;
}
int main() {
var t;
fin>>t;
fout<<ciur(t);
return 0;
}
