dream

摘要： Problem DescriptionRecently, Peter likes to measure the humidity of leaves. He recorded a leaf humidity every day. There are four types of leaves wetn... 阅读全文

摘要： Problem DescriptionToday the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi... 阅读全文

摘要： Problem DescriptionGiven two matrices A and B of size n×n, find the product of them.bobo hates big integers. So you are only asked to find the result ... 阅读全文

摘要： Problem DescriptionThere is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy things. Although th... 阅读全文

摘要： Problem DescriptionTIANKENG managers a pan fried rice shop. There are n kinds of fried rice numbered 1-n. TIANKENG will spend t time for once frying. ... 阅读全文

摘要： 2014-07-3015:58:27DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢丝很长，可以看作是无限长。节目主持人会给该跳蚤发一张卡片。卡片上写有N+1个自然数。其中最后一个是M，而前N个数都不超过M，卡片上允许有相同的... 阅读全文

摘要： InputOutputSample Input35 3 4 15 3 110 2 2 7 3 3100 1 1 100 1 2Sample Output4350超时代码，因为K很大 1 /***************** 2 f1+(k1-1)*d1=f2+(k2-1)*d2 3 => (k1-... 阅读全文

摘要： 题目大意：众所周知冒泡排序算法多数情况下不能只扫描一遍就结束排序，而是要扫描好几遍。现在你的任务是求1~N的排列中，需要扫描K遍才能排好序的数列的个数模20100713。注意，不同于真正的冒泡排序算法，只要数列有序就立刻停止，而不用再检验一遍。估计多数人都是找规律吧，先看出递推，然后求出通项……这个... 阅读全文

摘要： FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2882Accepted:1466DescriptionConsider a single-elimination football tournament involving ... 阅读全文

摘要： DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of th... 阅读全文