Pagini recente » Cod sursa (job #3165156) | Cod sursa (job #2321626) | Cod sursa (job #1588905) | Cod sursa (job #2539353) | Cod sursa (job #2241711)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int euclid(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
int N;
fin>>N;
int a=1, b=1;
int c=0;
for (int a=1; a<=N; a++)
{
for (int b=1; b<=N; b++)
{
if (a==b&&b==1)
{
c++;
}
else if(euclid(a, b)==1)
{
c++;
}
}
}
fout<<c;
return 0;
}