Cod sursa(job #766021)
| Utilizator | Data | 10 iulie 2012 01:15:50 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
FILE *f = fopen ("euclid2.in","r");
FILE *g = fopen ("euclid2.out","w");
int T, a, b;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
fscanf (f, "%d", &T);
while (T--)
{
fscanf (f, "%d%d", &a, &b);
fprintf (g, "%d\n", gcd(a,b) );
}
fclose(f);
fclose(g);
return 0;
}
