2015年07月_心向阳光2014

原创 1062-昂贵的聘礼

昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40422 Accepted: 11740 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给

2015-07-29 22:46:21 302

原创 Children of the Candy Corn

Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11011 Accepted: 4743 Description The cornfield maze is a popular Halloween treat. Visitors are shown the entrance an

2015-07-29 20:23:44 348

原创 Catch That Cow

Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 60573 Accepted: 18904 Description Farmer John has been informed of the location of a fugitiv

2015-07-29 20:19:50 260

原创 Robot Motion

Robot Motion Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11408 Accepted: 5533 Description A robot has been programmed to follow the instructions in

2015-07-29 20:18:45 725

原创 Crashing Robots

Crashing Robots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8452 Accepted: 3660 Description In a modernized warehouse, robots are used to fetch the goo

2015-07-29 20:14:43 357

原创 Silver Cow Party

Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14838 Accepted: 6711 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently

2015-07-25 16:46:10 313

原创 Parencodings

Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22856 Accepted: 13399 Description Let S = s1 s2...s2n be a well-formed string of parentheses.

2015-07-23 21:11:47 1127

原创最小生成树

E Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述给出一个带权无向图，求出其最小生成树。保证图连通。输入对于每组数据：第一行输入n,m。表示此图有n(n 接下来m行，每行u,v,w。表示u，v之间有一条权值为w的边。输出对于每组数据，输出一

2015-07-23 21:05:02 443

原创 Y2K Accounting Bug

Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11417 Accepted: 5748 Description Accounting for Computer Machinists (ACM) has sufferred

2015-07-23 14:10:30 1230

原创 Radar Installation

Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 63159 Accepted: 14205 Description Assume the coasting is an infinite straight line. Land

2015-07-23 10:08:29 667

原创 OO’s Sequence

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1572 Accepted Submission(s): 567 地址：http://acm.hdu.edu.cn/showproblem.php?pid=5288； P

2015-07-22 19:55:38 318

原创 Flip Game

Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 34153 Accepted: 14909 Description Flip game is played on a rectangular 4x4 field with two-sided p

2015-07-22 16:23:55 323

原创 Maya Calendar

Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 70536 Accepted: 21680 Description During his last sabbatical, professor M. A. Ya made a surpr

2015-07-22 11:26:52 403

原创 Bridge

Bridge Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3602 Accepted: 1262 Special Judge Description n people wish to cross a bridge at night. A group

2015-07-21 16:22:45 655

原创 Trie树trie（前缀）

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述小Hi和小Ho是一对好朋友，出生在信息化社会的他们对编程产生了莫大的兴趣，他们约定好互相帮助，在编程的学习道路上一同前进。这一天，他们遇到了一本词典，于是小Hi就向小Ho提出了那个经典的问题：“小Ho，你能不能对于每一个我给出的字符串，都在这个词典里面找到以这个字符串开头的所有单词

2015-07-20 21:10:16 425

原创迷之好奇

Time Limit: 2000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述 FF得到了一个有n个数字的集合。不要问我为什么，有钱，任性。 FF很好奇的想知道，对于数字x，集合中有多少个数字可以在x前面添加任意数字得到。如，x = 123，则在x前面添加数字可以得到4123，5123等。输入多组输入。

2015-07-20 20:27:43 690

原创水题

水题 Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述给定一个正整数 n，求一个最小的正整数 x，使得可以找到一个正整数y，且满足 y*y = n + x*x。输入输入包含多组测试数据。每组数据只有一行为 1 个整数 n(0 输出对于每组测

2015-07-19 20:55:56 618

原创走楼梯

走楼梯 Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述小虎发现走楼梯的时候一次上一个台阶比较惬意，一次上两个台阶比较高效，一次上三个台阶就很累人。小虎是一个即注重质量又注重高效的人，于是他就在上楼梯的时候每步就只跨上一个台阶或两个台阶，现在小虎想知道他这样上n阶的楼梯一共有多少

2015-07-19 14:09:43 433

原创 Number Sequence

Number Sequence Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述 A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mo

2015-07-19 13:11:31 514

原创 A * B

A * B Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述 Your task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to

2015-07-15 14:37:48 399

原创 K能

K能 Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述这是个什么问题呢？DP，贪心，数据结构，图论，数论还是计算几何？管他呢，反正胖巨巨都会,虽然胖巨巨走得早。胖巨巨有一个长为n的棍子，他打算将这根棍子截成三段长度分别为a1,a2,a3的棍子，然后用这三根棍子围城一个三角形。由于胖巨

2015-07-14 21:29:17 395

梦载代码