Cod sursa(job #1657708)
Utilizator | Data | 20 martie 2016 18:32:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
int gcd(int a, int b) {
if(!b)
return a;
return gcd(b, a % b);
}
int main() {
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int a, b, t;
in>>t;
while(t--) {
in>>a>>b;
out<<gcd(a,b)<<"\n";
}
return 0;
}