Cod sursa(job #2685770)
Utilizator | Data | 17 decembrie 2020 17:57:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
void get(int a,int b)
{ if(a%b==0)fout<<b<<endl;
else
if(b%a==0)fout<<a<<endl;
else
{
while(a!=b)
{
if(a>b)a=a-b;
else b=b-a;
}
fout<<a<<endl;
}
}
int main()
{
int n,a,b;
fin>>n;
for(int i=1;i<=n;++i)
{
fin>>a>>b;
get(a,b);
}
return 0;
}