Cod sursa(job #2911310)
| Utilizator | Data | 28 iunie 2022 15:22:13 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int divizor(int a,int b)
{
while(a!=b)
{
if(a>b)
a-=b;
else
b-=a;
}
return a;
}
int main()
{
int nr;
int a,b;
f>>nr;
for(int i=0;i<nr;i++)
{
f>>a>>b;
g<<divizor(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}
