Cod sursa(job #1380253)
Utilizator | Data | 7 martie 2015 04:26:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#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 M;
fin >> M;
for(int i = 1; i <= M; i++)
{
int x, y;
fin >> x >> y;
fout << GCD(x, y) << "\n";
}
}
int main()
{
Read();
return 0;
}