Cod sursa(job #1002072)
Utilizator | Data | 26 septembrie 2013 20:30:05 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int divizor(int a,int b);
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int a,b,t;
fin>>t;
for(int i=0;i<t;i++)
{
fin>>a>>b;
fout<<divizor(a,b)<<"\n";
}
fin.close();
fout.close();
return 0;
}
int divizor(int a, int b)
{
if(a%b==0)
return b;
else
return divizor(b,a%b);
}