ACM Competition
文章平均质量分 76
vinci_lau
这个作者很懒,什么都没留下…
展开
-
Marbles
MarblesInput: standard inputOutput: standard outputI have some (say, n) marbles (small glass balls) and I am going to buy some boxes to store them. The boxes are of two types:Type 1: each bo原创 2011-12-16 22:25:09 · 694 阅读 · 0 评论 -
Extra Krunch
Extra KrunchTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4794 Accepted: 1180DescriptionA krunched word has no vowels ("A", "E", "I", "O", and "U") and原创 2011-12-16 22:53:25 · 1352 阅读 · 0 评论 -
Joseph
JosephDescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth i原创 2011-12-16 22:57:03 · 953 阅读 · 0 评论 -
精简八皇后问题
问题描述 会下国际象棋的人都很清楚:皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将8个皇后放在棋盘上(有8 * 8个方格),使它们谁也不能被吃掉!这就是著名的八皇后问题。 对于某个满足要求的8皇后的摆放方法,定义一个皇后串a与之对应,即a=b 1 b 2 ...b 8 ,其中b i 为相应摆法中第i行皇后所处的列数。已经知道8皇后问题一共有92组解(原创 2011-12-17 10:24:43 · 1340 阅读 · 0 评论 -
《算法艺术与信息学竞赛》题目-提交方式对照表
id titlehow2submitsourcepage1 盒子里的气球 82 图书馆ural1188 93 钓鱼uva757pas134 照亮的山景 135 镜子盒 156 折纸痕uva1转载 2011-12-21 09:04:43 · 4516 阅读 · 0 评论 -
Haunted Graveyard
Haunted GraveyardTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 251 Accepted: 61DescriptionTonight is Halloween and Scared John and his friends have dec原创 2011-12-16 22:27:16 · 1061 阅读 · 0 评论 -
Ping pong
Ping pongTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 643 Accepted: 239DescriptionN(3<=N<=20000) ping pong players live along a west-east street(consid原创 2011-12-21 12:55:09 · 1381 阅读 · 0 评论 -
Atomic Nucleus Investigation 线段树
题目描述Recently the physicists have been investigating a large family of atomic nucleuses, named “X family”. They have discovered that these atomic nucleuses in X family are quite similar to each oth原创 2012-01-14 02:54:24 · 574 阅读 · 0 评论 -
487-3279
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 176480 Accepted: 30262DescriptionBusinesses like to have memorable telephone numbers. One way to m原创 2012-01-03 11:21:30 · 2117 阅读 · 0 评论 -
Mars Maps 线段树
Mars MapsTime Limit:1000MSMemory Limit:30000KBTotal Submit:17Accepted:8Description In the year 2051, several Mars expeditions have explored different areas of the red planet and produced ma原创 2012-01-04 13:50:33 · 1025 阅读 · 0 评论 -
To the Max
To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28700 Accepted: 14919DescriptionGiven a two-dimensional array of positive and negative integers原创 2011-12-16 22:49:17 · 377 阅读 · 0 评论 -
Constructing Roads In JGShining's Kingdom
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6146 Accepted Submission(s): 1786Prob原创 2011-12-16 22:41:19 · 1320 阅读 · 0 评论 -
Maximum sum on a torus
Maximum sum on a torusInput: Standard InputOutput: Standard OutputA grid that wraps both horizontally and vertically is called a torus. Given a torus where each cell contains an integer, determi原创 2011-12-16 22:40:04 · 644 阅读 · 0 评论 -
Silver Cow Party
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7579 Accepted: 3354DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2011-12-16 22:31:47 · 1392 阅读 · 0 评论 -
XYZZY
XYZZYTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 700 Accepted Submission(s): 187Problem DescriptionIt has recently been原创 2011-12-16 22:34:31 · 1655 阅读 · 0 评论 -
T9
T9Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 757 Accepted Submission(s): 312Problem DescriptionA while ago it was quite原创 2011-12-16 22:36:27 · 565 阅读 · 0 评论 -
Exponentiation
ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 93274 Accepted: 22295DescriptionProblems involving the computation of exact values of very l原创 2011-12-16 22:51:21 · 421 阅读 · 0 评论 -
Gone Fishing
Gone FishingTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 21189 Accepted: 6030DescriptionJohn is going on a fishing trip. He has h hours available (1 <原创 2011-12-16 22:55:30 · 517 阅读 · 0 评论 -
Dissatisfying Lift
Dissatisfying LiftDescriptionThere's a building with M floors. The amounts of tenants of every floor are K1, K2, K3, ..., Km. One day all the tenants went home together and they took the same lift原创 2011-12-16 22:58:51 · 1642 阅读 · 0 评论 -
青蛙的约会
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 66049 Accepted: 10506Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止原创 2011-12-16 22:29:24 · 5799 阅读 · 2 评论 -
Ignatius and the Princess I
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5000 Accepted Submission(s): 1527Special JudgeProbl原创 2011-12-16 22:45:28 · 688 阅读 · 0 评论 -
Ice-sugar Gourd
Ice-sugar GourdTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 568 Accepted Submission(s): 207Problem DescriptionIce-sugar原创 2011-12-16 22:20:24 · 2226 阅读 · 0 评论 -
Number Sequence
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45612 Accepted Submission(s): 10042Problem DescriptionA numbe原创 2011-12-16 22:38:15 · 389 阅读 · 0 评论 -
ICPC竞赛例题解(七)
8.58.5.1 Problem E preorder#include #include using namespace std;const int MAXN = 100001;struct tree{ int l,r; int num; }Tree[MAXN];int last,index[MAXN],num[MAXN];void maketree(int原创 2012-02-28 22:41:04 · 615 阅读 · 0 评论