ÀÂÒ
Language: Russian
English

Remote Training on Programming

Problems Online status Contests
News FAQ E-learning
For authors:
Register  ||  Login
 
Hello, Guest! Please login or register.

26. Secret Code

Time Limit: 10 seconds
Memory Limit:65536KB
Points:100
View Problem Statistics Submit Problem added debug

The Sarcophagus is locked by a secret numerical code. When somebody wants to open it, he must know the code and set it exactly on the top of the Sarcophagus. A very intricate mechanism then opens the cover. The code (consisting of up to 100 integers) was hidden in the Alexandrian Library but unfortunately, as you probably know, the library burned down completely.

But an almost unknown archaeologist has obtained a copy of the code something during the 18th century. He was afraid that the code could get to the "wrong people" so he has encoded the numbers in a very special way. He took a random complex number B that was greater (in absolute value) than any of the encoded numbers. Then he counted the numbers as the digits of the system with basis B. That means the sequence of numbers an, an-1, ..., a1, a0 was encoded as the number X = a0 + a1B + a2B2 + ...+ anBn.

Your goal is to decrypt the secret code, i.e. to express a given number X in the number system to the base B. In other words, given the numbers X and B you are to determine the "digit" a0 through an.

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case consists of one single line containing four integer numbers Xr, Xi, Br, Bi (|Xr|,|Xi| <= 1000000, |Br|,|Bi| <= 16). These numbers indicate the real and complex components of numbers X and B, i.e. X = Xr + i*Xi, B = Br + i*Bi. B is the basis of the system (|B| > 1), X is the number you have to express.

Output

Your program must output a single line for each test case. The line should contain the "digits" an, an-1, ..., a1, a0, separated by commas. The following conditions must be satisfied:

for all i in {0, 1, 2, ..., n}: 0 <= ai < |B|

X = a0 + a1B + a2B2 + ...+ anBn

if n>0 then an<>0

n<=100

If there are no numbers meeting these criteria, output the sentence "The code cannot be decrypted.". If there are more possibilities, print any of them.

Sample

InputOutput
4
-935 2475 -11 -15
1 0 -3 -2
93 16 3 2
191 -192 11 -12
88,11,18
1
The code cannot be decrypted.
16,15

View Problem Statistics Submit Problem discussion Author/source:
Problems from Contests and Camps / Trainings of Vologda SU / VSTU-VSPU #2 /
26. 27. B - Crossed Mathings 28. C - Labyrinth 29. D - Magazine Delivery
time generating 0.109 sec.
© Copyright VSU, AVT, Nosov D.A., Andrianov I.A.