Cod sursa(job #2431865)
Utilizator | Data | 20 iunie 2019 23:50:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
/*
* main.cpp
*
* Created on: Jun 19, 2019
* Author: stefan
*/
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int a,b;
cin>>a>>b;
int div =0;
vector<int> vec1;
if(a<=b){
while(div<=a){
div++;
if(a % div == 0 && b%div==0){
vec1.push_back(div);
}
}}
else{
while(div<=b){
div++;
if(a % div == 0 && b%div==0){
vec1.push_back(div);
}
}
}
cout<<vec1[vec1.size()-1];
}
}