gcd for n numbers using euclid as logic

import java.util.Scanner; class Main { public static int gcd(int A,int B) { int a =A; int b=B; int a_,b_; while(a!=0) { a_=b%a; b_=a; a=a_; b=b_; ...