2013年8月1日

HDU 4633 Who's Aunt Zhang (2013多校4 1002 polya计数)

摘要: Who's Aunt ZhangTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19Accepted Submission(s): 16Problem DescriptionAunt Zhang, well known as 张阿姨, is a fan of Rubik’s cube. One day she buys a new one and would like to color it as a gift to send to T 阅读全文

posted @ 2013-08-01 20:29 kuangbin 阅读(752) 评论(1) 推荐(0) 编辑

HDU 4632 Palindrome subsequence (2013多校4 1001 DP)

摘要: Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 88Accepted Submission(s): 26Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing t 阅读全文

posted @ 2013-08-01 17:59 kuangbin 阅读(884) 评论(0) 推荐(0) 编辑

HDU 4635 Strongly connected (2013多校4 1004 有向图的强连通分量)

摘要: Strongly connectedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 53Accepted Submission(s): 15Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is sti 阅读全文

posted @ 2013-08-01 17:56 kuangbin 阅读(967) 评论(0) 推荐(0) 编辑

HDU 4638 Group (2013多校4 1007 离线处理+树状数组)

摘要: GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17Accepted Submission(s): 5Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stan 阅读全文

posted @ 2013-08-01 17:54 kuangbin 阅读(1222) 评论(0) 推荐(0) 编辑

HDU 4639 Hehe (2013多校4 1008 水题)

摘要: HeheTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33Accepted Submission(s): 22Problem DescriptionAs we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low profile that no one know 阅读全文

posted @ 2013-08-01 17:52 kuangbin 阅读(474) 评论(0) 推荐(0) 编辑

HDU 4642 Fliping game (2013多校4 1011 简单博弈)

摘要: Fliping gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 35Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board wit 阅读全文

posted @ 2013-08-01 17:50 kuangbin 阅读(882) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: