Cod sursa(job #1872650)
Utilizator | Data | 8 februarie 2017 14:20:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
using namespace std;
long long i,n,m,k,a[100200];
int main(){
cin>>n;
for (i=1;i<=n;i++){
cin>>m>>k;
while (m!=k){
if (k>m) k=k-m;
if (k<m) m=m-k;
}
a[i]=m;
}
for (i=1;i<=n;i++)
cout<<a[i]<<endl;
return 0;
}