腾讯俱乐部ACM训练赛入门组试题

腾讯俱乐部ACM训练赛入门组试题

1000.Love Message

Description:

Jiangshan and Zhao Yiran is a sweetheart lover in different class.So, Jiangshan developed a application to send message to Zhao Yiran through wireless.However,so unfortunately,their teachers are so great that all they send will be received by their teachers too.In order to keep their message secrecy, they have to encrypt the message.

When a char X appear n times,Jiangshan will show it as Xn,for example bb->b2. In order to get the love message,Zhao Yiran have to deciphering the message with mind acts upon mind.Could you help they to deciphering.

Input:

A string S,indicates the message Zhao Yiran get,all the char is lower case. There may be several test cases in the input file and end when S equal to XXX. Output

A string T,indicates the message after deciphering.

Sample Input

a3

go12gle

XXX

Sample Output

aaa

goooooooooooogle

1001.99division

Description Time Limit:1sec Memory Limit:256MB

Given a big integer n,please determine whether it can divided by99or not.

Input

Input consists of multiple test cases.The first line of input contains a positive integer T,the number of test cases.

Each test case consists of a single line which only contains a big integer n(0<=n<10^10000).

Output

For each test case,output on a single line.If n can be divided by99,output"Yes". If n can not be divided by99,output"No".

Sample Input

3

99

121

Sample Output

No

Yes

Yes

No

1002.Love Story

Description

The QGG has loved QMM for a long time.Actually QMM loves QGG,too.But there is a long distance between QGG and QMM.They want to see each other every day. They understand each other as the idiom”Mind acts upon mind”.Each of them will choose a place inside the house to ensure that is the shortest distance between them。(Their houses are both rectangles)

Now the QGG wants to know the shortest distance.He will ask you to help him to calculate it.

(Definition of distance:the shortest distance of two points,with one point inside or on the edge of one rectangle and the other point inside or on the edge of the other rectangle.The egdes of rectangles are parallel to the axis.Get more information from the example.)

Input

The first line contains an integer N(N<10),indicating the number of test cases. Each test case contains two descriptions of the two rectangles,each with four integers,Xa,Ya,Xb,and Yb(-1000

In each test case,two rectangles won't overlap,contain or touch each other. Output

the shortest distance of the two rectangles with4digits after the decimal point

Sample Input

2

0011

3322

0021

3224

Sample Output

1.4142

1.0000

1003.Fengsensei的DOTA

题目描述

众所周知，Fengsensei是每天泡在图书馆的一个学霸，但是Fengsensei偶尔也会玩游戏来放松一下自己，Fengsensei最近迷上了DOTA，我们将模型简化如下，DOTA游戏分为两个阵营，天灾军团和近卫军团，Fengsensei出于奇怪的正义感每次都在近卫军团里，每次双方都会从一堆英雄中选出5名英雄来作战，每个英雄在游戏中只会出现一个，Fengsensei发现他能够知道每名英雄的战斗力，并且总是英雄战斗力之和高的一方会获胜，如果战斗力之和相等，Fengsensei所在的一方会获胜，现在，给你一个英雄的列表和近卫天灾的5名英雄，你能帮Fengsensei判断最终哪方会胜利么。

输入格式

输入第一行一个整数T，代表测试数据的组数

接下来T组测试数据

每组测试数据第一行一个整数M（10<=M<100）代表英雄的总数。

接下来M行，每行为一个字符串s和一个整数Ai（|Ai|<100）,其中字符串s仅由大写字母和小写字母组成，长度不超过30,代表英雄的名字，Ai代表英雄的战斗力。

接下来一行为5个字符串s11,s12,s13,s14,s15。代表近卫军团选择的5个英雄。接下来一行为5个字符串s21,s22,s23,s24,s25。代表天灾军团选择的5个英雄

输出格式

对于每组测试数据，输出一行,如果Fengsensei能够获胜输出"YES",否则输出"NO

Sample Input

1

10

Sharpeye-5

Rigwarl20

Mangix20

Bradwarden10

Gondar15

Zeus5

Morphling5

Sven15

Slithice15

Nortrom5

Sharpeye Rigwarl Mangix Bradwarden Gondar

Zeus Morphling Sven Slithice Nortrom

Sample Output

YES

Single’’s Day

1004.Poor man on the Single

Description:

The Galapagos Islands are a nature lover's paradise.Isolated from the mainland for thousands of years,some of the most unusual species in the world evolved here,including giant tortoises,marine iguanas,blue-footed boobies,and even the world's only equatorial penguin.The islands comprise the Galapagos National Park and were recently named a"World Heritage Site".

On such a mysterious and beautiful island,there is a happy party in TIC.All the guys in this party are in pairs except one poor man.On the Single’s Day,can you help me find out this poor man?

Every guy in the tribe has an id,if two guys are in pairs,they will have the same id.For example,there are five guys in the tribe,their ids are:3,9,9,3,7.It means that the man with the id7is the poor man that we want to find out.

INPUT

The first line contains a number:n(there are n guys in the tribe);0

And then there are n ids.The ids are out-of-order and in pairs except one id.0< id<=10000000

OUTPUT

The id of the poor single man.

SAMPLE INPUT

7

39933310

SAMPLE OUTPUT

10

1005.Spy OGG

Problem Description

As we all know,QGG was born in Tecent.So he is extremely loyal to Tecent.Now he is a spy of Tecent and he has finished many secret missions.In a new mission, there are many departments in a company called‘6square times10’.In each department,the relationship between staffs can be described as superior and subordinate.One person may have several subordinates but nobody has more than one superior.Of course,those who have no superior are the biggest boss in his department.QGG want to figure out whether two people are in the same department but he can’t.So he ask you,the greatest programmer all over the world,for help.Can you help him?

Input

The input contains several test cases.

The first line of each test case contains two integers N(1

The following M lines give the description of their relationship.Each line contains several non-negative integers A B C1C2C3……CB-1CB,which mean A is the superior of C1C2C3……CB-1CB.

The next line contains an integer Q(1

Each query contains one line with two integers D E.

Output

For each query,if D and E belong to the same department,print”YES”,else print”NO”.

There is an empty lines after each test cases.

Sample Input

72

2245

33216

2

01

46

94

617

041342

516

718

3

23

58

17

Sample Output

NO

YES

YES

YES

NO

1006.运动会的报名

题目描述

又到运动会的时间了，负责此次运动会报名的是小航同学。经过半个月的宣传，直到报名截止时间已经有好多好多同学报名了^_^。报名的规则是这样的：需要短信报名，短信内容是，级队名，班级，学号。现在小航同学的工作就是整理这些数据。

工作很简单，将数据排序。

已知这个学校有好多级队，首先要把这些同学按级队从小到大分好。

然后是班级，每个级队都有若干班级，要把同一级队的数据按班级号从小到大排好，但是，学校又有个特殊要求，就是这些班级中有的是日强的有的是英强的，他要把英强的排在前面日强的排在后面。

最后是学号，同一级队同一班级的同学按学号从大到小排好（注意：不是从小到大哦~）

输入格式

只有一组测试数据

第一行，是一个整数N（1<=N<=10）表示有多少个级队（级队编号是从1~N的）然后是N行按级队号从小到大的顺序给出各个级队的信息，规则如下：

第2~N+1行，先给出一个整数M（1<=M<=50），代表该级队总班级的个数，班级的编号是从1~M的，然后是若干个整数，分别表示英强班级的班级号，以0结尾。第N+2行，一个正整数K（K<=1000）。

然后的K行分别给出各个报名同学的报名短信内容，规则如下：

首先是级队号，然后是班级号，最后是学号（学号表示形式是八位的数字，并且可能以0开头和结尾：如00010200，两个人的学号也有可能是相同的）。

输出格式

按照题目描述中的方式对这些同学的信息进行排序，然后输出，每个同学的信息输出后要在下一行输出下一个学生的信息，每个学生的信息包括级队号、班级、学号。

Sample Input

3

310

31230

220

5

2300000001

1200000002

1100000003

3100000004

2100000005

Sample Output

1100000003

1200000002

2100000005

2300000001

3100000004

1007.Binary Numbers

Description

TICers all like Binary numbers.They want to know the Kth(K<=10000000) binary numbers whose sum of all‘1’digits is N(N<=10).The leading bit of each label is always a"1"bit,of course.

Input

There are several test cases

The first line,an integer T indicates the test cases.

Next T lines,two integers K,N as mentioned above.

Output

Output the Kth number in the binary number form.

Sample Input

1

73 Sample Output

10110