Cod sursa(job #1316591)
Utilizator | Data | 13 ianuarie 2015 22:14:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b) {
if(a) return gcd(b%a, a);
else return b;
}
int main() {
int T, a, b;
fin>>T;
while(T--) {
fin>>a>>b;
if(a>b) swap(a, b);
fout<<gcd(a, b)<<'\n';
}
return 0;
}