摘要: 链接地址:Openjudge:http://bailian.openjudge.cn/practice/1102Poj:http://poj.org/problem?id=1102题目:总时间限制:1000ms内存限制:65536kB描述A friend of you has just bought a new computer. Until now, the most powerful computer he ever used has been a pocket calculator. Now, looking at his new computer, he is a bit disapp 阅读全文
posted @ 2014-01-08 16:15 mobileliker 阅读(454) 评论(0) 推荐(0)
摘要: 链接地址:http://bailian.openjudge.cn/practice/2680题目:总时间限制:1000ms内存限制:65536kB描述下表是进行血常规检验的正常值参考范围,及化验值异常的临床意义:给定一张化验单,判断其所有指标是否正常,如果不正常,统计有几项不正常。化验单上的值必须严格落在正常参考值范围内,才算是正常。正常参考值范围包括边界,即落在边界上也算正常。输入输出对于每组测试数据,输出一行。如果所有检验项目正常,则输出:normal;否则输出不正常的项的数目。样例输入2female 4.5 4.0 115 37 200male 3.9 3.5 155 36 301样例输 阅读全文
posted @ 2014-01-08 14:59 mobileliker 阅读(938) 评论(0) 推荐(0)
摘要: 链接地址:http://bailian.openjudge.cn/practice/1928题目:总时间限制:1000ms内存限制:65536kB描述Mr. Robinson and his pet monkey Dodo love peanuts very much. One day while they were having a walk on a country road, Dodo found a sign by the road, pasted with a small piece of paper, saying "Free Peanuts Here! " Y 阅读全文
posted @ 2014-01-08 14:56 mobileliker 阅读(333) 评论(0) 推荐(0)
摘要: 链接地址:http://bailian.openjudge.cn/practice/2746题目:总时间限制:1000ms内存限制:65536kB描述约瑟夫问题:有n只猴子,按顺时针方向围成一圈选大王(编号从1到n),从第1号开始报数,一直数到m,数到m的猴子退出圈外,剩下的猴子再接着从1开始报数。就这样,直到圈内只剩下一只猴子时,这个猴子就是猴王,编程求输入n,m后,输出最后猴王的编号。输入每行是用空格分开的两个整数,第一个是 n, 第二个是 m ( 0 2 #include 3 using namespace std; 4 5 int main() 6 { 7 int n,... 阅读全文
posted @ 2014-01-08 14:49 mobileliker 阅读(486) 评论(0) 推荐(0)