Let be a positive number such that when is divided by , the remainder is Compute the sum of all possible two-digit values of .
The possible values of d are 14, 28, and 66, so the answer is 14 + 28 + 66 = 108.
a=10; c=109 % a; if(c==4, goto3, goto4);printa; a++;if(a<100, goto1, 0)
15, 21, 35
109 mod 15 ==4 - Remainder
109 mod 21 ==4 - Remainder
109 mod 35 ==4 - Remainder
Two-digit moduli ==15 + 21 + 35 ==71