Cod sursa(job #1959275)
Utilizator | Data | 9 aprilie 2017 12:20:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <sstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T,a,b;
int gcd(int x,int y) {
return gcd(y,x%y);
}
int main() {
in>>T;
while (T--) {
in>>a>>b;
out<<gcd(a,b)<<'\n';
}
in.close();out.close();
return 0;
}