Cod sursa(job #1976589)
Utilizator | Data | 3 mai 2017 20:17:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
/*
Keep It Simple!
*/
#include <fstream>
using namespace std;
int gcd(int a, int b) {
int aux;
while (b) {
aux = a%b;
a = b;
b = aux;
}
return a;
}
void Solve() {
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T;
int a, b;
f >> T;
while (T--) {
f >> a >> b;
g << gcd(a,b) << '\n';
}
}
int main() {
Solve();
return 0;
}