Cod sursa(job #2237574)
| Utilizator |  Abogatoaie Alexandru AlexAbo |
Data | 2 septembrie 2018 12:56:24 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
int t,a,b,cmmdc(int,int);
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int main()
{
f >> t;
for (;t;t--)
{
f >> a;
f >> b;
g << cmmdc(a,b) << "\n";
}
}
int cmmdc(int x, int y) {
while (x != y ) {
if ( x > y ) x = x - y;
else if ( y > x ) y = y - x;
}
return x;
}
