UVA 621 Secret Research

本文介绍了一种解密特定实验室实验结果的方法。该程序能够解析加密的数字序列,并将其转换为实验结果,如正向结果、负向结果、实验失败或实验未完成等。通过对输入的数字序列进行匹配,程序能够输出相应的实验状态。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

  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:


$\bullet$
positive result 		 S = 1 or S = 4 or S = 78 
$\bullet$
negative result 		 S = S35 
$\bullet$
experiment failed 		 S = 9S4 
$\bullet$
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 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 first match from the above list should be outputted.

Sample Input 

4
78
7835
19078
944

Sample Output 

+
-
?
*
题目严重有歧义!!!
对S=S35类似的只考虑最后两位是否相等,而不考虑35之前的S是什么。
并记住按顺序进行判断。
代码如下:
#include <stdio.h>
#include <string.h>
int main(void)
{
    int n,len;
    char str[1000];
    
    scanf("%d",&n);
    while(n--)
    {
     scanf("%s",str);
     len=strlen(str);
     if(!strcmp(str,"1")||!strcmp(str,"4")||!strcmp(str,"78"))
      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 if(str[0]=='1'&&str[1]=='9'&&str[2]=='0')
      printf("?\n");
    }
    return 0;
} 


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值