Pagini recente » Cod sursa (job #616197) | Cod sursa (job #2247097) | Cod sursa (job #2479423) | Cod sursa (job #921687) | Cod sursa (job #1470941)
using namespace std;
#include<iostream>
#include<fstream>
bool euclid(long int a,long int b)
{
long int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
if(a==1)
return true;
else
return false;
}
int main()
{
long int n,i,j,count=0;
bool b;
ifstream in;
ofstream out;
out.open("fractii.out");
in.open("fractii.in");
in>>n;
in.close();
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(euclid(i,j)==true)
count++;
}
out<<count;
out.close();
cin.get();
}