UVA 621 (13.08.06)

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 		 S = 1 or S = 4 or S = 78 

negative result 		 S = S35 

experiment failed 		 S = 9S4 

experiment not completed 		 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 thenconsecutive 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 first match from the above list should be outputted.

Sample Input 

4
78
7835
19078
944

Sample Output 

+
-
?
*

大水题, 不解释

提一点, 不用考虑 190S35 这样的奇葩数据~

AC代码:

#include<stdio.h>
#include<string.h>

int main() {
    char str[1000];
    int T, len;
    scanf("%d", &T);
    getchar();
    while(T--) {
        gets(str);
        len = strlen(str);
        if(len <= 2)
            printf("+\n");
        else if(str[len-2] == '3' && str[len-1] == '5')
            printf("-\n");
        else if(str[0] == '9' && str[len-1] == '4')
            printf("*\n");
        else
            printf("?\n");
    }
    return 0;
}