Cod sursa(job #190208)
Utilizator | Data | 21 mai 2008 02:56:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
fin >>T;
for (; T; --T)
{
fin >>A>>B;
fout <<gcd(A, B)<<"\n";
}
return 0;
}