11 2013 档案
摘要:THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6380Accepted Submission(s): 1633Problem DescriptionYou have been given a matrix CN*M, each element E of CN*Mis positive and no more than 1000, The problem is that if there exist N nu
阅读全文
摘要:Is the Information Reliable?Time Limit:3000MSMemory Limit:131072KTotal Submissions:10303Accepted:3204DescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Draco established a line of defense called Grot. Grot is a straight line withNdefense stations.
阅读全文
摘要:Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21703Accepted Submission(s): 9682Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu
阅读全文
摘要:Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25335Accepted Submission(s): 6716Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled a
阅读全文
摘要:Dating with girls(1)Time Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2127Accepted Submission(s): 730Problem DescriptionEveryone in the HDU knows that the number of boys is larger than the number of girls. But now, every boy wants to date with pretty
阅读全文
摘要:Schedule ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1085Accepted Submission(s): 448Special JudgeProblem DescriptionA project can be divided into several parts. Each part should be completed continuously. This means if a part should take
阅读全文
摘要:IntervalsTime Limit:10 Seconds Memory Limit:32768 KBYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:> reads the number of intervals, their endpoints and integers c1, ..., cn from the standard input,> computes the minimal size of a set Z of int
阅读全文
摘要:Probability OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 379Accepted Submission(s): 293Problem DescriptionNumber guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithm
阅读全文
摘要:Invitation CardsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1588Accepted Submission(s): 714Problem DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They
阅读全文
摘要:XYZZYTime Limit:1000MSMemory Limit:30000KTotal Submissions:3105Accepted:887DescriptionThe prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at S
阅读全文
摘要:ArbitrageTime Limit:1000MSMemory Limit:65536KTotal Submissions:13800Accepted:5815DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound,
阅读全文
摘要:Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:24372Accepted:13408DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the st
阅读全文
摘要:FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:22557Accepted:7339DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen
阅读全文
摘要:昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:33365Accepted:9500Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,他可
阅读全文
摘要:转自:http://www.hnyzsz.net/Article/ShowArticle.asp?ArticleID=735【石子合并】 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。 试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。【输入文件】包含两行,第1 行是正整数n(1n then t←(i+k) mod n else t←i+k {最后一个连第一个的情况处理} s[i,j]←最优{s[i,k]+s[t,j-k]+sum[1,3]} {sum[i,j]表示从i开始数
阅读全文
摘要:Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2118Accepted Submission(s): 580Problem DescriptionThe final battle is coming. Now Harry Potter is located at city 1, and Voldemort is located at city n. To make the wo
阅读全文
摘要:FlightTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2014Accepted Submission(s): 428Problem DescriptionRecently, Shua Shua had a big quarrel with his GF. He is so upset that he decides to take a trip to some other city to avoid meeting her. He w
阅读全文
摘要:find the nth digitTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7403Accepted Submission(s): 2120Problem Description假设:S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789......
阅读全文
摘要:Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 8506Accepted Submission(s): 2216Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three number
阅读全文
摘要:Strange fuctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2278Accepted Submission(s): 1697Problem DescriptionNow, here is a fuction:F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 15 #define e 1e-716 double fac(double a,double b)17 {18 return 6*a*...
阅读全文
摘要:Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5999Accepted Submission(s): 2828Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try yo
阅读全文
摘要:Watch The MovieTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4613Accepted Submission(s): 1456Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight.
阅读全文
摘要:饭卡Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8047Accepted Submission(s): 2749Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡
阅读全文
摘要:ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3215Accepted Submission(s): 1670Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different co
阅读全文
摘要:Cyclic TourTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1197Accepted Submission(s): 626Problem DescriptionThere are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy th
阅读全文
摘要:I love sneakers!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3265Accepted Submission(s): 1337Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend
阅读全文
摘要:The dog taskTime Limit:1000MSMemory Limit:10000KTotal Submissions:2559Accepted:1038Special JudgeDescriptionHunter Bob often walks with his dog Ralph. Bob walks with a constant speed and his route is a polygonal line (possibly self-intersecting) whose vertices are specified by N pairs of integers (Xi
阅读全文
摘要:Air RaidTime Limit:1000MSMemory Limit:10000KTotal Submissions:6184Accepted:3703DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never
阅读全文
摘要:COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:15975Accepted:6293DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies si
阅读全文
摘要:Muddy FieldsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7340Accepted:2715DescriptionRain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 14 #include15 struct node{16 int x;17 int y;18 }edge[55][55];19 char c[55][55];20 int g[1500][1500];21 int vis[1500];...
阅读全文