字符串
文章平均质量分 80
phytn
这个作者很懒,什么都没留下…
展开
-
Keywords Search
Descriptionn the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this feature to his image retrieval system. Every image have a原创 2014-11-23 19:38:27 · 670 阅读 · 0 评论 -
A + B
Description读入两个小于10000的正整数A和B,计算A+B.需要注意的是:A和B的每一位数字由对应的英文单词给出.Input测试输入包含若干测试用例,每个测试用例占一行,格式为"A + B =",相邻两字符串有一个空格间隔.当A和B同时为0时输入结束,相应的结果不要输出.Output对每个测试用例输出1行,即A+原创 2014-11-23 19:03:33 · 475 阅读 · 0 评论 -
单词翻转
Description输入一个句子(一行),将句子中的每一个单词翻转后输出Input输入有多行,每行不超过500个字符。单词之间以空格、逗号、双引号、分号、句号隔开。Output翻转每一个单词后的字符串Sample Inputhello worldab cd efSample Outputolleh原创 2014-11-23 19:49:53 · 1134 阅读 · 0 评论 -
Problem B: Excuses, Excuses!
DescriptionJudge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to reduce the amount of time required listening to go原创 2014-11-20 21:41:03 · 578 阅读 · 0 评论 -
Andy's First Dictionary
DescriptionAndy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of think原创 2014-11-20 21:45:26 · 756 阅读 · 0 评论 -
Immediate Decodability
DescriptionAn encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all code原创 2014-11-23 20:11:32 · 588 阅读 · 0 评论 -
Problem A: Artificial Intelligence?
#include#includeint main(){ int n,t,i,k=1,x; double P,U,I,b; char a[1000]; scanf("%d",&n); getchar(); x=n; while(n--) { P=0; U=0; I=0; gets(a); t=strlen(a); for(i=0;i<t;i++)原创 2014-11-20 21:38:00 · 757 阅读 · 0 评论 -
比大小
描述给你两个很大的数,你能不能判断出他们两个数的大小呢?比如123456789123456789要大于-123456输入每组测试数据占一行,输入两个不超过1000位的10进制整数a,b数据保证输入的a,b没有前缀的0。如果输入0 0表示输入结束。测试数据组数不超过10组输出如果a>b则输出“a>b”,如果a样例输入11111111111111原创 2015-07-07 13:27:43 · 1054 阅读 · 0 评论