Cod sursa(job #1021018)
Utilizator | Data | 2 noiembrie 2013 23:32:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out")
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
int T, A, B;
f>>T;
int n;
for(; T; --T)
{
f>>A>>B;
n=gcd(A, B);
g<<'\n'<<n<<'\n';
}
return 0;
}