- 博客(26)
- 收藏
- 关注
原创 poj2486 Apple Tree
Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8672 Accepted: 2884 Description Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple
2015-10-30 20:32:30 534
原创 hdu4003 Find Metal Mineral
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 2996 Accepted Submission(s): 1377 Problem Description Humans have discovered a ki
2015-10-30 19:29:35 524
原创 UESTC 1218 Pick The Sticks
Time Limit: 15000/10000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status The story happened long long ago. One day, Cao Cao made a special order called "Chicken Ri
2015-10-30 11:16:39 937
原创 uestc 1221 Ancient Go
Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are
2015-10-29 17:52:37 684
原创 uestc 1222 Sudoku
Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It
2015-10-28 18:29:35 990
原创 Codeforces Round #327 (Div. 1) C. Three States
C. Three States time limit per test 5 seconds memory limit per test 512 megabytes input standard input output standard output The famous global economic crisis is approa
2015-10-27 20:32:35 904
原创 hdu1561 The more, The Better
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6527 Accepted Submission(s): 3836 Problem Description ACboy很喜欢玩一种战略游戏,在一个地图上,有N座城
2015-10-24 18:26:49 491
原创 poj1947 Rebuilding Roads
Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10297 Accepted: 4701 Description The cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, nu
2015-10-24 10:18:28 407
原创 hdu1011 Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14426 Accepted Submission(s): 3887 Problem Description You, the leader of Starsh
2015-10-22 21:12:16 467
原创 poj1155 TELE
Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4314 Accepted: 2337 Description A TV-network plans to broadcast an important football match. Their network of transm
2015-10-22 18:39:58 881
原创 Codeforces Round #135 (Div. 2) D. Choosing Capital for Treeland
time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output The country Treeland consists of n cities, some pairs of them ar
2015-10-22 10:10:21 764
原创 hdu2196 Compute
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4646 Accepted Submission(s): 2345 Problem Description A school bought the first c
2015-10-21 21:38:56 496
原创 hdu1520 Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7191 Accepted Submission(s): 3174 Problem Description There is going to be a part
2015-10-21 14:52:15 393
原创 poj3728 The merchant
Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 3761 Accepted: 1268 Description There are N cities in a country, and there is one and only one simple path between e
2015-10-20 20:28:18 394
原创 fzu2204 7
Problem Description n个有标号的球围成一个圈。每个球有两种颜色可以选择黑或白染色。问有多少种方案使得没有出现连续白球7个或连续黑球7个。 Input 第一行有多组数据。第一行T表示组数。(T 每组包含n,表示球的个数。(1 Output 每组先输出 "Case #x: " (其中x为当前组数) 该行接下来输出方案数。方案数mod 20
2015-10-14 13:28:20 476
原创 fzu2200 cleaning
Problem Description N个人围成一圈在讨论大扫除的事情,需要选出K个人。但是每个人与他距离为2的人存在矛盾,所以这K个人中任意两个人的距离不能为2,他们想知道共有多少种方法。 Input 第一行包含一个数T(T 接下来每行有两个数N,K,N表示人数,K表示需要的人数(1 Output 输出满足题意的方案数,方案数很大,所以请输出方案数mod 1
2015-10-13 22:00:15 458
原创 zoj3905 Cake
Time Limit: 4 Seconds Memory Limit: 65536 KB Alice and Bob like eating cake very much. One day, Alice and Bob went to a bakery and bought many cakes. Now we know that they have bought n cakes
2015-10-12 16:36:44 845
原创 codeforces 128B. String
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day in the IT lesson Anna and Maria learned about the lexico
2015-10-11 19:11:35 937
原创 hdu5501 The Highest Mark
Problem Description The SDOI in 2045 is far from what it was been 30 years ago. Each competition has t minutes and n problems. The ith problem with the original mark of Ai(Ai≤106),and
2015-10-11 10:01:14 723
原创 bnuoj24252 Divide
Alice and Bob has found a island of treasure in byteland! They find N kinds of treasures on the island, and each kind of treasure has a certain number, and as in byteland, the value of each treasure w
2015-10-09 21:51:03 429
原创 poj2763 Housewife Wind
Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 7918 Accepted: 2078 Description After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their or
2015-10-09 11:51:16 584
原创 fzu2202 犯罪嫌疑人
Problem Description 福尔摩斯是个大侦探,他总是在解决疑难案件。这一次的案件也不例外,案件是这样的:有编号为1到N的N位嫌疑犯,他们其中有一个犯了罪,然后每个嫌疑犯都被询问,“哪一个人犯了罪?”犯罪嫌疑人的答案只能“编号ai的嫌疑犯犯了罪”或者“编号ai的嫌疑犯没有犯罪”。当然嫌疑犯也可以说他自己(ai = i). 福尔摩斯凭着他敏锐的侦探直觉,确定地对华生说,只有M个人
2015-10-08 13:09:07 594
原创 hdu5497 Inversion
Problem Description You have a sequence {a1,a2,...,an} and you can delete a contiguous subsequence of length m. So what is the minimum number of inversions after the deletion. Input
2015-10-05 21:22:31 446
原创 hdu5496 Beauty of Sequence
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 383 Accepted Submission(s): 167 Problem Description Sequence is beautiful and the
2015-10-05 10:25:06 602
原创 UVALive 7146
Long long ago there is a strong tribe living on the earth. They always have wars and eonquer others.One day, there is another tribe become their target. The strong tribe has decide to terminate them!!
2015-10-04 19:39:23 481
原创 hdu5489 Removed Interval
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 757 Accepted Submission(s): 282 Problem Description Given a sequence of numbers A
2015-10-01 20:42:35 786
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人