Cod sursa(job #2383578)
Utilizator | Data | 19 martie 2019 17:54:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int a, int b){
return (b == 0 ? a : gcd(b, a%b));
}
int main(){
int t;
in>>t;
for(int i = 1, a, b; i <= t; ++i) in>>a>>b, out<<gcd(a, b)<<"\n";
return 0;
}