Pagini recente » Borderou de evaluare (job #1583143) | Diferente pentru problema/bitconnect intre reviziile 16 si 17 | Cod sursa (job #1549924) | Cod sursa (job #2886572) | Cod sursa (job #243759)
Cod sursa(job #243759)
/*
Nume:Temian
Date:
Problema:
*/
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
unsigned long int q,i,n,c=0;
cin>>n;
fin.close();
for(i=1;i<=n;i++)
{
for(q=1;q<=n;q++)
if(euclid(q,i)==1)c++;
}
cout<<c;
fout.close();
system ("pause");
return 1;
}