Cod sursa(job #1983044)
| Utilizator | Data | 21 mai 2017 09:02:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
#define ll long long
#define pb push_back
const int NMax = 1e1 + 5;
int T;
ll euclid(ll a,ll b) {
if (b == 0) {
return a;
}
return euclid(b,a%b);
}
int main() {
in>>T;
while (T--) {
ll a,b;
in>>a>>b;
out<<euclid(a,b)<<'\n';
}
in.close();out.close();
return 0;
}
