Secret Research
来源:互联网 发布:叙永网络花店 编辑:程序博客网 时间:2024/06/04 23:29
Secret Research
Description
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 consecutiven 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
478783519078944
Sample Output
+-?*
大意:
给出一个数寻找他所对应的格式
要点:
S 只能等于1,4, 78;
S35可以是135, 435, 7835, 1111135,147835之类的;
水题也是有尊严的注意开大数组
#include <stdio.h>#include <string.h>int main(){char s[1000];int num;scanf ("%d", &num);getchar();while (num--){scanf ("%s", s);if (!strcmp(s, "1") || !strcmp(s, "4") || !strcmp(s, "78"))printf ("+\n");else if (s[strlen(s) - 1] == '5' && s[strlen(s) - 2] == '3')printf ("-\n");else if (s[0] == '1' && s[1] == '9' && s[2] == '0')printf ("?\n");elseprintf ("*\n");}return 0;}
- Secret Research
- Secret Research
- Secret Research
- Secret Research
- Secret Research
- Secret Research
- Uva 621 Secret Research
- Uva 621 - Secret Research
- Uva 621 - Secret Research
- uva 621 Secret Research
- uva 621 - Secret Research
- UVa 621 - Secret Research
- 621 - Secret Research
- Uva 621 - Secret Research
- 621 - Secret Research
- UVa 621 - Secret Research
- 621 - Secret Research
- UVA 621 Secret Research
- Isomorphic Strings
- hibernate中的session缓存的常用方法
- java 面向对象基础1
- LeetCode之Sort Colors
- 稀疏表示求解方法
- Secret Research
- C/C++刷题知识点总结
- MariaDB之与MySQL的兼容性比较
- zookeeper无法正常启动问题
- MySQL 存储过程游标嵌套,触发器调用存储过程
- java.lang.UnsatisfiedLinkError问题
- qt学习第四课:子类化窗口
- struts学习笔记(六)标签
- CentOS中MySQL的开机自动启动开启与关闭