Cod sursa(job #1325056)
| Utilizator | Data | 23 ianuarie 2015 10:45:13 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
/*
Rescriere OLI 2015
Start: 10:45
*/
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int GCD(int A, int B)
{
if(!B)
return A;
return GCD(B, A%B);
}
void Read()
{
int N, x, y;
fin >> N;
for(int i = 1; i <= N; i++)
{
fin >> x >> y;
fout << GCD(x, y) << "\n";
}
}
int main()
{
Read();
return 0;
}
