DTL66的博客

F - Hat’s WordsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in

Contest - 多校训练2（小火山专场）Problem A: 小火山的跳子游戏Time Limit: 1 Sec Memory Limit: 128 MB Submit: 384 Solved: 65SubmitStatusWeb Board Description小火山和火山火山在一块玩跳子游戏。规则如下： 1：跳子的起始位置为0，棋盘大小从1到N 2：每次跳子跳k步。 例

1908: 小火山的围棋梦想Time Limit: 1 Sec Memory Limit: 128 MB Submit: 210 Solved: 51SubmitStatusWeb Board Description小火山最近喜欢上了围棋。 对于围棋，其实小火山是一窍不通的。现在棋盘上，有很多小火山的棋子。 如果棋盘上有这样的一个位置， 那么这个位置也会变成小火山 的棋子；这样的位置

A - SubsequenceTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 3061 Description A sequence of N positive integers (10 < N < 100 000), each of them

Contest - 多校训练2（小火山专场）Problem J: 小火山的计算能力Time Limit: 1 Sec Memory Limit: 128 MB Submit: 443 Solved: 106SubmitStatusWeb Board Description别人说小火山的计算能力不行，小火山很生气，于是他想证明自己，现在有一个表达式，他想计算出来。Input首先是一个t（1<=

Strange Way to Express IntegersTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu DescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to expr

B - Jessica’s Reading ProblemTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 3320 Description Jessica’s a very lovely girl wooed by lots of boys. R

1912: 小火山的爱情密码Time Limit: 1 Sec Memory Limit: 128 MB Submit: 246 Solved: 64SubmitStatusWeb Board Description小火山获得了一个字符串，然而大火山让小火山从里面截取一段字符串，并且让小火山截取的字符串满足一些字符达到一定数量。 小火山觉得很容易，但是他想要知道他至少得截取多长的字符串。

1045 - Digits of Factorial Time Limit: 2 second(s) Memory Limit: 32 MBDescriptionFactorial of an integer is defined by the following functionf(0) = 1f(n) = f(n - 1) * n, if(n > 0)So, fac

Bear and Three Ballr  Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u scription:Limak is a little polar bear. He has n balls, the i-th ball has size ti.Limak wants to g

Ohana Cleans UpTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u  DescriptionOhana Matsumae is trying to clean a room, which is divided up into an n by n grid of squares.

Co-prime ArrayTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u DescriptionYou are given an array of n elements, you must make it a co-prime array in as few moves as possib

畅通工程续Time Limit: 3000/1000 MS ( Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46054 Accepted Submission(s): 17145Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很

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

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

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

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 51478 Accepted Submission(s): 21677Problem Description Many years ago , in Te

B - 饭卡Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 2546 Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡

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

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

A - Common SubsequenceTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu SubmitStatus Description A subsequence of a given sequence is the given sequence with some elements (

A. Divisibilitytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFind the number of k-divisible numbers on th

问题描述：给定图，求两点间的最短距离。 主要有三种算法： 1.floyd算法：枚举任意点作为中间点动态更新剩余点间的距离。优点：可以求出所给图中任意两点间的最小距离；缺点：时间复杂度高，点如果有达到三位数或者更多则不适用。适用于点较少的图。 主要步骤：1.确定所给图是有向图还是无向图； 2.初始化所有点的距离无穷，将所给的图存到邻接矩阵之中； 3.从第一个点开始枚举，对剩余的所有的以枚举点

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

1109 - False Ordering   PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBWe define b is a Divisor of a number a if a is divisible b

1307 - Counting Triangles   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are given N sticks having distinct lengths; you ha

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

J - Task scheduleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。 有m个询问，每个询问有一个数字q，表示如果

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

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

1189 - Sum of Factorials   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBGiven an integer n, you have to find whether it can b

1331 - Agent J   PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBAgent J is preparing to steal an antique diamond piece from a mus

1225 - Palindromic Numbers (II)   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBA palindromic number or numeral palindrome is

1136 - Division by 3   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBThere is sequence 1, 12, 123, 1234, ..., 12345678910, ... .

过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19030 Accepted Submission(s): 8304Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐

最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34773 Accepted Submission(s): 13735Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种

BellovinTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1061 Accepted Submission(s): 476Problem Description Peter has a sequence a1,a2,…,

D - Wooden SticksTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description There is a pile of n wooden sticks. The length and weight of each stick ar

PalindromeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5241 Accepted Submission(s): 1796Problem Description A palindrome is a symmetrica

1182 - Parity   PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBGiven an integer n, first we represent it in binary. Then we cou