acm
文章平均质量分 82
Kimi_R_17
这个作者很懒,什么都没留下…
展开
-
POJ 2139 Six Degrees of Cowvin Bacon
Six Degrees of Cowvin BaconTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2986 Accepted: 1390DescriptionThe cows have been making movies lately, so they原创 2014-08-02 15:57:43 · 1397 阅读 · 0 评论 -
POJ 3268 Silver Cow Party
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12633 Accepted: 5631DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) convenien原创 2014-08-02 16:15:25 · 708 阅读 · 0 评论 -
POJ 2377 Bad Cowtractors
Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10634 Accepted: 4504DescriptionBessie has been hired to build a cheap internet network amon原创 2014-08-02 16:23:03 · 705 阅读 · 0 评论 -
uva 562 Dividing coins
uva 562 Dividing coins原创 2014-07-27 15:58:52 · 580 阅读 · 0 评论 -
POJ 2395 Out of Hay
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11030 Accepted: 4320DescriptionThe cows have run out of hay, a horrible event that must be r原创 2014-08-02 16:27:55 · 710 阅读 · 0 评论 -
poj 3259 Wormholes
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 30766 Accepted: 11157DescriptionWhile exploring his many farms, Farmer John has discovered a nu原创 2014-08-02 16:06:48 · 646 阅读 · 0 评论 -
Codeforces 424 C Magic Formulas
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 424C DescriptionPeople in the Tomskaya region like magic formulas ve原创 2014-07-27 16:03:19 · 726 阅读 · 0 评论 -
ZOJ 2319 Beautiful People
Beautiful PeopleTime Limit: 5 Seconds Memory Limit: 32768 KB Special Judge The most prestigious sports club in one city has exactly N members. Each of its members is strong and bea原创 2014-07-27 15:51:29 · 743 阅读 · 0 评论 -
Codeforces 371C Hamburgers
DescriptionPolycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers原创 2014-07-27 16:11:43 · 1252 阅读 · 0 评论 -
POJ 3484 Showstopper 二分
ShowstopperTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1218 Accepted: 356DescriptionData-mining huge data sets can be a painful and long last原创 2014-07-08 10:27:19 · 1085 阅读 · 0 评论 -
HYSBZ 1406 密码箱
1406: [AHOI2007]密码箱Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 670 Solved: 376[Submit][Status]Description在一次偶然的情况下,小可可得到了一个密码箱,听说里面藏着一份古代流传下来的藏宝图,只要能破解密码就能打开箱子,而箱子背面刻着的古代图标,就是对密码的提示。经过艰原创 2014-07-24 16:36:14 · 851 阅读 · 0 评论 -
UVA 10288 Coupons
CouponsCrawling in process...Crawling failedTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Practice UVA 10288 DescriptionProblem FC原创 2014-07-24 16:56:06 · 559 阅读 · 0 评论 -
HDU 2126 Buy the souvenirs
Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 927 Accepted Submission(s): 319Problem DescriptionWhen the wi原创 2014-07-28 20:35:05 · 528 阅读 · 0 评论 -
uva 12356 - Army Buddies
Description Problem JJin Ge Jin Qu [h]ao(If you smiled when you see the title, this problem is for you ^_^)For those who don't know KTV, see: http://en.wikipedia.org/w原创 2014-07-28 20:09:01 · 1334 阅读 · 0 评论 -
POJ 1258 Agri-Net
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39730 Accepted: 16145DescriptionFarmer John has been elected mayor of his town! One of his campaig原创 2014-08-01 11:01:33 · 577 阅读 · 0 评论 -
0801题解
#include #include #include #include #include #include using namespace std;int a[100005];int dp[100005];int main(){ int n; while(~scanf("%d",&n)){ if(n==0) break; int sum原创 2014-07-31 20:24:05 · 486 阅读 · 0 评论 -
POJ1159
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 51790 Accepted: 17831DescriptionA palindrome is a symmetrical string, that is, a string read原创 2014-07-14 10:12:58 · 617 阅读 · 0 评论 -
POJ 1664 放苹果
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25785 Accepted: 16403Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。原创 2014-07-15 10:19:18 · 621 阅读 · 0 评论 -
HDU 3001 Travelling
DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind w原创 2014-07-30 15:51:32 · 769 阅读 · 0 评论 -
ZOJ 4257 Most Powerful
DescriptionRecently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and原创 2014-07-30 10:22:36 · 811 阅读 · 0 评论 -
POJ 3254 Corn Fields
Corn FieldsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionFarmer John has purchased a原创 2014-07-29 22:25:53 · 744 阅读 · 0 评论 -
POJ 1185 炮兵阵地
Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示:如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色原创 2014-07-30 10:47:55 · 694 阅读 · 1 评论 -
HDU 2639 Bone Collector II
one Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2179 Accepted Submission(s): 1142Problem DescriptionThe title of原创 2014-07-28 21:49:48 · 489 阅读 · 0 评论 -
codeforces 126B Password
DescriptionAsterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.A li原创 2014-07-28 22:46:29 · 1235 阅读 · 0 评论 -
POJ 1251 Jungle Roads
Jungle RoadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19064 Accepted: 8702DescriptionThe Head Elder of the tropical island of Lagrishan has a原创 2014-07-28 20:24:21 · 504 阅读 · 0 评论 -
URAL 1528 Sequence
SequenceCrawling in process...Crawling failedTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice URAL 1528 DescriptionYou are原创 2014-07-24 16:52:31 · 616 阅读 · 0 评论 -
HYSBZ 1800 fly 飞行棋
fly 飞行棋Crawling in process...Crawling failedTime Limit:10000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatus Practice HYSBZ 1800 Description给出圆周上的若干个点原创 2014-07-24 20:43:24 · 786 阅读 · 0 评论 -
POJ 2782 Bin Packing
Bin PackingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5416 Accepted: 2452DescriptionA set of n 1-dimensional items have to be packed in identical原创 2014-07-17 16:16:16 · 1337 阅读 · 0 评论 -
Balancer - CodeForces 440B
DescriptionPetya has k matches, placed in n matchboxes lying in a line from left to right. We know that k is divisible by n. Petya wants all boxes to have the same number of matches in原创 2014-07-17 15:56:53 · 727 阅读 · 0 评论 -
POJ 3566
Building for UNTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1367 Accepted: 599 Special JudgeDescriptionThe United Nations has decided to buil原创 2014-07-17 15:56:03 · 857 阅读 · 0 评论 -
poj 1200-Crazy Search
题目大意:原创 2014-05-22 18:33:10 · 655 阅读 · 0 评论 -
POJ 3045-Cow Acrobats
DescriptionFarmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trape原创 2014-05-22 18:25:55 · 1362 阅读 · 0 评论 -
Anton and Letters
Anton and Letterstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Anton has found a set. The set consists of原创 2014-07-17 16:41:06 · 906 阅读 · 0 评论 -
POJ 2739 Sum of Consecutive Prime Numbers
Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18782 Accepted: 10308DescriptionSome positive integers can be represen原创 2014-07-17 16:26:00 · 530 阅读 · 0 评论 -
POJ 1552-Doubles
DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each li原创 2014-05-22 18:21:12 · 843 阅读 · 0 评论 -
POJ 1029-False coin
题目大意:找出假币,如果有多个或者没有原创 2014-05-22 18:45:05 · 536 阅读 · 0 评论 -
UVA 11827-Maximum GCD
Problem JMaximum GCDInput: Standard InputOutput:Standard Output Given the N integers, you have to find the maximum GCD(greatest common divisor) of every possi原创 2014-05-22 18:15:35 · 1161 阅读 · 0 评论 -
UVa 11475-Extend to Palindrome JAVA
Your task is, given an integer N, to make a palidrome (word that reads the same when you reverse it) of length at leastN. Any palindrome will do. Easy, isn't it? That's what you though原创 2014-05-22 12:41:56 · 956 阅读 · 0 评论 -
Kolya and Tandem Repeat
Kolya and Tandem Repeattime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya got string s for his birthday, the st原创 2014-07-17 16:44:31 · 1093 阅读 · 0 评论 -
poj 3258-River Hopscotch
DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, strai原创 2014-05-24 14:33:04 · 568 阅读 · 0 评论