Cod sursa(job #1697390)
| Utilizator | Data | 1 mai 2016 21:16:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
ll cmmdc(ll a, ll b)
{
if(a == 0)
return b;
if(b == 0)
return a;
if(a == b)
return a;
return cmmdc(b, a % b);
}
int main()
{
ifstream in;
ofstream out;
in.open("euclid2.in");
out.open("euclid2.out");
int t;
in >> t;
while(t--) {
ll a, b;
in >> a >> b;
out << cmmdc(a,b) << endl;
}
in.close();
out.close();
return 0;
}
