Pagini recente » Cod sursa (job #1042636) | Cod sursa (job #1042631) | Monitorul de evaluare | Cod sursa (job #2477397)
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
int n;
int total = 0;
void read();
void write();
void calculate();
bool primes(int i, int j);
int main() {
read();
calculate();
write();
}
void read() {
std::ifstream in("fractii.in");
in >> n;
in.close();
}
void calculate() {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (primes(i,j)) {
total++;
}
}
}
bool primes(int i, int j) {
if (i == 1 || j == 1) return true;
if (i == j) return false;
if (j == 1) return true;
if (!std::max(i, j) % std::min(i, j)) return false;
else {
int mini = std::min(i,j);
for (int k = 2; k <= mini + 1; k++)
if (!(i % k) && !(j % k)) return false;
}
}
void write() {
std::ofstream out("fractii.out");
out << total;
out.close();
}