Cod sursa(job #1868647)
Utilizator | Data | 5 februarie 2017 06:23:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
// computes gcd(a,b)
int gcd(int a, int b) {
while (b) { int t = a%b; a = b; b = t; }
return a;
}
int main() {
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int T; fin >> T;
for (int t = 0; t < T; t++) {
int a, b; fin >> a >> b;
fout << gcd (a, b) << "\n";
}
return 0;
}