Nero_z的博客

Problem A Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other)   Problem Description There are Nvillages, which are numbered from 1 to N, and you should build some roads

动态规划总结 动态规划一直是ACM竞赛中的重点，同时又是难点，因为该算法时间效率高，代码量少，多元性强，主要考察思维能力、建模抽象能力、灵活度。         动态规划（英语：Dynamicprogramming，DP）是一种在数学、计算机科学和经济学中使用的，通过把原问题分解为相对简单的子问题的方式求解复杂问题的方法。动态规划常常适用于有重叠子问题和最优子结构性质的问题，动态规划方法所

Problem X Time Limit : 2000/1000ms (Java/Other)   Memory Limit :131072/65536K (Java/Other) Total Submission(s) : 16   Accepted Submission(s) : 10 Problem Description Recently, iSeawent to an ancie

Problem Q Time Limit : 2000/1000ms (Java/Other)   Memory Limit :32768/32768K (Java/Other) Problem Description Many years ago ,in Teddy’s hometown there was a man who was called “Bone Collector”

Problem P Time Limit : 3000/1000ms (Java/Other)   Memory Limit :32768/32768K (Java/Other)   Problem Description 在一无限大的二维平面中，我们做如下假设：1、每次只能移动一格；2、不能向后走（假设你的目的地是“向上”，那么你可以向左走，可以向右走，也可以向上走，但是不可以向下走）；

Problem D TimeLimit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K(Java/Other)   Problem Description Anumber whose only prime factors are 2,3,5 or 7 is called a humble number. Thesequenc

Problem O Time Limit : 1000/1000ms (Java/Other)   Memory Limit :32768/32768K (Java/Other) Problem Description Give you a numberon base ten,you should output it on base two.(0 < n < 1000)

Problem N Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 33   Accepted Submission(s) : 25 Problem Description 我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，

Problem M Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 44   Accepted Submission(s) : 28 Problem Description 有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始

Problem J Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 36   Accepted Submission(s) : 26 Problem Description 有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，

Problem H Time Limit : 2000/1000ms (Java/Other)   Memory Limit :32768/32768K (Java/Other)   Problem Description     穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机

Problem K Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Problem Description 有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中，蜂房的结构如下所示。    Input 输

Problem L Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Problem Description   在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数. 例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图：  

Problem E Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other)   Problem Description A group ofresearchers are designing an experiment to test the IQ of a monkey. They w

Problem S Time Limit : 10000/5000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Problem Description Nowadays, we allknow that Computer College is the biggest department in HDU. But, mayb

Problem G Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 21   Accepted Submission(s) : 4 Problem Description 都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽

Problem C Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 17   Accepted Submission(s) : 3 Problem Description Nowadays, a kindof chess game ca

Problem B Time Limit : 2000/1000ms (Java/Other)   Memory Limit :65536/32768K (Java/Other) Total Submission(s) : 4   Accepted Submission(s) : 4 Problem Description A subsequence of a givensequenc