Cod sursa(job #2643301)
| Utilizator | Data | 19 august 2020 14:21:01 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <fstream>
using namespace std;
unsigned long long euclid(unsigned long long x, unsigned long long y)
{
unsigned long long r;
if(x>y)
{
r=x%y;
while(r>=1)
{
x=y;
y=r;
r=x%y;
}
return y;
}
else
{
r=y%x;
while(r>=1)
{
y=x;
x=r;
r=y%x;
}
return x;
}
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
unsigned long long n,nr=0;
f>>n;
for(unsigned long long i=1;i<=n;++i)
for(unsigned long long j=1;j<=n;++j)
if(euclid(i,j)==1)
++nr;
g<<nr;
f.close();
g.close();
return 0;
}