Pagini recente » clasament-arhiva-educationala | Istoria paginii runda/muzica/clasament | Clasamentul arhivei de probleme | Clasamentul arhivei de probleme | Cod sursa (job #1989627)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("fractii.in");
ofstream fo("fractii.out");
int cmmdc(int a, int b)
{
while(a != b)
if(a > b)
a = a - b;
else b = b-a;
if (b != 1)
return b;
else
return 0;
}
int main()
{
int n;
fi>>n;
int k = 0;
for (int i = 2; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if ((cmmdc(i,j) == 0))
k++;
}
}
fo<<k+n;
return 0;
}