Hdoj (HDU) 2503 A/b + C/D (greatest common divisor problem)

Problem Description
Give you 2 scores, beg them and, and ask and for the simplest form.

Input
The input first consists of a positive integer T (t<=1000), which indicates that there is a T-group of test data, followed by a T-line of data, each line containing four positive integers a,b,c,d (0

Import Java.util.Scanner; Public classmain{ Public Static void Main(string[] args) {Scanner sc=NewScanner (System.inch);intT =sc.nextint (); while(t-->0){intA = Sc.nextint ();intb =sc.nextint ();intc = Sc.nextint ();intD = Sc.nextint ();intn = a*d+c*b;intm = b*d;            A=n; B=m;if(m>n) {//n must be greater than or equal to MM=m^n;                N=m^n;            M=m^n; }//Greatest common divisor---of N and M             while(m>0){intk=n%m;                N=m;            M=k; } System. out. println (int) a/n+" "+(int) b/n); }    }}

Hdoj (HDU) 2503 A/b + C/D (greatest common divisor problem)