0% found this document useful (0 votes)
134 views

621 PDF

The document describes an encryption scheme where the results of secret experiments are stored as digit strings. The strings can take one of four forms to indicate a positive result, negative result, failed experiment, or incomplete experiment. The program must take encrypted digit strings as input and output the corresponding result type.

Uploaded by

Vladimir Lem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
134 views

621 PDF

The document describes an encryption scheme where the results of secret experiments are stored as digit strings. The strings can take one of four forms to indicate a positive result, negative result, failed experiment, or incomplete experiment. The program must take encrypted digit strings as input and output the corresponding result type.

Uploaded by

Vladimir Lem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ACM Contest Problems Archive

621

University of Valladolid (SPAIN)

Secret Research

At a certain laboratory results of secret research are thoroughly encrypted. A result of a single experiment is stored as an information of its completion:
`positive result', `negative result', `experiment failed' or `experiment not completed'
The encrypted result constitutes a string of digits S, which may take one of the following forms:





positive result
negative result
experiment failed
experiment not completed

S = 1 or S = 4 or S = 78
S = S35
S = 9S4
S = 190S

(A sample result S35 means that if we add digits 35 from the right hand side to a digit sequence
then we shall get the digit sequence corresponding to a failed experiment)
You are to write a program which decrypts given sequences of digits.

Input

A integer n stating the number of encrypted results and then consecutive n lines, each containing a
sequence of digits given as ASCII strings.

Output

For each analysed sequence of digits the following lines should be sent to output (in separate lines):
+
*
?

for a positive result


for a negative result
for a failed experiment
for a not completed experiment

In case the analysed string does not determine the experiment result, a rst match from the above
list should be outputted.

Sample Input
4
78
7835
19078
944

Sample Output
+
?
*

You might also like