Pagini recente » Cod sursa (job #3151040) | Profil alex.cojocaru | Cod sursa (job #2007828) | Cod sursa (job #1650650) | Cod sursa (job #1174844)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
long int m,n,i,j,mn;
long int euclid(int i,int j)
{
if(j==0)return i;
else
if(i>j)return euclid(i-j,j);
else
return euclid(i,j-i);
}
int main()
{
f.open("euclid.in");
g.open("euclid.out");
f>>n;
while(n>0)
{
n--;
f>>i>>j;
g<<euclid(i,j)<<endl;
}
f.close();
g.close();
return 0;
}