Cod sursa(job #1568007)
| Utilizator | Data | 13 ianuarie 2016 20:56:36 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
unsigned int T;
unsigned int a, b;
unsigned int i;
unsigned int GCD (unsigned int x, unsigned int y);
int main ()
{
fin >> T;
for (i=0; i<T; i++)
{
fin >> a >> b;
fout << GCD (a, b) << "\n";
}
return 0;
}
unsigned int GCD (unsigned int x, unsigned int y)
{
unsigned int r;
r = 0;
while (y)
{
r = x % y;
x = y;
y = r;
}
return x;
}
