UVA - 621 Secret Research

本文介绍了一种用于解析特定实验室中秘密研究结果的程序。通过分析一系列由数字组成的字符串,该程序能够确定实验是否成功、失败、未完成或为负结果。通过对输入序列的判断,输出相应的结果标记,如'+', '-', '?' 或 '*'。

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


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 

+
-
?
*
题意
按照题目中的要求顺序判断四种情况,按照符合条件各自输出;


#include<stdio.h>
#include<string.h>
#include<iostream>
#define llu long long unsigned;
using namespace std;

int main()
{
	int n;
	string k;;
	cin >> n;
	getchar();
		for(int i = 0;i < n; i ++)
		{
			cin >> k;
			int m = k.length();
			if( m == 1)
			{
				if(k[0] == '1' || k[1] == '4')
					cout <<"+"<<endl;
			
			}

			else if(m ==2)
			{
				if(k[0] == '7' && k[1] == '8')
					cout <<"+"<<endl;
			
			
			}
			else
			{
				if(k[m - 2] == '3'&& k[m- 1] == '5')
					cout <<"-"<<endl;
				else if(k[0] =='9'&& k[m - 1]== '4')
					cout <<"*"<<endl;
				else
					cout <<"?"<<endl;
			
			}
		}
return 0;
}



 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值