Cod sursa(job #875966)
Utilizator | Data | 11 februarie 2013 02:22:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int n;
struct cmmdc
{
int a,b;
}v;
int Euclid(int a, int b)
{
while(b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
void rezolvare(int n)
{
for(int i=0;i<n;i++)
{scanf("%d %d",&v.a,&v.b);
printf("%d\n",Euclid(v.a,v.b));
}
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
rezolvare(n);
return 0;
}