Начало
Рабочее место участника
| Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |
Задачи
701. And Now, a Remainder from Our Sponsor
Китайская теорема об остаткахОлимпиадные задачи на английском языке
| 21/11/2007 | Тренировка (задачи ACM ICPC ECNA RC 2007) (G) |
| 15/07/2013 | Лето 2013-10 (командная) (G) |
Ограничения: время – 2s/4s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
IBM has decided that all messages sent to and from teams competing in the ACM programming contest
should be encoded. They have decided that instead of sending the letters of a message, they will transmit
their remainders relative to some secret keys which are four, two-digit integers that are pairwise relatively
prime. For example, consider the message "THE CAT IN THE HAT". The letters of this message are first
converted into numeric equivalents, where A=01, B=02, …, Z=26 and a blank=27. Each group of 3
letters is then combined to create a 6 digit number. (If the last group does not contain 3 letters it is
padded on the right with blanks and then transformed into a 6 digit number.) For example
THE CAT IN THE HAT -> 200805 270301 202709 142720 080527 080120
Each six-digit integer is then encoded by replacing it with the remainders modulo the secret keys as
follows: Each remainder should be padded with leading 0's, if necessary, to make it two digits long. After
this, the remainders are concatenated together and then any leading 0's are removed. For example, if
the secret keys are 34, 81, 65, and 43, then the first integer 200805 would have remainders 1, 6, 20 and
38. Following the rules above, these combine to get the encoding 1062038. The entire sample message
above would be encoded as
1062038 1043103 1473907 22794503 15135731 16114011
Input
The input consists of multiple test cases. The first line of input consists of a single positive integer `n`
indicating the number of test cases. The next `2n` lines of the input consist of the test cases. The first
line of each test case contains a positive integer (< 50) giving the number of groups in the encoded
message. The second line of each test case consists of the four keys followed by the encoded message.
Each message group is separated with a space.
Output
For each test case write the decoded message. You should not print any trailing blanks.
Sample Input
2 6 34 81 65 43 1062038 1043103 1473907 22794503 15135731 16114011 3 20 31 53 39 5184133 14080210 7090922
Sample Output
THE CAT IN THE HAT THE END
