Pagini recente » Cod sursa (job #1776517) | Cod sursa (job #1837327) | Cod sursa (job #139660) | Cod sursa (job #2015604) | Cod sursa (job #2182942)
#include <iostream>
#include <fstream>
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()
{
ifstream f_in("fractii.in");
int n;
f_in>>n;
f_in.close();
int res = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++){
if (maxDiv(i,j) == 1) res++;
}
ofstream f_out("fractii.out");
f_out<<res;
f_out.close();
return 0;
}