2013 年 7月随笔档案 - cssystem

8.2.8 A Simple Game

摘要：A Simple GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 36 Accepted Submission(s): 29 Problem Description Agrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones num... 阅读全文

posted @ 2013-07-24 21:02 cssystem 阅读(179) 评论(0) 推荐(0)

8.2.7 Be the Winner

摘要：Be the WinnerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 38 Accepted Submission(s): 29 Problem Description Let's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can... 阅读全文

posted @ 2013-07-24 21:01 cssystem 阅读(313) 评论(0) 推荐(0)

8.2.6 John

摘要：JohnTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 31 Accepted Submission(s): 23 Problem Description Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At f... 阅读全文

posted @ 2013-07-24 21:00 cssystem 阅读(217) 评论(0) 推荐(0)

8.2.5 kiki's game

摘要：kiki's gameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 34 Accepted Submission(s): 26 Problem Description Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game... 阅读全文

posted @ 2013-07-24 20:58 cssystem 阅读(245) 评论(0) 推荐(0)

8.2.2 Good Luck in CET-4 Everybody!

摘要：Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45 Accepted Submission(s): 39 Problem Description 大学英语四级考试就要来临了，你是不是在紧张的复习？也许紧张得连短学期的ACM都没工夫练习了，反正我知道的Kiki和Cici都是如此。当然，作为在考场浸润了十几载的当代大学生，Kiki和Cici更懂得考前的放... 阅读全文

posted @ 2013-07-24 20:57 cssystem 阅读(336) 评论(0) 推荐(0)

8.2.4 悼念512汶川大地震遇难同胞——选拔志愿者

摘要：悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33 Accepted Submission(s): 27 Problem Description 对于四川同胞遭受的灾难，全国人民纷纷伸出援助之手，几乎每个省市都派出了大量的救援人员，这其中包括抢险救灾的武警部队，治疗和防疫的医护人员，以及进行心理疏导的心理学专家。根据要求，我校也有一个奔赴灾区救灾的名额，由于广大师生... 阅读全文

posted @ 2013-07-24 20:56 cssystem 阅读(246) 评论(0) 推荐(0)

8.1.8 Team Queue

摘要：Team QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60 Accepted Submission(s): 36 Problem Description Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is no... 阅读全文

posted @ 2013-07-24 20:53 cssystem 阅读(205) 评论(0) 推荐(0)

8.2.1 Brave Game

摘要：Brave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 46 Accepted Submission(s): 40 Problem Description 十年前读大学的时候，中国每年都要从国外引进一些电影大片，其中有一部电影就叫《勇敢者的游戏》（英文名称：Zathura），一直到现在，我依然对于电影中的部分电脑特技印象深刻。今天，大家选择上机考试，就是一种勇敢（brave）的选择；这个短学期，我... 阅读全文

posted @ 2013-07-24 20:52 cssystem 阅读(246) 评论(0) 推荐(0)

8.1.6 Windows Message Queue

摘要：Windows Message QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50 Accepted Submission(s): 33 Problem Description Message queue is the basic fundamental of windows system. For each process, the system maintains a message queu... 阅读全文

posted @ 2013-07-24 20:51 cssystem 阅读(369) 评论(0) 推荐(0)

8.1.7 愚人节的礼物

摘要：愚人节的礼物Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32 Accepted Submission(s): 30 Problem Description 四月一日快到了，Vayko想了个愚人的好办法——送礼物。嘿嘿，不要想的太好，这礼物可没那么简单，Vayko为了愚人，准备了一堆盒子，其中有一个盒子里面装了礼物。盒子里面可以再放零个或者多个盒子。假设放礼物的盒子里不再放其他盒子。用()表示一个盒子，B表... 阅读全文

posted @ 2013-07-24 20:51 cssystem 阅读(226) 评论(0) 推荐(0)

8.1.4 Flipper

摘要：FlipperTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 39 Accepted Submission(s): 29 Problem Description Little Bobby Roberts (son of Big Bob, of Problem G) plays this solitaire memory game called Flipper. He starts with n cards, ... 阅读全文

posted @ 2013-07-24 20:48 cssystem 阅读(377) 评论(0) 推荐(0)

8.1.5 看病要排队

摘要：看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 43 Accepted Submission(s): 31 Problem Description 看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级... 阅读全文

posted @ 2013-07-24 20:48 cssystem 阅读(226) 评论(0) 推荐(0)

8.1.3 简单计算器

摘要：简单计算器Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 44 Problem Description 读入一个只包含 +, -, *, / 的非负整数计算表达式，计算该表达式的值。 Input 测试输入包含若干测试用例，每个测试用例占一行，每行不超过200个字符，整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有... 阅读全文

posted @ 2013-07-24 20:47 cssystem 阅读(231) 评论(0) 推荐(0)

8.1.2 Train Problem I

摘要：As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So al. 阅读全文

posted @ 2013-07-24 20:45 cssystem 阅读(187) 评论(0) 推荐(0)

8.1.1 ACboy needs your help again!

摘要：Problem Description ACboy was kidnapped!! he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :&q 阅读全文

posted @ 2013-07-24 20:43 cssystem 阅读(206) 评论(0) 推荐(0)

7.3.3 Square Coins

摘要：Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50 Accepted Submission(s): 48 Problem Description People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins ... 阅读全文

posted @ 2013-07-24 20:38 cssystem 阅读(228) 评论(0) 推荐(0)

7.3.6 pi

摘要：piTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47 Accepted Submission(s): 27 Problem Description 计算圆周率到小数点后5n 位。（本题不可打表） Input 正整数n=1;i--){11 ans=TWO.add(ans.multiply(td(i)).divide(td(2*i+1),1800,Big... 阅读全文

posted @ 2013-07-24 20:36 cssystem 阅读(414) 评论(0) 推荐(0)

7.3.7 循环多少次？

摘要：循环多少次？Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37 Accepted Submission(s): 24 Problem Description 我们知道，在编程中，我们时常需要考虑到时间复杂度，特别是对于循环的部分。例如，如果代码中出现for(i=1;i 2 #include 3 #include 4 #include 5 #include 6 #include 7 using na... 阅读全文

posted @ 2013-07-24 20:33 cssystem 阅读(358) 评论(0) 推荐(0)

7.3.5 The Balance

摘要：The BalanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 50 Problem Description Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achiev... 阅读全文

posted @ 2013-07-24 20:28 cssystem 阅读(187) 评论(0) 推荐(0)

7.3.4 Fruit

摘要：FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 35 Accepted Submission(s): 26 Problem Description 转眼到了收获的季节，由于有TT的专业指导，Lele获得了大丰收。特别是水果，Lele一共种了N种水果，有苹果，梨子，香蕉，西瓜……不但味道好吃，样子更是好看。于是，很多人们慕名而来，找Lele买水果。甚至连大名鼎鼎的HDU ACM总教头 lcy 也来了。... 阅读全文

posted @ 2013-07-24 20:23 cssystem 阅读(270) 评论(0) 推荐(0)

8.2.3 Fibonacci again and again

摘要：Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 45 Problem Description 任何一个大学生对菲波那契数列(Fibonacci numbers)应该都不会陌生，它是这样定义的：F(1)=1;F(2)=2;F(n)=F(n-1)+F(n-2)(n>=3);所以，1,2,3,5,8,13……就是... 阅读全文

posted @ 2013-07-22 10:30 cssystem 阅读(367) 评论(0) 推荐(0)

7.2.5 Description has only two Sentences

摘要：Problem Description an = X*an-1 + Y and Y mod (X-1) = 0.Your task is to calculate the smallest positive integer k that ak mod a0 = 0. Input Each line will contain only three integers X, Y, a0 ( 1 < X < 231, 0 <= Y < 263, 0 < a0 < 231). Output For each case, output th... 阅读全文

posted @ 2013-07-14 11:37 cssystem 阅读(171) 评论(0) 推荐(0)

7.2.1 The Euler function

摘要：The Euler functionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 134 Accepted Submission(s): 76 Problem Description The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbe... 阅读全文

posted @ 2013-07-14 00:43 cssystem 阅读(153) 评论(0) 推荐(0)

7.1.8 Assignments

摘要：AssignmentsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48 Accepted Submission(s): 35 Problem Description In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A need... 阅读全文

posted @ 2013-07-13 22:15 cssystem 阅读(170) 评论(0) 推荐(0)

7.1.7 Quoit Design

摘要：Problem Description Have 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 awarded.In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a ti 阅读全文

posted @ 2013-07-13 22:13 cssystem 阅读(198) 评论(0) 推荐(0)

7.1.6 Maple trees

摘要：Problem Description There are a lot of trees in HDU. Kiki want to surround all the trees with the minimal required length of the rope . As follow, To make this problem more simple, consider all the trees are circles in a plate. The diameter of all the trees are the same (the diamet... 阅读全文

posted @ 2013-07-13 16:12 cssystem 阅读(442) 评论(0) 推荐(0)

7.1.4 Surround the Trees

摘要：---恢复内容开始---Surround the TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 166 Accepted Submission(s): 81 Problem Description There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at... 阅读全文

posted @ 2013-07-12 00:14 cssystem 阅读(256) 评论(0) 推荐(0)

TYVJ P2072 - [NOIP2012T2]国王游戏

摘要：背景 BackgroundNOIP2012提高组题2描述 Description恰逢H国国庆,国王邀请n位大臣来玩一个有奖游戏。首先,他让每个大臣在左、右手上面分别写下一个整数,国王自己也在左、右手上各写一个整数。然后,让这n位大臣排成一排,国王站在队伍的最前面。排好队后,所有的大臣都会获得国王奖赏的若干金币,每位大臣获得的金币数分别是:排在该大臣前面的所有人的左手上的数的乘积除以他自己右手上的数,然后向下取整得到的结果。国王不希望某一个大臣获得特别多的奖赏,所以他想请你帮他重新安排一下队伍的顺序,使得获得奖赏最多的大臣,所获奖赏尽可能的少。注意,国王的位置始终在队伍的最前面。 ... 阅读全文

posted @ 2013-07-03 23:18 cssystem 阅读(489) 评论(0) 推荐(0)

TYVJ P1651 - 小数学家

摘要：背景 Background清北学堂杯Tyvj2周年邀请赛第三道描述 DescriptionVNB从小立志当一名杰出的数学家。有一天，admin给了VNB一个任务：求int(√1)+int(√2)+……+int(√n)的值是多少。VNB 以为很简单，就接下了这个任务，但是当他看到n的范围大小就傻眼了。所以，他打着“节约计算用纸以保护地球”的口号向你发出了求救。注：int(x)表示实数x的整数部分。再注：VNB怕你算太长时间，就先帮你算出了int(√n)的大小，来帮助你更好的完成此题。 ... 阅读全文

posted @ 2013-07-03 23:08 cssystem 阅读(453) 评论(0) 推荐(0)

TYVJ P1607 - 小熊的早餐

摘要：背景 BackgroundAndyBear生日模拟赛第一题描述 Description BIBO是个贪吃的小熊，她有很多喜欢的食物，但是为了控制体重，她每天不能吃的太多，因此小熊BIBO给每一种食物都赋了一个喜欢程度K，BIBO每天从她所有喜欢的食物中挑出一件喜欢程度最大的来吃，可能是蜂蜜，也可能是面包，同时小熊BIBO还会更改某一种食物的喜欢程度，或者说自己不喜欢某件食物了。你，作为小熊BIBO的... 阅读全文

posted @ 2013-07-03 23:06 cssystem 阅读(233) 评论(0) 推荐(0)

TYVJ P1405 - 接水问题加强版

摘要：背景 Background根据NOIP2010普及组复赛第二题改编描述 Description学校里有一个水房，水房里一共装有m个龙头可供同学们打开水，每个龙头每秒钟的供水量相等，均为1。现在有n名同学准备接水，他们的初始接水顺序已经确定。将这些同学按接水顺序从1到n编号，i号同学的接水量为wi。接水开始时，1到m号同学各占一个水龙头，并同时打开水龙头接水。当其中某名同学j完成其接水量要求wj后，下一名排队等候接水的同学k马上接替j同学的位置开始接水。这个换人的过程是瞬间完成的，且没有任何水的浪费。即j同学第x秒结束时完成接水，则k同学第x+1秒立刻开始接水。若当前接水人数n’不足m，则只有n 阅读全文

posted @ 2013-07-03 23:05 cssystem 阅读(481) 评论(0) 推荐(0)

TYVJ P1234 - bench与奔驰

摘要：背景 Background公园里有个人在练开奔驰--!，但是总是撞在bench上(众人曰：狼来了，快跑啊!)描述 Description公园里的bench与奔驰都是无敌的，不会被撞坏。由于开奔驰的人比较"有特点"，总是向上下左右四个方向开，而且只会在撞到椅子之后改变方向(起步时除外)--!现在他给你一张地图，上面标明他的位置、公园里的bench的位置和他想到达的位置，可能会有冲出地图的可能请你告诉他最少撞多少下才能到达目的地，并答应事成之后会给你一辆奔驰..............................................的照片 ... 阅读全文

posted @ 2013-07-03 23:01 cssystem 阅读(404) 评论(0) 推荐(0)

TYVJ P1077 - 有理逼近

摘要：描述 Description对于一个素数P，我们可以用一系列有理分数(分子、分母都是不大于N的自然数)来逼近sqrt(p)，例如P=2，N=5的时候：1/1sqrt(p)），求X、Y、U、V，使x/yx^2/y^2 2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 9 const int maxn=210;10 int x,a1,a2,b1,b2,z,n,p;11 double y,v;12 13 void close()14 {15 exit(0);16 }17 18 v... 阅读全文

posted @ 2013-07-03 23:00 cssystem 阅读(389) 评论(0) 推荐(0)

TYVJ P1063 - 数字串

摘要：好久都没写过日志了。。TAT描述 Description给你一个长度为n的数字串，数字串里会包含1-m这些数字。如果连续的一段数字子串包含了1-m这些数字，则称这个数字字串为NUM串。你的任务是求出长度最短的NUM串是什么，只需要输出这个长度即可。1m的就不合法，清空h,t，此外，用一个f数组记录每个数用了多少次，这样的话，一个合法的数字串假设是1 1 2 3 3 3 4那么我就知道一共出现的cnt=4，因为有F数组判重，这样的话，ans=min(ans,t-h+1);2、找到一个合法的数字串后，尝试从h处往t处删数，并保证数字串的性质，这样不管怎么都是O(n)的，因为h始终在增大，并只操作一阅读全文

posted @ 2013-07-03 22:57 cssystem 阅读(505) 评论(0) 推荐(0)

随笔分类

随笔档案

阅读排行榜

评论排行榜

推荐排行榜

最新评论