逆风的方向 更适合飞翔

Mountain SubsequencesTime Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述Coco is a beautiful ACMer girl living in a very beautiful mountain. There are many trees and flowers on the

http://hihocoder.com/contest/challenge7/problem/1描述给定一个字符串，判断其是否为合法的正则表达式。 一个正则表达式定义为： 1：0是正则表达式，1也是正则表达式。 2：P和Q都是正则表达式，则PQ是正则表达式。 3：P是正则表达式，则(P)是正则表达式 4：P是正则表达式，则P*也是正则表达式 5：P和Q都是

ZOJ 3725 Painting Storages DP计数Painting StoragesTime Limit: 2 Seconds      Memory Limit: 65536 KBThere is a straight highway with N storages alongside it labeled by 1,2,3,...,N

描述一日，崔克茜来到小马镇表演魔法。其中有一个节目是开锁咒：舞台上有 n 个盒子，每个盒子中有一把钥匙，对于每个盒子而言有且仅有一把钥匙能打开它。初始时，崔克茜将会随机地选择 k 个盒子用魔法将它们打开。崔克茜想知道最后所有盒子都被打开的概率，你能帮助她回答这个问题吗？输入第一行一个整数 T (T ≤ 100)表示数据组数。 对于每组数据，第一行有两个整数 n 和 k (1 ≤

Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4410 Accepted: 2496DescriptionThere is going to be a party to celebrate the 80-th Ann

Hatsune MikuProblem DescriptionHatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on yo

Problem Descriptionshadow来到一片神奇的土地，这片土地上不时会出现一些有价值的水晶，shadow想要收集一些水晶带回去，但是这项任务太繁杂了，于是shadow让自己的影子脱离自己并成为一个助手来帮助自己收集这些水晶。shadow把这片土地划分成n*m个小方格，某些格子会存在一些shadow和他的影子都无法穿越的障碍，比如巨石、树木、野兽等。shadow预先探测到

Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 941    Accepted Submission(s): 352Problem Description《Journey to t

Mondriaan's DreamTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 783    Accepted Submission(s): 506Problem Description Squares

Fast FoodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2173    Accepted Submission(s): 930Problem DescriptionThe fastfood chain

ContestProblem DescriptionIn the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming pr

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8062 Accepted: 4295DescriptionFarmer John has purchased a lush new rectangular pasture compos

WalkProblem DescriptionI used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a connected bidirectional graph, and

1057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactlyK different integer de

TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3585 Accepted: 1597DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he r

Max SequenceTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 15569 Accepted: 6538DescriptionGive you N integers a1, a2 ... aN (|ai| You should ou

Maximum sumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33363 Accepted: 10330DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a

Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25087 Accepted: 7069 Special JudgeDescriptionLet us define a regular brackets seq

StringProblem DescriptionYou hava a non-empty string which consists of lowercase English letters and may contain at most one '?'. Let's choose non-empty substring G from S (it can be G = S

A Famous Stone CollectorProblem DescriptionMr. B loves to play with colorful stones. There are n colors of stones in his collection. Two stones with the same color are indistinguishable. M

Painting StoragesTime Limit: 2 Seconds      Memory Limit: 65536 KBThere is a straight highway with N storages alongside it labeled by 1,2,3,...,N. Bob asks you to paint all storages with two

A - 爱管闲事春希非常爱管闲事，他每天都会抽空帮助一些同学，由于春希非常死板，出于公平性，春希不会先帮助后来找他的同学。现在有n个同学需要他的帮助，虽然他很想一天之类帮助所有人，但毕竟精力有限，于是他决定分m天来帮助他们。根据事情的重要性，春希帮助不同同学会有不同的快乐值，而春希获得的总的快乐值为每天获得的快乐值的乘积。现在给出n和m，以及帮助完各同学时获得的快乐值，

Problem Description有很多从磁盘读取数据的需求，包括顺序读取、随机读取。为了提高效率，需要人为安排磁盘读取。然而，在现实中，这种做法很复杂。我们考虑一个相对简单的场景。磁盘有许多轨道，每个轨道有许多扇区，用于存储数据。当我们想在特定扇区来读取数据时，磁头需要跳转到特定的轨道、具体扇区进行读取操作。为了简单，我们假设磁头可以在某个轨道顺时针或逆时针匀速旋转，旋转一周的时间是36

LabyrinthTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 519    Accepted Submission(s): 174Problem Description度度熊是一只喜欢探险的熊，一次偶然落

The number of stepsTime Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述    Mary stands in a strange maze, the maze looks like a triangle（the first layer have one room，the seco

Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2026 Accepted: 971Case Time Limit: 2000MS Special JudgeDescriptionIvan is fond o

TicketsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ←

代码：#include #include #include #include using namespace std;const int maxn=10003;const int inf=0x7fffffff;int num[maxn];int n;int main(){ while(scanf("%d",&n)!=EOF&&n)

Super Jumping! Jumping! Jumping!Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 5Font: Times New Roman | Verdan

Ignatius and the Princess IVTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32767K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 3Font: Times New Roman | Verdana | 

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 135262    Accepted Submission(s): 31311Problem Description Given a sequen

题目1131：合唱队形 时间限制：1 秒内存限制：32 兆特殊判题：否提交：1680解决：520题目描述： N位同学站成一排，音乐老师要请其中的(N-K)位同学出列，使得剩下的K位同学不交换位置就能排成合唱队形。合唱队形是指这样的一种队形：设K位同学从左到右依次编号为1, 2, …, K，他们的身高分别为T1, T2, …, TK，则他们的身高满

Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10212 Accepted: 3855DescriptionA group of N people wishes to go across a river with only one

解题思路：求至少收到一份OFFER的最大概率，为了简化问题，求一份OFFER也没有收到的最小概率，然后1减去它就可以了。采用01背包，装入一份OFFER也没收到总概率的最小值，那么1减去它就是收到至少一份OFFER的最大概率。注意：dp[最大容量] 要有值，初始化时，而且本题dp数组初始化值为1代码：#include #include #include using name

Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14635    Accepted Submission(s): 4158Proble

Pick applesTime Limit: 1000MS Memory limit: 165536K题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a

能量项链Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 55(20 users)Total Accepted: 22(19 users)Rating: Special Judge: NoDescription

括号匹配Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 110   Accepted Submission(s) : 46Font: Times New Roman | Verdana | GeorgiaFont Size: ←

Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23884 Accepted: 6727 Special JudgeDescriptionLet us define a regular brackets sequenc

CoinsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6347    Accepted Submission(s): 2589Problem Description Whuacmers use coins