UVA621 - Secret Research

本文解析了一个实验室中用于秘密研究的加密实验结果,包括正结果、负结果、实验失败及未完成四种状态,通过分析字符串模式来解密这些结果。

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

没啥说的,题目没看懂,但是数据很一般,很好AC。

题目:

Secret Research

 

  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 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 

+
-
?
*

 

 


Miguel A. Revilla
2000-01-10

解答:

#include<stdio.h>
#include<string.h>
char str[100000];
int main()
{
	int t;
	scanf("%d",&t);
	getchar();
	int i;
	for(i=0;i<t;i++)
	{
		gets(str);
		if(strcmp(str,"1")==0||strcmp(str,"4")==0||strcmp(str,"78")==0)
			puts("+");
		else if(str[strlen(str)-2]=='3'&&str[strlen(str)-1]=='5')
			puts("-");
		else if(str[0]=='9'&&str[strlen(str)-1]=='4')
			puts("*");
		else if(str[0]=='1'&&str[1]=='9'&&str[2]=='0')
			puts("?");
	}
	return 0;
}

 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值