Cod sursa(job #1828204)
Utilizator | Data | 12 decembrie 2016 22:06:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
int euclid(int a, int b)
{
if(a==0 || b==0)
return a+b;
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
return a;
}
}
int main()
{
int a,b,i,sol;
fin>>t;
for(i=1;i<=t;i++)
{
fin>>a>>b;
sol=euclid(a,b);
fout<<sol<<"\n";
}
return 0;
}