Cod sursa(job #2182928)
| Utilizator | Data | 22 martie 2018 18:30:03 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
using namespace std;
int maxDiv(int n,int m){
int aux = 1;
if (n > m){
for (int i = 1; i <= n; i++){
if (n%i == 0 && m%i == 0) aux = i;
}
} else {
for (int i = 1; i <= m; i++){
if (n%i == 0 && m%i == 0) aux = i;
}
}
return aux;
}
int main()
{
int n;
cin>>n;
int res = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++){
if (maxDiv(i,j) == 1) res++;
}
cout<<res;
return 0;
}
