Y_yunhu的博客

DescriptionDouBiXp has a girlfriend named DouBiNan.One day they felt very boring and decided to play some games. The rule of this game is as following. There are k balls on the desk. Every ball has...

DescriptionI have been in school for several years, so I have visited all messes here. Now I have lost intersts in all of the foods. So when during the meal time, I don’t know which mess I should g...

题目描述在裕园小区，有一家津市牛肉粉店，在大一的时候，XP一周要吃上10次粉，上班后，XP还经常趁着看学妹的机会吃粉。因为计科、医信、信管的同学都来这里吃粉，有时候老板无法满足大家的需求。现在已知有 c 份 梅干菜红烧肉，m 份扁粉 ，x 个煎蛋。一碗粉必须由1份梅干菜红烧肉和1份扁粉，但是XP还想要加量，所以可以加1份梅干菜红烧肉，1份扁粉，1个煎蛋的任意一种，这样才完成了一碗粉的制作...

题目描述众所周知，金拱门最好吃的汉堡就是板烧鸡腿堡。当然XP也是这么觉得的。某个周末，XP到了一条金拱门街游玩，这条街上有n家金拱门的店铺，每个店铺都有一定的板烧鸡腿堡储量ai。现在，为了快乐，XP想在这条街道上买尽可能多的板烧鸡腿堡。但是，与此同时，出于某种汉堡哲学，当XP在第j个店铺买了xj个板烧鸡腿堡之后，必须保证在所有满足i>j的第i家店铺中都需要购买并且所买的板烧鸡腿堡...

DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。Input输入第一行为一个整数N，接下来N行为整数Pi（1<=Pi<=1000）。Output输出为N行，每行为对应的f(Pi)。Sample Input5...

DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.All what they remember is that MS Inc. posted a s...

Description不知道你是否玩过杀人游戏，这里的杀人游戏可没有法官，警察之类的人，只有土匪，现在已知有N个土匪站在一排，每个土匪都有一个编号，从1到N，每次杀人时给定一个K值，从还活着的土匪中，编号从小到大的找到K个人，然后杀掉，继续往下，直到找遍，然后继续从剩下的土匪中，编号从小到大找到第K个活着的土匪，然后杀掉。比如，现在有10个土匪，K为3，第一次杀掉3，6，9号的土匪，第二次杀...