Cod sursa(job #1549882)
Utilizator | Data | 12 decembrie 2015 21:18:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int n, a, b;
int euclid(int a, int b)
{
int c = 0;
while (b)
{
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
f >> n;
for (int i = 1; i <= n; ++i)
{
f >> a >> b;
g << euclid(a, b) << endl;
}
return 0;
}