Cod sursa(job #2485948)
Utilizator | Data | 2 noiembrie 2019 10:50:15 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
ifstream in("fractii.in");
ofstream out("fractii.out");
int main()
{
int n,fractii=0;
in >>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++){
if (euclid(i,j)==1){
fractii++;
}
}
out <<fractii;
}