Cod sursa(job #1109381)
Utilizator | Data | 17 februarie 2014 08:42:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <stdio.h>
using namespace std;
int x[100],n;
int gcd(int a,int b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main()
{
freopen("date.in","r",stdin);
freopen("date.out","w",stdout);
int i,a,b;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}