Pagini recente » Cod sursa (job #1564576) | Cod sursa (job #1522857) | Cod sursa (job #1603792) | Cod sursa (job #2730979) | Cod sursa (job #335029)
Cod sursa(job #335029)
#include<fstream>
using namespace std;
int euclid (int a, int b)
{
int r = a%b;
if (a < b)
{ r=a; a=b; b=r; }
while (r)
{
r = a%b;
a=b;
b=r;
}
return a;
}
int main()
{
fstream f ("fractii.in", ios::in);
fstream g ("fractii.out", ios::out);
int n,p,q;
f>>n;
int k=2*n-1;
for (p=2; p<=n; p++)
for (q=2; q<=n; q++)
if (euclid(p,q)==1 || euclid(q,p)==1)
k++;
g<<k;
f.close();
g.close();
return 0;
}