keep trying - 博客园

The Little Girl who Picks Mushrooms HDU 4422 水题类似模拟的一种感觉

摘要： The Little Girl who Picks MushroomsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1070Accepted Submission(s): 346Problem DescriptionIt's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. Sh 阅读全文

posted @ 2013-10-22 18:03 keep trying 阅读(285) 评论(0) 推荐(0)

10026 - Shoemaker's Problem 贪心

摘要： Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ithjob, it is known the integer Ti(1#include#include#include#include#include#include#include#include#include#include#include//ios_base::sync_with_stdio(fal 阅读全文

posted @ 2013-10-21 22:57 keep trying 阅读(266) 评论(0) 推荐(0)

Sum of divisors HDU 4432 简单数学题

摘要： Sum of divisorsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2461Accepted Submission(s): 889Problem Descriptionmmm is learning division, she's so proud of herself that she can figure out the sum of all the divisors of numbers no larger than 1 阅读全文

posted @ 2013-10-20 18:07 keep trying 阅读(198) 评论(0) 推荐(0)

Mahjong HDU4431 略有难度的恶心模拟题

摘要： MahjongTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3110Accepted Submission(s): 620Problem DescriptionJapanese Mahjong is a four-player game. The game needs four people to sit around a desk and play with a set of Mahjong tiles. A set of Mahjong 阅读全文

posted @ 2013-10-20 18:04 keep trying 阅读(342) 评论(0) 推荐(0)

Dressing HDU 4451简单数学题

摘要： DressingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1925Accepted Submission(s): 831Problem DescriptionWangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K different combinations of dressing.One day he wears h 阅读全文

posted @ 2013-10-17 23:03 keep trying 阅读(216) 评论(0) 推荐(0)

Aeroplane chess ＨＤＵ　４４０５概率期望DP

摘要： Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 945Accepted Submission(s): 646Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

posted @ 2013-10-17 19:23 keep trying 阅读(236) 评论(0) 推荐(0)

Crazy Tank HDU 4445 枚举角度 + 几何 + 物理

摘要： Crazy TankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3578Accepted Submission(s): 637Problem DescriptionCrazy Tank was a famous game about ten years ago. Every child liked it. Time flies, children grow up, but the memory of happy childhood will 阅读全文

posted @ 2013-10-17 17:36 keep trying 阅读(361) 评论(1) 推荐(0)

Candy HDU 4665 概率期望问题

摘要： CandyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1159Accepted Submission(s): 508Special JudgeProblem DescriptionLazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies 阅读全文

posted @ 2013-10-16 19:42 keep trying 阅读(512) 评论(0) 推荐(0)

Problem F: Tug of War UVA 10032 DP

摘要： G -Tug of WarTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem F: Tug of WarA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team o 阅读全文

posted @ 2013-10-16 09:40 keep trying 阅读(727) 评论(0) 推荐(0)

A - Interpreter UVA 10033 简单模拟

摘要： A -InterpreterTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem G: InterpreterA certain computer has 10 registers and 1000 words of RAM. Each register or RAM location holds a 3-digit integer between 0 and 999. Instructions are encoded 阅读全文

posted @ 2013-10-15 23:15 keep trying 阅读(398) 评论(0) 推荐(0)