Cod sursa(job #1174844)
Utilizator | Data | 24 aprilie 2014 00:00:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#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;
}