Cod sursa(job #2739290)
Utilizator | Data | 7 aprilie 2021 16:33:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int teste,n,m,r[100],p=0;
cin>>teste;
while(teste!=0)
{
cin>>n>>m;
while(n!=m)
if(n>m)
n-=m;
else
m-=n;
r[p++]=n;
teste--;
}
for(int i=0;i<p;++i)
cout<<r[i]<<endl;
return 0;
}