## 25 Jan PMCA Friday 19:00 Python Homework 21.01.22.

**Question:**

Write a program which accepts as input a positive integer and checks, using the algorithm described below, to see whether or not the integer is divisible by 11. This particular test for divisibility by 11 was given in 1897 by Charles L. Dodgson (Lewis Carroll).

Algorithm:

As long as the number being tested has more than two digits, form a new number by:

deleting the units digit

subtracting the deleted digit from the shortened number

The remaining number is divisible by 11 if and only if the original number is divisible by 11.

Note:

Leading zeroes are not considered part of the number and should not be printed.

As usual, the first number in the input indicates the number of positive integers that follow. Each positive integer has a maximum of 50 digits. You may assume no leading zeroes exist in the positive integers.

For each positive integer in the input, the output consists of a series of numbers formed as a digit is deleted and subtracted, followed by a message indicating whether or not the original number is divisible by 11. Outputs for different positive integers are separated by blank lines.

Sample Input

2

12345678901234567900

10Sample Output

12345678901234567900

1234567890123456790

123456789012345679

12345678901234558

1234567890123447

123456789012337

12345678901226

1234567890116

123456789005

12345678895

1234567884

123456784

12345674

1234563

123453

12342

1232

121

11

The number 12345678901234567900 is divisible by 11.

10

The number 10 is not divisible by 11.

Sorry, the comment form is closed at this time.