懂取舍 亦洒脱

超级楼梯 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 61   Accepted Submission(s) : 23 Font: Times New Roman | Verdana | Georgia Font Size:

吃糖果 Time Limit : 6000/3000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other) Total Submission(s) : 86   Accepted Submission(s) : 25 Font: Times New Roman | Verdana | Georgia Font Size:

FatMouse' Trade Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 69   Accepted Submission(s) : 18 Font: Times New Roman | Verdana | Georgia

Delta-wave Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 19   Accepted Submission(s) : 9 Font: Times New Roman | Verdana | Georgia Font

#include #include using namespace std; string add(string s1,string s2) { int j,l,la,lb; string max,min; max=s1; min=s2; if(s1.length()<s2.length()) { max=s

不容易系列之(3)—— LELE的RPG难题 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 60   Accepted Submission(s) : 25 Font: Times New Roman | Verdana | Geo

The Last Practice Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 36   Accepted Submission(s) : 8 Font: Times New Roman | Verdana | Georgia

思路： 先找到N个新郎中M个错一共有几种，显然是CMN=N!/(M!*(N-M)!)。即CMN=N!/M!/(N-M)!。 然后在求出M个数的错排个数，递推关系：f[n]=(n-1)*(f[n-1]+f[n-2]) 错排： •第一种情况：如果开始有n-1个人都已经完成了错排（有f(n-1)种可能），第n个人可以通过用自己的新娘去和那n-1个人中的任意一个交换，来实现n个人都错排。这种情

母牛的故事 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 48   Accepted Submission(s) : 29 Font: Times New Roman | Verdana | Georgia Font Size

sort Time Limit : 6000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 131   Accepted Submission(s) : 27 Font: Times New Roman | Verdana | Georgia Font Size