Cod sursa(job #2852777)
Utilizator | Data | 19 februarie 2022 15:54:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int euclid(int a,int b)
{
if(b>a)
{
swap(a,b);
}
int mod;
mod=a%b;
while(mod)
{
a=max(b,mod);
b=min(b,mod);
mod=a%b;
}
return b;
}
int main()
{
int t,a,b;
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>a>>b;
fout<<euclid(a,b)<<endl;
}
return 0;
}