Cod sursa(job #2194256)
| Utilizator | Data | 12 aprilie 2018 17:59:48 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int fractii(int n)
{
int ret = 0;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
int n1 = i, n2 = j;
while(n1 != n2) {
n1 = n1 > n2? n1 - n2 : n1;
n2 = n2 > n1? n2 - n1 : n2;
}
if(n1 == 1)
ret++;
}
}
return ret;
}
int main(void)
{
ofstream output;
ifstream input;
output.open("fractii.out");
input.open("fractii.in");
int n;
input >> n;
output << fractii(n);
return 0;
}
