Cod sursa(job #2200823)
Utilizator | Runcan Alexandru Alex03 | Data | 2 mai 2018 18:46:11 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main ()
{
int t;//T reprezinta numarul de perechi de numere
long int a,b;
fin >>t;
for (int i = 1;i <= t;i++)
{
fin >>a >>b;
fout << euclid(a,b)<<endl;
}
return 0;
}