Cod sursa(job #2280777)
Utilizator | ![]() |
Data | 11 noiembrie 2018 09:56:10 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int T,a,b,i,z,x,y;
fin>>T;
for(i=1;i<=T;i=i+1)
{
fin>>a>>b;
x=a;
y=b;
while(x!=y)
{
if(x>y)
{
x=x-y;
}
else
{
y=y-x;
}
fout<<x<<"\n";
}
}
fin.close();
fout.close();
return 0;
}