uva 621 Secret Research

最新推荐文章于 2019-02-17 17:27:06 发布

原创最新推荐文章于 2019-02-17 17:27:06 发布 · 571 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uva #c++

====ACM===== 同时被 2 个专栏收录

312 篇文章

订阅专栏

数学

15 篇文章

订阅专栏

本文介绍了解析UVA621 Secret Research问题的方法。该问题涉及实验结果的加密形式，需要通过特定的字符串来判断实验的正负结果、失败或未完成状态。文章提供了完整的代码实现。

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

Sample Output

+
-
?
*

题目大意：就是解析所给数字哪种类型的。
解题思路：无解的垃圾题。

#include <stdio.h>
#include <string.h>
int main() {
	char a[500];
	int n;
	scanf("%d", &n);
	while (n--) {
		memset(a, 0, sizeof(a));
		scanf("%s", a);
		if (!strcmp(a, "1") || !strcmp(a, "4") || !strcmp(a, "78")) {
			printf("+\n");
		}	
		else if (a[strlen(a)-1]=='5' && a[strlen(a)-2]=='3'){
			printf("-\n");
		}
		else if (a[0]=='1' && a[1]=='9' && a[2]=='0'){
			printf("?\n");
		}
		else printf("*\n");
	}
	return 0;
}