摘要： 1244. GentlemenTime limit: 0.5 secondMemory limit: 64 MBLet's remember one old joke:Once a gentleman said to another gentleman:— What if we play cards... 阅读全文

摘要： Language:Largest Submatrix of All 1’sTime Limit:5000MSMemory Limit:131072KTotal Submissions:5185Accepted:1950Case Time Limit:2000MSDescriptionGiven am... 阅读全文

摘要： DescriptionSome of Farmer John'sNcows (1 ≤N≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants t... 阅读全文

摘要： N (3 2 #include 3 #include 4 5 using namespace std; 6 7 const int maxn=20000+10; 8 9 int ls[maxn]; //第i个人左边技能值小于a[i]的人数10 int rs[maxn]; ... 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37595Accepted Submission(s): 14143Problem Descript... 阅读全文

摘要： Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:5731Accepted:1617DescriptionYYF is a couragous scout. Now he is on a dangerous missio... 阅读全文

摘要： DescriptionSometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party whe... 阅读全文

摘要： Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionYou are in a cave, a long cave! The cave can be represented by a1 x Ngrid. ... 阅读全文

摘要： Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the... 阅读全文

摘要： DescriptionHere is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can... 阅读全文