Pagini recente » Cod sursa (job #649360) | Cod sursa (job #447004) | Cod sursa (job #237190) | Cod sursa (job #2863788) | Cod sursa (job #1759260)
#include <iostream>
#include <fstream>
using namespace std;
bool nincs_oszto(int a, int b)
{
while(a!=b)
{
if(a>b) a -= b;
else b -= a;
}
if(a == 1) return true;
else return false;
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
f>>n;
int p = 2*n-1;
for(int i = 2; i <= n; i++)
{
for(int j = 2; j <= n; j++)
{
if(nincs_oszto(i, j)) p++;
}
}
g<<p;
return 0;
}