Cod sursa(job #2420675)
| Utilizator |  Vlad Poncea vladponcea |
Data | 12 mai 2019 22:52:53 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd( int a, int b)
{
if(!b){
return a;
}
else{
return gcd(b,a%b);
}
}
int t, a, b;
int main(){
in >> t;
for (int i = 0; i < t; i++){
in >> a >> b;
out << gcd(a, b);
}
return 0;
}