Cod sursa(job #1250047)
Utilizator | Data | 27 octombrie 2014 19:34:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long x,y,n;
long CMMDC(long a, long b)
{
long t;
while (b != 0)
{
t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
f>>n;
for(int i=0; i<n; i++)
f>>x>>y,g << CMMDC(x,y) << endl;
return 0;
}