For Problem 1, name your source code gcd.ext, where ext denotes one of { java, cpp, py, cs } that indicates java/c++/python/mono language. You need to use just one source file per problem.

Problem Statement 1: Computing GCD Read in a sequence of 32-bit signed integers (several per line separated by spaces) until a single line containing zero (0). There will be at most 1000 integers per line. For each line except for the last one, compute the greatest common divisor (gcd) of that set of integers. Then output on a line the statement "The ged of the integers is x." where z is the desired ged. Note, for this problem, all answers should be non-negative. The input should be taken from keyboard/stdin/System.in Sample Input: 8 15 0 -5 6 20 25 5 30 28 21952 49 294 3822 0 The precisely formated output should be sent to console/stdout/System.out Sample Output: The ged of the integers is 2 The gcd of the integers is 5 The ged of the integers is 1. The ged of the integers is 7