Cod sursa(job #2223711)
Utilizator | Data | 21 iulie 2018 11:16:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid.in");
ofstream g("euclid.out");
int euclid(int a, int b)
{
while(a != b)
if(a > b)
a = a - b;
else
b = b - a;
return a;
}
int main()
{
int t, a, b, k;
f >> t;
for(int i = 0; i < t; ++i)
{
f >> a >> b;
g << euclid(a,b) << endl;
}
return 0;
}