Cod sursa(job #1648958)
| Utilizator | Data | 11 martie 2016 12:07:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
int n, a, b, i;
int euclid (int a, int b)
{
if(!b) return a;
return euclid(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d %d",&a,&b);
printf("%d\n",euclid(a,b));
}
return 0;
}
