Pagini recente » Cod sursa (job #2310952) | Cod sursa (job #614349) | Istoria paginii runda/53543gf/clasament | Istoria paginii runda/cercel_e_gay_runda_2/clasament | Cod sursa (job #2482239)
#include <fstream>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
int n,i,j;
fin>>n;
int a=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(euclid(i,j)==1)
a++;
}
fout<<a;
return 0;
}