UVa 621 Secret (Water ver.)

Source: Internet
Author: User
Tags strcmp time limit

621-secret

Time limit:3.000 seconds

Http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=99&page=show_problem &problem=562

At a certain laboratory results of secret of the are. A result of the a single experiment are stored as a 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:

Experiment not completed S = 190S

(A sample result S35 means this if we add digits the right hand side to a digit sequence we then get the shall It sequence corresponding to a failed experiment)

You are 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 En as ASCII strings.

Output

For each analysed sequence of digits the following lines should is sent to output (in separate lines):

+ for a positive result-for a negative result * for a failed experiment? For a is not completed experiment

In case the analysed string does not determine the experiment result, a A-match from the above list should to be Outputte D.

Sample Input

4
7835
19078
944

Sample Output

+
-
?
*

Simple match on the line.

Complete code:

/*0.013s*/
  
#include <cstdio>
#include <cstring>
  
char str[10010];
  
int main (void)
{
    int n, Len;
    scanf ("%d", &n);
    while (n--)
    {
        scanf ("%s", str);
        len = strlen (str);
        if (!strcmp (str, "1") | |!strcmp (str, "4") | |!strcmp (str, ""))
            puts ("+");
        else if (str[len-2] = = ' 3 ' && str[len-1] = = ' 5 ')
            puts ("-");
        else if (str[0] = = ' 9 ' && str[len-1] = = ' 4 ')
            puts ("*");
        else//str[0] = = ' 1 ' && str[1] = = ' 9 ' && str[2] = = ' 0 '
            puts ("?");
    }
    return 0;
}

See more highlights of this column: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.