Cod sursa(job #2739291)
Utilizator | Data | 7 aprilie 2021 16:37:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int teste,n,m,r[100],p=0;
fin>>teste;
while(teste!=0)
{
fin>>n>>m;
while(n!=m)
if(n>m)
n-=m;
else
m-=n;
r[p++]=n;
teste--;
}
for(int i=0;i<p;++i)
fout<<r[i]<<endl;
return 0;
}