To seek greatest common divisor by the method of dividing, not goto

1#include <iostream>2 using namespacestd;3 //Goto is not recommended, of course it is faster4 //the greatest common divisor of two numbers by the way of dividing5 intgcdLong intALong intb) {6     intX=a<b?a:b;7     //get the lesser of the constraint values used to make loops8     9      for(intI=0; i<x;x++){Ten         //Loops One       if(a>b) { A           intR=a%b;//take the remainder -           if(r==0){//can divide and judge -              returnb//can then output the}Else{//otherwise the next round of algorithms -a=b,b=R; -           } -}Else if(A&LT;B) {//Same as below +           intr=b%A; -           if(r==0){ +               returnA; A}Else{ atB=a,a=R; -           } -}Else{//two numbers equal, directly outputting one of them. -           returnA; -       } -    } in } -  to intMain () { +     inty=0; Y=GCD (156,176); -cout<<"the greatest common divisor of 156 and 176 are:"<<y; the  *     return 0; $}

To seek greatest common divisor by the method of dividing, not goto