Cod sursa(job #340060)
Utilizator | Data | 12 august 2009 22:04:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<cmath>
using namespace std;
int main() {
ofstream fout("ciur.out");
ifstream fin("ciur.in");
int n;
int count = 0;
fin >> n;
for(int i = 1; i <= n; i++) {
int iSqrt = sqrt(i);
for(int z = 1; z <= iSqrt; z++) {
if(i%z != 0) {
count++;
}
}
}
fout << count;
return 0;
}