Cod sursa(job #1197383)
Utilizator | Data | 11 iunie 2014 20:07:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int a, int b);
int main()
{
int t, a, b;
in >> t;
for(;t;--t)
{
in >> a >> b;
out << gcd(a, b);
}
return 0;
}
int gcd(int a, int b)
{
if(b==0) return a;
return gcd(b, a%b);
}