Cod sursa(job #2291412)
Utilizator | Data | 27 noiembrie 2018 22:52:31 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream input("fractii.in");
ofstream output("fractii.out");
int main()
{
int N, a, b, r, cateisba;
input >> N;
cateisba = 2 * N - 1;
for(int i = 2; i <= N; i++) {
for(int j = 2; j <= N; j++) {
if(__gcd(i, j) == 1)
cateisba++;
}
}
output << cateisba;
return 0;
}