水题
文章平均质量分 70
u011123263
这个作者很懒,什么都没留下…
展开
-
找树根和孩子
Problem Description给定一棵树,输出树的根root,孩子最多的结点max以及他的孩子Input输入的第一行为T,表示测试数据的组数。对于每组测试数据的第一行:n(结点数Output对于每组测试数据:第一行:树根:root。 第二行:孩子最多的结点max。 第三行:max的孩子。Sample Input1原创 2013-11-17 21:52:11 · 1326 阅读 · 0 评论 -
加密
Problem DescriptionLet me introduce an easy method of encryption to you.Suppose there’re N bytes (1 byte = 8 bits) data that are to be encrypted and we want to encrypt them in groups of M bytes,原创 2014-04-25 21:06:45 · 396 阅读 · 0 评论 -
均分纸牌
Problem Description有 N 堆纸牌,编号分别为 1,2,…, N。每堆上有若干张,但纸牌总数必为 N 的倍数。可以在任一堆上取若干张纸牌,然后移动。移牌规则为:在编号为 1 堆上取的纸牌,只能移到编号为 2 的堆上;在编号为 N 的堆上取的纸牌,只能移到编号为 N-1 的堆上;其他堆上取的纸牌,可以移到相邻左边或右边的堆上。现在要求找出一种移动方法,用最少的移动次原创 2013-11-11 20:17:20 · 687 阅读 · 0 评论 -
Talented Chef
As we all know, Coach Gao is a talented chef, because he is able to cook M dishes in the same time. Tonight he is going to have a hearty dinner with his girlfriend at his home. Of course, Coach Gao原创 2014-04-13 18:16:37 · 529 阅读 · 0 评论 -
跑得快计数程序
Problem description 跑得快纸牌游戏深受大家的喜爱,但是也有一个不好之处,就是计数有时比较麻烦,所以就要你写一个程序来计算最终结果。 题目描述: 四个人打跑得快,每个人有12张牌,最先出完牌的人就是获胜者,其他人手上还剩几张牌就按每张牌0.2元计算输的钱,为了好计算就向0.5取整,也就是说0.4就算0.5,0.2就算0,其他同理可得。但是也有一个特殊情况,就是没原创 2014-06-08 21:06:44 · 3896 阅读 · 0 评论 -
Happy Number
Problem DescriptionRecently, Mr. Xie learn the concept of happy number. A happy number is a number contain all digit 7 or only 1 digit other than 7. For example, 777 is a happy number because 777原创 2014-06-07 19:15:26 · 2468 阅读 · 0 评论 -
Welcome to XTCPC
Problem DescriptionWelcome to XTCPC! XTCPC start today, you are going to choose a slogan to celebrate it, many people give you some candidate string about the slogan, but the slogan itself must ha原创 2014-06-07 19:06:36 · 718 阅读 · 0 评论 -
Alice and Bob
Problem DescriptionThe famous "Alice and Bob" are playing a game again. So now comes the new problem which need a person smart as you to decide the winner. The problem is as follows: They are play原创 2014-06-07 19:12:46 · 1359 阅读 · 0 评论 -
翻硬币
Problem DescriptionSheldon 被困于一个不同的次元中,并试图跳回原来的世界中,然而这个能让他回去的设备只有一台,而且只能让一个人用一次!被困在这个次元中的人不止一个,因而他们聚到了一起,试图通过比赛来判定谁是最优秀的,并让这个人回到原来的世界中。这个莫名其妙的世界里头充满了大量的硬币,因而他们准备采用单循环赛制用各种硬币问题来决胜负。Sheldon 的优势就在于他有一台原创 2014-05-25 20:14:52 · 440 阅读 · 0 评论 -
孪生素数问题
描述写一个程序,找出给出素数范围内的所有孪生素数的组数。一般来说,孪生素数就是指两个素数距离为2,近的不能再近的相邻素数。有些童鞋一看到题就开始写程序,不仔细看题,咱们为了遏制一下读题不认真仔细的童鞋,规定,两个素数相邻为1的也成为孪生素数。输入第一行给出N(0接下来组测试数据给出m,表示找出m之前的所有孪生素数。(0输出每组测试数据输出占一行,该行为m范围内所原创 2014-07-11 12:09:26 · 452 阅读 · 0 评论 -
灌水VS抽水
Problem DescriptionThere is something crazy! There is a pool and many of pumps to fill up the empty pool. We know that the capacity of each pump. And at last, we want you to tell us whether we can原创 2014-07-15 15:13:35 · 1081 阅读 · 0 评论 -
循环小数
Problem DescriptionGiven a floating point number X, the form is X=0.a1a2...an(b1b2...bm)(1<=n,m<=8). (b1b2...bm) indicates the repetend. For example, 0.5=0.50=0.5(0)=0.5(00)=1/2,0.3(3)=0.333(33)=1/3.原创 2014-08-20 15:57:01 · 490 阅读 · 0 评论 -
nfected Computer
DescriptionInputOutputSample Input3 21 1 22 2 3Sample Output3////bi原创 2014-05-11 11:48:48 · 499 阅读 · 0 评论 -
数组
Problem DescriptionArray is frequently used when we are programing. We are familiar with it. Here is a problem about array. Do enjoy it and try your best to solve it.Assume there is an array: a[原创 2014-04-24 23:04:48 · 378 阅读 · 0 评论 -
铲雪车
Problem Description随着白天越来越短夜晚越来越长,我们不得不考虑铲雪问题了。整个城市所有的道路都是双车道,因为城市预算的削减,整个城市只有1辆铲雪车。铲雪车只能把它开过的地方(车道)的雪铲干净,无论哪儿有雪,铲雪车都得从停放的地方出发,游历整个城市的街道。现在的问题是:最少要花多少时间去铲掉所有道路上的雪呢?Input输入有多组数据,每组数据的第1行表示铲原创 2014-04-08 18:32:10 · 4720 阅读 · 0 评论 -
面积
Problem Description编程计算由“*”号围成的下列图形的面积。面积计算方法是统计*号所围成的闭合曲线中水平线和垂直线交点的数目。如下所示,在10*10的二维数组中,有“*”围住了15个点,因此面积为15。0 0 0 0 0 0 0 0 0 00 0 0 0 * * * 0 0 00 0 0 0 * 0 0 * 0 00 0 0 0 0 * 0 0 * 0原创 2013-12-10 19:34:03 · 3216 阅读 · 0 评论 -
取余运算
Problem Description输入b,p,k的值,求b^p mod k的值。Input输入有多组数据,每组数据为一行三个数b,p,k,其中b,p,k*k为长整型数。Output对于每组数据输出b^p mod k的值。Sample Input2 10 9 Sample Output2^10 mod 9=7//关键原创 2013-12-04 21:55:07 · 812 阅读 · 0 评论 -
Hello World!
DescriptionWe know that Ivan gives Saya three problems to solve (Problem F), and this is the first problem.“We need a programmer to help us for some projects. If you show us that you or one of y原创 2013-12-17 22:11:06 · 553 阅读 · 0 评论 -
对称二叉树
Problem Description如果二叉树的左右子树的结构是对称的,即两棵子树皆为空,或者皆不空,则称该二叉树是对称的。判断给定的二叉树是否对称。二叉树用层序结构给出,若读到#则为空,如果二叉树是对称的,输出“Yes”,反之输出“ No”。Input输入有多组数据,每组数据只有一行为二叉树的层序结构字符串,长度不大于100。Output对于每组数据如果原创 2014-03-01 16:10:03 · 1960 阅读 · 0 评论 -
排队接水
Problem Description有n(1Input输入有多组数据,每组数据的第一行为n,第二行分别表示第1个人到第n个人的接水时间t1,t2,...,tn,每个数据之间有1个空格。Output对于每组数据输出两行,第一行为一种排队顺序,即1到n的一种排列,第二行为这种排列方案下的平均等待时间(输出结果精确到小数点后两位)。Sample Inpu原创 2014-03-13 20:52:31 · 1145 阅读 · 0 评论 -
图的邻接表表示
Problem Description给出图的顶点数和顶点与顶点之间的连接关系,请输出图的邻接表。Input输入的第一行是一个整数T表示测试示例的数目,每组示例的第一行有两个数m(2Output对于每组数据输出图的邻接表,每组邻接表之间用空行隔开。每个邻接表每行的第一个数字为顶点号(顶点号按顺序排列),后面的数字是与该顶点有边相邻的顶点序列。输出顶点的前后顺原创 2014-03-14 19:51:31 · 616 阅读 · 0 评论 -
拼数
题目描述设有n个正整数(n≤20),将它们联接成一排,组成一个最大的多位整数。例如:n=3时,3个整数13,312,343联接成的最大整数为:34331213又如:n=4时,4个整数7,13,4,246联接成的最大整数为:7424613输入格式第一行,一个正整数n。第二行,n个正整数。输出格式一个正整数,表原创 2014-03-15 22:15:04 · 532 阅读 · 0 评论 -
Monitor
题目描述Reca company makes monitors, the most popular of their models is AB999 with the screen size a × b centimeters. Because of some production peculiarities a screen parameters are integer numbers.原创 2014-05-01 18:49:36 · 483 阅读 · 0 评论 -
Bit Problem
题目描述As everyone knows, any non-zero integer’s binary representation, must have at least one bit of the data 1, XiaoMing process whom wants to know if a binary representation of the rightmost 1 can原创 2014-05-01 17:58:31 · 499 阅读 · 0 评论 -
Solve equation
Problem DescriptionYou are given two positive integers A and B in Base C. For the equation:A=k*B+dWe know there always existing many non-negative pairs (k, d) that satisfy the equation abo原创 2014-05-04 19:45:07 · 685 阅读 · 0 评论 -
cover
Problem DescriptionTom wants to cover a rectangular floor by identical L-shape tiles without overlap. As shown below, the floor can be split into many small squares, and the L-shape tile consists原创 2014-05-06 21:57:00 · 498 阅读 · 0 评论 -
Triangles
Problem descriptionYou will be given N points on a circle. You must write a program to determine how many distinct equilateral triangles can be constructed using the given points as vertices.The gu原创 2014-09-26 19:01:29 · 899 阅读 · 0 评论