其他

IntervalsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19291 Accepted: 7270DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn. Write a program that: reads the number of intervals, their end points

Special equationsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 189    Accepted Submission(s): 97Special JudgeProblem Description　　Let f(x) = anxn +...+ a1x +a0, in which ai (0 <= i <= n)

題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=3533題目大意：給一個m*n的矩陣方格，有k門大炮，每門大炮以t為周期向c方向發射炮彈，炮彈速度為v.求從(0,0)到(m,n)位置最短的時間，中間不能被炮彈打到，時間不能超過d.解題思路：預先處理好後就是簡單的BFS。先預先處理每個點能夠被炮彈射擊的所有時刻，然後用vis[x][y][t]判重，表示到達(x,y)位置時刻為t時是否被訪問。代碼：#include<iostream>#inc

WalkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1142    Accepted Submission(s): 195Problem DescriptionBiaoge is planning to walk to amusement park. The city he lives can be abstracted as a 2

Window PainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1357 Accepted: 679DescriptionBoudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running one application at a time, he usually

 題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=1345 題目意思：給你石頭的數量n，然後給你m個數，每個數表示每次可以拿的石頭的數量，其中一定有一個數為1。有兩個人玩遊戲，依次從石頭堆裡取上面m個數中的一個，拿走該數量的石頭，最後拿完石頭的那個人贏，問誰贏。每個人每一步都是朝最有利於自

 題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=481&mosmsg=Submission+received+with+ID+11144937 題目意思：    給你n個組，以及每組的成員，讓你建一個隊列，開始隊列為空白。有兩種操作：1、ENQUEUE x  ：

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7529    Accepted Submission(s): 3345Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size

 題目連結：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4973 題目意思：有n個人，有1——m個數，每個人可以選擇1個數，要求相鄰的兩個人如果選的數相同則必須大於k,求選數的種數。 解題思路：dp[n][1]表示第n個人選大於k的數的總的種數，dp[n][2]表示第n個人選<=k的數的總的種數。則  dp[n][1]=(m-k)*dp[n-1][1]+(m-k)*dp[n-1][2]     

Maximum Random WalkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 219    Accepted Submission(s): 120Problem DescriptionConsider the classic random walk: at each step, you have a 1/2 chance of

題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=4489題目意思：給一個n,求n個高矮不同的人排成一排使得高、矮依次排列的種數。解題思路：組合dp.對於n個人，設其高度分別為1,2,3,,,,,n.

The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 172    Accepted Submission(s): 106Problem DescriptionThe king has guards of all different heights. Rather than line them

Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31008 Accepted: 9291DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 46553 Accepted: 13655Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of

Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5328 Accepted Submission(s): 2839Problem DescriptionN個氣球排成一排，從左至右依次編號為1,2,3....N.每次給定2個整數a b(a <=

 題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=47 題目意思：  

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10102 Accepted: 4489DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7503    Accepted Submission(s): 4610Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5967 Accepted: 3219DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each

Travelling FeeTime Limit: 2 Seconds      Memory Limit: 65536 KB Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next step is to determine the travel route. As this poor guy