Cod sursa(job #1994321)
Utilizator | Data | 24 iunie 2017 17:48:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a,int b)
{
int r=a%b;
while (r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
int n,a,b;
fin >> n;
for (int i=1;i<=n;i++)
{
fin >> a >> b;
fout << gcd(max(a,b),min(a,b))<<"\n";
}
}