// Description: Command-line calculator for greatest common divisor of integer
//	        pairs.
// Date: 2011-05-12 Khu

class GcdProblemSolver2Generic
{
   private static final String HINT = 
      "Please call the gcd problem solver with integer pairs as arguments! ";

   public static void main (String[] args) 
      // Given integer pairs as command arguments, 
      // print their greatest common divisor.
   {
      Problems2Generic.GcdSolution gcdSolution;
      if (args.length < 2) 
      {
         System.out.println("Missing Argument. " + HINT);
      } 
      else
      {
	 try 
	 {
	    Problems2Generic.GcdProblemQAI gcdProblem =
                new Problems2Generic.GcdProblemQAI();
	    int p, q;
	    for (int i = 1; i < args.length; i += 2)
	    {
	       p = Integer.parseInt(args[i-1]);
	       q = Integer.parseInt(args[i]);
	       gcdProblem.set(p, q);
	       System.out.println
		  ("gcd(" + p + ", " + q + ") = " + 
		   gcdProblem.solution().gcd());
	    }
	 } 
	 catch (Exception e) 
	 {
	    System.out.println("Wrong Argument. " + HINT + e.toString());
	 }
      }
   }
}