第十二周oj平台：求N组数的最大公约数

#include <iostream>using namespace std;int gcd(int x,int y);int main(){    int n,x,a,b;    cin>>n;    for(x=1;x<=n;x++)    {        cin>>a>>b;        cout<<gcd(a,b)<<endl;    }    return 0;}int gcd(int x,int y){    int a,t;    if(x<=y)    {        t=x;        x=y;        y=t;    }    a=x%y;    while(a!=0)    {      x=y;      y=a;      a=x%y;    }    return y;}