Cod sursa(job #2232832)
Utilizator | Data | 21 august 2018 12:57:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int n,x,y;
int euclid(int a, int b)
{
int aux;
if(b!=0 && a!=0)
{
while(b!=0)
{
aux=a;
a=b;
b=aux%b;
}
return a;
}
return 0;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x>>y;
fout<<euclid(x,y)<<"\n";
}
fin.close();
fout.close();
return 0;
}