摘要: Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11600Accepted Submission(s): 4430Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of 阅读全文
posted @ 2014-01-07 12:03 龚细军 阅读(269) 评论(0) 推荐(0)
摘要: You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6340Accepted Submission(s): 3064Problem DescriptionMany geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this fina 阅读全文
posted @ 2014-01-07 09:47 龚细军 阅读(190) 评论(0) 推荐(0)
摘要: Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14343Accepted Submission(s): 6229Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16 阅读全文
posted @ 2014-01-06 19:47 龚细军 阅读(294) 评论(0) 推荐(0)
摘要: Wooden SticksTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9937Accepted Submission(s): 4081Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodwo 阅读全文
posted @ 2014-01-06 16:46 龚细军 阅读(292) 评论(0) 推荐(0)
摘要: RPG的错排Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6173Accepted Submission(s): 2508Problem Description今年暑假杭电ACM集训队第一次组成女生队,其中有一队叫RPG,但做为集训队成员之一的野骆驼竟然不知道RPG三个人具体是谁谁。RPG给他机会让他猜猜,第一次猜:R是公主,P是草儿,G是月野兔;第二次猜:R是草儿,P是月野兔,G是公主;第三次猜:R是草儿,P是公主,G是月野兔;...... 阅读全文
posted @ 2014-01-06 11:50 龚细军 阅读(518) 评论(0) 推荐(0)
摘要: Last non-zero Digit in N!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5596Accepted Submission(s): 1382Problem DescriptionThe expression N!, read as "N factorial," denotes the product of the first N positive integers, where N is nonnega 阅读全文
posted @ 2014-01-06 10:06 龚细军 阅读(342) 评论(0) 推荐(0)
摘要: 过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8364Accepted Submission(s): 3673Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只 阅读全文
posted @ 2014-01-05 20:16 龚细军 阅读(304) 评论(0) 推荐(0)
摘要: WormTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2471Accepted Submission(s): 1579Problem Description自从见识了平安夜苹果的涨价后,Lele就在他家门口水平种了一排苹果树,共有N棵。突然Lele发现在左起第P棵树上(从1开始计数)有一条毛毛虫。为了看到毛毛虫变蝴蝶的过程,Lele在苹果树旁观察了很久。虽然没有看到蝴蝶,但Lele发现了一个规律:每过1分钟,毛毛虫会随机从一棵树爬到相邻的一棵 阅读全文
posted @ 2014-01-05 18:05 龚细军 阅读(269) 评论(0) 推荐(0)
摘要: Public SaleTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3180Accepted Submission(s): 1958Problem Description虽然不想,但是现实总归是现实,Lele始终没有逃过退学的命运,因为他没有拿到奖学金。现在等待他的,就是像FarmJohn一样的农田生涯。要种田得有田才行,Lele听说街上正在举行一场别开生面的拍卖会,拍卖的物品正好就是一块20亩的田地。于是,Lele带上他的全部积蓄,冲往拍卖 阅读全文
posted @ 2014-01-05 15:26 龚细军 阅读(242) 评论(0) 推荐(0)
摘要: Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19595Accepted Submission(s): 8326Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another. 阅读全文
posted @ 2014-01-04 17:19 龚细军 阅读(279) 评论(0) 推荐(0)
摘要: MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11915Accepted Submission(s): 2885Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the superma 阅读全文
posted @ 2014-01-04 15:29 龚细军 阅读(348) 评论(0) 推荐(0)
摘要: 水果Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2791Accepted Submission(s): 1056Problem Description夏天来了~~好开心啊,呵呵,好多好多水果~~Joe经营着一个不大的水果店.他认为生存之道就是经营最受顾客欢迎的水果.现在他想要一份水果销售情况的明细表,这样Joe就可以很容易掌握所有水果的销售情况了.Input第一行正整数N(0 2 #include 3 #include 4 #include 阅读全文
posted @ 2013-12-30 16:42 龚细军 阅读(233) 评论(0) 推荐(0)
摘要: Prepared for New AcmerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5038Accepted Submission(s): 1979Problem Description集训进行了将近2个礼拜,这段时间以恢复性训练为主,我一直在密切关注大家的训练情况,目前为止,对大家的表现相当满意,首先是绝大部分队员的训练积极性很高,其次,都很遵守集训纪律,最后,老队员也起到了很好的带头作用,这里特别感谢为这次DP专题练习赛提供题目和测 阅读全文
posted @ 2013-12-30 15:45 龚细军 阅读(142) 评论(0) 推荐(0)
摘要: 汉诺塔IIITime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7934Accepted Submission(s): 3483Problem Description约19世纪末,在欧州的商店中出售一种智力玩具,在一块铜板上有三根杆,最左边的杆上自上而下、由小到大顺序串着由64个圆盘构成的塔。目的是将最左边杆上的盘全部移到右边的杆上,条件是一次只能移动一个盘,且不允许大盘放在小盘的上面。现在我们改变游戏的玩法,不允许直接从最左(右)边移到最右(左) 阅读全文
posted @ 2013-12-29 18:07 龚细军 阅读(397) 评论(0) 推荐(0)
摘要: "红色病毒"问题Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3339Accepted Submission(s): 1422Problem Description医学界发现的新病毒因其蔓延速度和Internet上传播的"红色病毒"不相上下,被称为"红色病毒",经研究发现,该病毒及其变种的DNA的一条单链中,胞嘧啶,腺嘧啶均是成对出现的。现在有一长度为N的字符串,满足一下条件:(1) 阅读全文
posted @ 2013-12-29 17:21 龚细军 阅读(768) 评论(0) 推荐(1)
摘要: OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3770Accepted Submission(s): 1485Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo gr 阅读全文
posted @ 2013-12-28 17:43 龚细军 阅读(463) 评论(0) 推荐(0)
摘要: Legal or NotTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3454Accepted Submission(s): 1569Problem DescriptionACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many &qu 阅读全文
posted @ 2013-12-28 15:45 龚细军 阅读(368) 评论(0) 推荐(0)
摘要: RewardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3129Accepted Submission(s): 944Problem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a tro 阅读全文
posted @ 2013-12-26 16:41 龚细军 阅读(344) 评论(0) 推荐(0)
摘要: 拓扑排序结合代码的完整理解 确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9284Accepted Submission(s): 3613Problem Description有N个比赛队(1#include#include#definemaxn505boolmap[maxn][maxn];intindegree[maxn],tp[maxn],n,m;voidtuopu_sort(){memset(tp,0,sizeof(tp)) 阅读全文
posted @ 2013-12-26 09:55 龚细军 阅读(392) 评论(0) 推荐(0)
摘要: Eddy's research IITime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2706Accepted Submission(s): 985Problem DescriptionAs is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other han 阅读全文
posted @ 2013-12-23 21:34 龚细军 阅读(233) 评论(0) 推荐(0)
摘要: Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6787Accepted Submission(s): 3549Problem DescriptionN个气球排成一排,从左到右依次编号为1,2,3....N.每次给定2个整数a b(a 3 #include 4 #include 5 #define maxn 100004 6 int ss[maxn],n; 7 int lowbit(int x) 8 { 9 ... 阅读全文
posted @ 2013-12-23 15:01 龚细军 阅读(228) 评论(0) 推荐(0)
摘要: 取(m堆)石子游戏Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1263Accepted Submission(s): 754Problem Descriptionm堆石子,两人轮流取.只能在1堆中取.取完者胜.先取者负输出No.先取者胜输出Yes,然后输出怎样取子.例如5堆 5,7,8,9,10先取者胜,先取者第1次取时可以从有8个的那一堆取走7个剩下1个,也可以从有9个的中那一堆取走9个剩下0个,也可以从有10个的中那一堆取走7个剩下3个 阅读全文
posted @ 2013-12-21 16:44 龚细军 阅读(277) 评论(0) 推荐(0)
摘要: 奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2575 Accepted Submission(s): 1135 Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一 阅读全文
posted @ 2013-12-18 22:43 龚细军 阅读(278) 评论(0) 推荐(0)
摘要: Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9114 Accepted Submission(s): 416... 阅读全文
posted @ 2013-12-18 22:14 龚细军 阅读(393) 评论(0) 推荐(0)
摘要: ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3282 Accepted Submission(s): 1703 Problem 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 differen 阅读全文
posted @ 2013-12-18 21:03 龚细军 阅读(239) 评论(0) 推荐(0)
摘要: A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3432 Accepted Submission(s): 869 Problem DescriptionGenerally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get tw 阅读全文
posted @ 2013-12-17 12:32 龚细军 阅读(365) 评论(1) 推荐(0)
摘要: 亲和串Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6579 Accepted Submission(s): 2976 Problem Description人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的:给 阅读全文
posted @ 2013-12-17 07:32 龚细军 阅读(432) 评论(0) 推荐(0)
摘要: 汉诺塔VITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1183 Accepted Submission(s): 833 Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于 发生错移产生的系列就增加了,这种错误是放错了柱子,并不会把大盘放到小盘上,即各柱 子从下往上的大小仍保持如下关系 : n=m+p+q a1>a2>...>am b1>b2 阅读全文
posted @ 2013-12-16 17:19 龚细军 阅读(211) 评论(0) 推荐(0)
摘要: 汉诺塔VTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2016 Accepted Submission(s): 1193 Problem Description用1,2,...,n表示n个盘子,称为1号盘,2号盘,...。号数大盘子就大。经典的汉诺塔问 题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于 印度传说的一个故事,上帝创造世界时作了三根金刚石柱子,在一根柱子上从下往上按大小 顺序摞着64片黄金圆盘。 阅读全文
posted @ 2013-12-16 17:01 龚细军 阅读(619) 评论(0) 推荐(0)
摘要: Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3177Accepted Submission(s): 1031Problem DescriptionPass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Es 阅读全文
posted @ 2013-12-14 20:21 龚细军 阅读(264) 评论(0) 推荐(0)
摘要: 一卡通大冒险Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1172Accepted Submission(s): 752Problem Description因为长期钻研算法, 无暇顾及个人问题,BUAA ACM/ICPC 训练小组的帅哥们大部分都是单身。某天,他们在机房商量一个绝妙的计划"一卡通大冒险"。这个计划是由wf最先提出来的,计划的内容是,把自己的联系方式写在校园一卡通的背面,然后故意将自己的卡"遗失& 阅读全文
posted @ 2013-12-12 21:25 龚细军 阅读(821) 评论(0) 推荐(0)
摘要: 火星A+BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9808Accepted Submission(s): 3232Problem Description读入两个不超过25位的火星正整数A和B,计算A+B。需要注意的是:在火星上,整数不是单一进制的,第n位的进制就是第n个素数。例如:地球上的10进制数2,在火星上记为“1,0”,因为火星个位数是2进制的;地球上的10进制数38,在火星上记为“1,1,1,0”,因为火星个位数是2进制的,十位 阅读全文
posted @ 2013-12-11 18:49 龚细军 阅读(508) 评论(0) 推荐(0)
摘要: 前缀式计算时间限制:1000 ms | 内存限制:65535 KB难度:3描述先说明一下什么是中缀式:如2+(3+4)*5这种我们最常见的式子就是中缀式。而把中缀式按运算顺序加上括号就是:(2+((3+4)*5))然后把运算符写到括号前面就是+(2 *( +(3 4) 5) )把括号去掉就是:+ 2 * + 3 4 5最后这个式子就是该表达式的前缀表示。给你一个前缀表达式,请你计算出该前缀式的值。比如:+ 2 * + 3 4 5的值就是 37输入有多组测试数据,每组测试数据占一行,任意两个操作符之间,任意两个操作数之间,操作数与操作符之间都有一个空格。输入的两个操作数可能是小数,数据保证输入的 阅读全文
posted @ 2013-12-07 20:43 龚细军 阅读(424) 评论(0) 推荐(0)
摘要: Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 252 Accepted Submission(s): 144 Problem Description Yesterday your dear cousin Coach Pang gave you a new 100MB hard disk drive (HDD) as a gift because you will get married next year. But you turn... 阅读全文
posted @ 2013-11-24 22:10 龚细军 阅读(343) 评论(0) 推荐(0)
摘要: 笨蛋难题四时间限制:1000 ms | 内存限制:65535 KB难度:3描述这些日子笨蛋一直研究股票,经过调研,终于发现xxx公司股票规律,更可喜的是 笨蛋推算出这家公司每天的股价,为了防止别人发现他的秘密。他决定对于这家公司的 股票最多买一次,现在笨蛋已经将股票价格列了出来。(这已经不是笨蛋的难题了,他已经解决 呵 呵)。只想难为难为你呀,从股票价格表上,你能算出笨蛋的每股股票最多能赚多少钱吗? 输入第一行一个n,表示n天(小于100000) 第二行 给出n天每股的价格输出每股最多赚多少钱样例输入4947 267 359 7717669 735 322 794 397 565 181 样. 阅读全文
posted @ 2013-11-13 21:24 龚细军 阅读(426) 评论(0) 推荐(0)
摘要: 时间限制:3000 ms | 内存限制:65535 KB难度:3描述Dr.Kong设计的机器人卡多掌握了加减法运算以后,最近又学会了一些简单的函数求值,比如,它知道函数min(20,23)的值是20 ,add(10,98) 的值是108等等。经过训练,Dr.Kong设计的机器人卡多甚至会计算一种嵌套的更复杂的表达式。假设表达式可以简单定义为:1.一个正的十进制数x是一个表达式。2.如果x和y是表达式,则 函数min(x,y)也是表达式,其值为x,y 中的最小数。3.如果x和y是表达式,则 函数max(x,y)也是表达式,其值为x,y 中的最大数。4.如果x和y是表达式,则 函数add(x,y) 阅读全文
posted @ 2013-11-12 11:00 龚细军 阅读(312) 评论(0) 推荐(0)
摘要: 变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 10665Accepted Submission(s): 3972 Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列 阅读全文
posted @ 2013-11-09 23:02 龚细军 阅读(506) 评论(0) 推荐(0)
摘要: 关键是自己没有读懂题目而已,不过还好,终于给做出来了......What Is Your Grade?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7101Accepted Submission(s): 2186 Problem Description“Point, point, life of student!” This is a ballad(歌谣)well known in colleges, and you must care . 阅读全文
posted @ 2013-11-08 07:14 龚细军 阅读(386) 评论(0) 推荐(0)
摘要: 小希的迷宫Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21080Accepted Submission(s): 6449 Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为 阅读全文
posted @ 2013-11-02 22:38 龚细军 阅读(388) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1269迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5596Accepted Submission(s): 2482 Problem Description为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N 2 #include 3 #include 4 #define maxn 10000 5 int shun[maxn+2] 阅读全文
posted @ 2013-11-02 08:24 龚细军 阅读(292) 评论(0) 推荐(0)