Cod sursa(job #1217201)
Utilizator | Data | 6 august 2014 21:07:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
using namespace std;
//input/output files
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int aux,n,x,y;
int cmmdc(int a, int b)
{
while(b != 0)
{
aux = b;
b = b % a;
a = aux;
}
return a;
}
int main()
{
f >> n;
for(int i = 1; i <= n; i++)
{
f >> x;
f >> y;
g << cmmdc(x,y);
}
return 0;
}