Cod sursa(job #2658694)
Utilizator | Data | 14 octombrie 2020 20:12:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
int cmmdc(int a, int b)
{
if(!b)return a;
else return cmmdc(b, a%b);
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int a , b;
cin>>a>>b;
cout<<cmmdc(a, b);
}
return 0;
}