Cod sursa(job #2664725)
Utilizator | Data | 29 octombrie 2020 11:01:47 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
int c;
while (b)
{
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int n, cnt = 0;
cin >> n;
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= n; j ++)
{
if(euclid(i, j) == 1)
{
cnt++;
}
}
}
cout << cnt;
return 0;
}