Baby_Snow的专栏

题目：要举办一个生日会，为了避免气氛尴尬要让认识的人坐在一起，计算最少几张桌子。      规定朋友的朋友都是朋友，即可以坐在同一张桌子上面。      首先输入几个案例，然后输入总人数和共几对朋友关系，最后输入那两个人认识。      测试用例：            Sample Input 2 5 3 1 2 2 3

最近整理了一些关于排序的算法，其中包括快排，简单插入排序，冒泡排序，选择排序，折半插入排序。简单插入排序思想：    认为开始时数组第一个元素有序，随后依次向后扫描元素K，过程中有序的数组从后往前扫描，    若K比前一个元素小，则让元素向后移，直到K大于的元素处停止，此时K应放在此元素后面。     代码如下：#includevoid insertsort(int *a,int

题目：There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible

题目：It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to make drying faste

题目：Description“今年暑假不AC？”“是的。”“那你干什么呢？”“看世界杯呀，笨蛋！”“@#$%^&*%...”确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级女生，

题目：DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all

此题为排列组合题题目大意：

题目大意：有T组测试数据，每组测试数据

仔细读题，细细品味，发现是一个数塔问题，要用到动态规划