DTL66的博客

A - 数塔Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的： 有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少

1064 - Throwing Dice   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBn common cubic dice are thrown. What is the probability tha

1122 - Digit Count   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven a set of digits S, and an integer n, you have to find h

D. Soldier and Number Game time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Two soldiers are playing a game. At the beginning first of them

1047 - Neighbor House   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBThe people of Mohammadpur have decided to paint each of

1006 - Hex-a-bonacci   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBGiven a code (not optimized), and necessary inputs, you h

Alice, Bob, Two TeamsTime Limit:1500MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u DescriptionAlice and Bob are playing a game. The game involves splitting up game pieces into two team

J - DivisibilityTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu SubmitStatus Description Consider an arbitrary sequence of integers. One can place + or - operators between

985的方格难题Time Limit: 1 Sec Memory Limit: 128 MB Submit: 395 Solved: 87SubmitStatusWeb Board Description985走入了一个n * n的方格地图，他已经知道其中有一个格子是坏的。现在他要从(1, 1)走到(n, n)，每次只可以向下或者向右走一步，问他能否到达（n，n）。若不能到达输出-1，反之输

免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41761 Accepted Submission(s): 14335Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的

玲珑杯”ACM比赛 Round #4Start Time：2016-11-05 12:00:00 End Time：2016-11-05 17:00:00 Refresh Time：2016-11-06 21:43:46 PrivateE -- arrayTime Limit：3s Memory Limit：64MByteSubmissions：46