Cod sursa(job #2420269)
Utilizator | Data | 11 mai 2019 13:30:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int n;
fin >> n;
for(int i = 0; i < n; i++)
{
int a, b;
fin >> a >> b;
while(a % b)
{
int r = a % b;
a = b;
b = r;
}
fout << b << endl;
}
return 0;
}