Cod sursa(job #2445192)
Utilizator | Data | 3 august 2019 07:37:16 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int euclid(int a,int b)
{
int r;
while(a%b!=0)
{
r=a%b;
a=b;
b=r;
}
return b;
}
int main()
{
int x,k;
k=0;
f>>x;
for(int i=1;i<=x;i++)
for(int j=1;j<=x;j++)
if(euclid(i,j)==1)
k++;
g<<k<<'\n';
}