Cod sursa(job #1909047)
Utilizator | Data | 7 martie 2017 11:30:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
inline int Cm(int a, int b) {
while(b) {
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int n, a, b;
f >> n;
for(int i = 1; i <= n; i++) {
f >> a >> b;
g << Cm(a,b) << "\n";
}
return 0;
}