Cod sursa(job #1473056)
Utilizator | Data | 18 august 2015 14:11:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream f("euclid2.out");
int cmmdc (int x, int y)
{
int r;
r = 0;
while (y)
{
r = x%y;
x = y;
y = r;
}
return x;
}
int main ()
{
int T, i;
int a, b;
f >> T;
for (i=1; i<=T; i++)
{
f >> a >> b;
g << cmmdc (a, b);
}
return 0;
}