Pagini recente » Cod sursa (job #1232134) | Cod sursa (job #1222027) | Cod sursa (job #1618937) | Cod sursa (job #2960725) | Cod sursa (job #1343502)
#include <fstream>
#include <iostream>
using namespace std;
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
int N;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin >> N;
int sum = N;
for (int i = 2; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
if (j == 1)
{
sum++;
}
else
{
if (euclid(i, j) == 1)
{
sum++;
}
}
}
}
fout << sum;
return 0;
}