question: calculates the greatest common divisor of n numbers concode_field_sep PlaceHolder placeHolder concode_field_sep int lcm concode_elem_sep int lcm
target: int function ( Integer [ ] arg0 ) { int loc0 = arg0 [ 0 ] ; for ( int loc1 : arg0 ) { loc0 = gcd ( loc0 , loc1 ) ; } return loc0 ; }