Pagini recente » Cod sursa (job #2644183) | Cod sursa (job #1090101) | Cod sursa (job #79354) | Cod sursa (job #3218667) | Cod sursa (job #2628951)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout("fractii.out");
int n, total = 0, i = 0, j = 0;
bool prim(int i, int j)
{
int r = 0;
while(j)
{
r = i % j;
i = j;
j = r;
}
if(i == 1)
return true;
return false;
}
int main()
{
fin>>n;
total = n + n - 1;
for(i=2; i<=n; i++)
{
for(j=2; j<=n; j++)
{
if(i % j != 0 && j % i != 0 && prim(i, j) == true)
total++;
}
}
fout<<total;
return 0;
}