Cod sursa(job #2407691)
Utilizator | Data | 17 aprilie 2019 09:59:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int n;
pair < int, int > p;
vector < pair < int, int > > v;
int gcd(int a, int b) {
int t;
while(b) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
cin>>n;
for(; cin>>p.first>>p.second; )
v.push_back(p);
cin.close();
for(int i = 0; i < n; i++) {
cout<<gcd(v.at(i).first, v.at(i).second)<<'\n';
}
cout.close();
return 0;
}