Script started on Sat Mar 04 02:22:33 2000 john@vega:(~/Classes/CS2500/02GCD) a.out This program computes greatest common divisors. Each time you enter a pair of positive integers the program will compute and report the greatest common divisor. When you want to stop, just enter two zeros. Enter two positive integers, or two zeros to stop: 14 35 Working on 14 and 35 ... Working on 7 and 14 ... Gcd(14,35) is 7. Enter two positive integers, or two zeros to stop: 11 15 Working on 11 and 15 ... Working on 4 and 11 ... Working on 3 and 4 ... Working on 1 and 3 ... Gcd(11,15) is 1. Enter two positive integers, or two zeros to stop: 180 252 Working on 180 and 252 ... Working on 72 and 180 ... Working on 36 and 72 ... Gcd(180,252) is 36. Enter two positive integers, or two zeros to stop: 2873 6643 Working on 2873 and 6643 ... Working on 897 and 2873 ... Working on 182 and 897 ... Working on 169 and 182 ... Working on 13 and 169 ... Gcd(2873,6643) is 13. Enter two positive integers, or two zeros to stop: 4148 7684 Working on 4148 and 7684 ... Working on 3536 and 4148 ... Working on 612 and 3536 ... Working on 476 and 612 ... Working on 136 and 476 ... Working on 68 and 136 ... Gcd(4148,7684) is 68. Enter two positive integers, or two zeros to stop: 1001 7655 Working on 1001 and 7655 ... Working on 648 and 1001 ... Working on 353 and 648 ... Working on 295 and 353 ... Working on 58 and 295 ... Working on 5 and 58 ... Working on 3 and 5 ... Working on 2 and 3 ... Working on 1 and 2 ... Gcd(1001,7655) is 1. Enter two positive integers, or two zeros to stop: 0 0 john@vega:(~/Classes/CS2500/02GCD) exit script done on Sat Mar 04 02:23:43 2000