Cod sursa(job #1233701)
Utilizator | Dumitriu Sebastian sebinsteanu | Data | 25 septembrie 2014 21:36:22 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cm(long int a,long int b,long int d)
{
if(a%d==0 && b%d==0) return d;
else return cm(a,b,d-1);
}
int main()
{
long int a,b,d;
int T,i;
in>>T;
for(i=1;i<=T;i++)
{
in>>a>>b;
d=min(a,b);
out<<cm(a,b,d)<<"\n";
}
in.close();
out.close();
return 0;
}