Winter Training Diary (Fri)--Midterm quiz

10 questions, a 4 road, 5 will do, 5 will not, sure enough slag slag ...

This quiz feels an infinite segment error. One is the initialization of the problem, but also a contribution to the process of error, but still do not know where the wrong. First attach a few words not a problem, later slowly solve.

B-TopologyTime limit:2000MS Memory Limit:262144KB 64bit IO Format:%i64d &%I 64u Submit Status Practice codeforces 510C

Description

Fox Ciel is going to publish a paper on FOCS (Foxes operated computer Systems, pronounce: "Fox"). She heard a rumor:the authors list on the paper are always sorted in the lexicographical order.

After checking some examples, she found out of that sometimes it wasn ' t true. On some papers authors ' names weren ' t sorted in lexicographical order in normal sense. But it is always true this after some modification of the order of letters in alphabet, the order of authors becomes lexicographical!

She wants to know, if there exists a order of letters in Latin alphabet such that the names on the paper she is Submittin G is following in the lexicographical order. If So, you should find off any such order.

Lexicographical order is the defined in following. When we compare s and T, first we find the leftmost position with differing characters: s_{i ≠ tI. If There is no such position (I. E. s is a prefix of T or vice versa) the shortest string is less. Otherwise, we compare characters si and ti according To their order in alphabet.}

Input

The first line contains an integer n (1≤ n ≤100): Number of names.

Each of the following n lines contain one string name_{i (1≤| Namei|≤100), the i-th name. Each name contains only lowercase Latin letters. All names is different.}

Output

If there exists such order of letters that the given names is sorted lexicographically, output any such order as a Permut ation of characters ' a ' – ' Z ' (i. E. First output the first letter of the modified alphabet, then the second, and so on).

Otherwise output A single word "impossible" (without quotes).

Sample Input

Input

3
Rivest
Shamir
Adleman

Output

Bcdefghijklmnopqrsatuvwxyz

Input

10
Tourist
Petr
Wjmzbmr
Yeputons
Vepifanov
Scottwu
Oooooooooooooooo
Subscriber
Rowdark
Tankengineer

Output

Impossible

Input

10
Petr
Egor
Endagorion
Feferivan
Ilovetanyaromanova
Kostka
Dmitriyh
Maratsnowbear
Bredorjaguarturnik
Cgyforever

Output

Aghjlnopefikdmbcqrstuvwxyz

Input

7
Car
Care
Careful
Carefully
Becarefuldontforgetsomething
Otherwiseyouwillbehacked
Goodluck

Output

Acbdefhijklmnogpqrstuvwxyz

D-KMP Follow linksTime limit:1000MS Memory Limit:32768KB 64bit IO Format:%i64d &%i6 4u Submit Status Practice HDU 3746

Description

CC always becomes very depressed at the end of this month, he had checked his credits card yesterday, without any surprise, There is only 99.9 yuan left. He is too distressed and thinking on how to tide over the last days. Being inspired by the entrepreneurial spirit of "HDU Cakeman", he wants to sell some little things Of course, this is not a easy task.

As Christmas is around the corner, Boys be busy in choosing Christmas presents to send to their girlfriends. It is believed this chain bracelet is a good choice. However, things is isn't always so simple, as was known to everyone, girl's fond of the colorful decoration to make bracelet Appears vivid and lively, meanwhile they want to display their mature side as college students. After CC understands the girls demands, he intends to sell the chain bracelet called Charmbracelet. The Charmbracelet is made up with colorful pearls to show girls ' lively, and the most important thing are that it must be C Onnected by a cyclic chain which means the color of pearls is cyclic connected from the left to right. And the cyclic count must is more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a charmbracelet. Just like the pictrue below, this charmbracelet ' s cycle was 9 and its cyclic count is 2:

Now CC have brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make charmbracelets so th At he can save more money. But when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that's to say, a Dding to the middle is forbidden.
CC is satisfied with the ideas and ask you.

Input

The first line of the input was a single integer T (0 < T <=) which means the number of the test cases.
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there is kinds by ' a ' ~ ' Z ' Pearls of being described. The length of the string Len: (3 <= Len <= 100000).

Output

For each case, you is required to output the minimum count of pearls added to make a charmbracelet.

Sample Input

3aaaabcaabcde

Sample Output

0 2 5E-CombinationTime limit:1000MS Memory Limit:10000KB 64bit IO Format:%i64d &%i6 4u Submit Status Practice POJ 1496

Description

Encoding schemes is often used in situations requiring encryption or information storage/transmission economy. Here, we develop a simple encoding scheme, this encodes particular types of words with five or fewer (lower case) letters a s integers.

Consider the Chinese alphabet {a,b,c,..., z}. Using This alphabet, a set of valid words is to is formed that is in a strict lexicographic order. In this set of valid words, the successive letters of a word is in a strictly ascending order; That's, later letters in a valid word was always after previous letters with respect to their positions in the alphabet L ist {a,b,c,..., z}. For example,

ABC AEP GWZ

Is all valid three-letter words, whereas

AaB is Cat

is not.

For each valid word associate a integer which gives the position of the word in the alphabetized list of words. That is:

    .
    .



    .
    .


    .
    .
VWXYZ-83681

Your program was to read a series of input lines. Each of the input line would have a single word on it, which would be the from one to five letters long. For each word read, if the word is invalid give the number 0. If The word read is valid, give the word's position index in the above alphabetical list.

Input

The input consists of a series of single words, one per line. The words is at least one letter long and no more that five letters. Only the lower case alphabetic {A, b,..., Z} characters would be used as input. The first letter of a word would appear as the first character on an input line.

The input is being terminated by End-of-file.

Output

The output is a single integer, greater than or equal to zero (0) and less than or equal 83681. The first digit of an output value should is the first character on a line. There is one line of output for each input line.

Sample Input

Zacatvwxyz

Sample Output

261083681

F-Shortest wayTime limit:1000MS Memory Limit:10000KB 64bit IO Format:%i64d &%i6 4u Submit Status Practice POJ 1062

Description

The young explorers came to an Indian tribe. There he fell in love with the chief's daughter, so he went to Qiuqin to the chief. The chief asked him to use 10,000 gold coins as a dowry to promise to marry his daughter. The explorers could not get so many gold coins that they asked the chief to lower their demands. The sheikh said, "Well, if you can get me the piao of the high priest, I can just have 8000 gold." If you can get his crystal ball, then just 5000 gold. The explorer ran to the high priest and demanded Piao or a crystal ball, and the high priest asked him to change it with gold coins, or to get other things for him, he could lower the price. The explorers then ran to other places, and others made similar demands, either by exchanging coins directly or by finding something else to lower the price. But there's no need for explorers to change things with a variety of things, because they won't get a lower price. Explorers now need your help so that he can marry his sweetheart with the least amount of gold. And what he's going to tell you is that in this tribe, hierarchy is very strong. No direct contact will be made between two persons with a status gap exceeding a certain limit, including transactions. He is a foreigner, so he can not be subject to these restrictions. But if he trades with a lower-level person, the higher-status person will not trade with him, they think it is indirect contact and vice versa. So you need to give him the best plan after considering all the circumstances.
For the sake of convenience, we numbered all items starting from 1, and the chief's promise was also regarded as an item, and the number was always 1. Each item has a corresponding price p, the host's status level L, as well as a series of alternatives ti and the replacement of the corresponding "preferential" Vi. If the difference in status between the two people exceeds m, it cannot be "indirectly traded". You have to figure out how much gold the adventurer needs at least to marry the chief's daughter.

Input

The input first line is two integers m,n (1 <= N <= 100), which in turn represents the status level gap limit and the total number of items. Next, according to the number from small to large in order to give a description of n items. The description of each item begins with three nonnegative integers p, L, X (x < N), which in turn indicate the price of the item, the rank of the host, and the total number of substitutes. The next x row contains two integers t and V, each representing the replacement number and the "preferential price".

Output

Output the minimum number of coins required.

Sample Input

1 410000 3 22 80003 50001000 2 14 2003000 2 14 20050 2 0

Sample Output

5250

H-Shortest circuit difficultTime limit:2000MS Memory Limit:32768KB 64bit IO Format:%i64d &%i6 4u Submit Status Practice HDU 4370

Description

Given a n*n matrix C ij (1<=i,j<=n), We want to find a n*n matrix X ij (1<=i,j<=n), which is 0 or 1.

Besides,x IJ meets the following conditions:

1.X 12+x 13+ ... X 1n=1
2.X 1n+x 2n+ ... X N-1n=1
3.for each I (1<i<n), Satisfies∑x ki (1<=k<=n) =∑x ij (1<=j<=n).

For example, if N=4,we can get the following equality:

X 12+x 13+x 14=1
X 14+x 24+x 34=1
X 12+x 22+x 32+x 42=x 21+x 22+x 23+x 24
X 13+x 23+x 33+x 43=x 31+x 32+x 33+x 34

Now, we want to know the minimum of∑c ij*x ij (1<=i,j<=n) can get.
Hint
For sample, x 12=x 24=1,all and other x ij is 0.

Input

The input consists of multiple test cases (less than).
For each test case, the first line contains one integer n (1<n<=300).
The next n lines, for each lines, each of which contains n integers, illustrating the matrix C, the j-th integer on i-th l INE is C ij (0<=c ij<=100000).

Output

For each case, the output of the minimum of∑c ij*x ij you can get.

Sample Input

41 2 4 102 0 1 12 2 0 56 3 1 2

Sample Output

3

Hint

12

24

Ij

I-MANACHER+DPTime limit:1000MS Memory Limit:32768KB 64bit IO Format:%i64d &%i6 4u Submit Status Practice HDU 4513

Description

Gill again came up with a new perfect formation game!
Suppose there are n individuals standing in front of him in order, their height is h[1], h[2] ... h[n], Gill want to pick out some people, let these people form a new formation, the new formation if meet the following three points requirements, is the new perfect formation:

1, the selected person maintains the relative order of the original formation, and must be in the original formation of continuous;
2, symmetrical, false with m personal formation of a new form, then the 1th person and the personal height of the same, 2nd person and the first m-1 personal height is the same, and so on, of course, if M is odd, the middle of the person can be arbitrary;
3, from the left to the middle of the person, the height should be guaranteed not to decline, if the height of the new formation with H, then h[1] <= h[2] <= h[3] .... <= H[mid].

Now Gill want to know: How many people can be selected to form a new perfect formation?

Input

The first line of input data contains an integer t, indicating that there is a total of T-Group test data (T <= 20);
Each set of data is first an integer n (1 <= n <= 100000), representing the number of people in the original formation, followed by a line of n integers, indicating the height of the person standing from left to right in the original formation (<= H <= 250, not ruled out particularly short and tall).

Output

Please output the maximum number of people that make up the perfect formation, one row for each set of outputs.

Sample Input

2351 52 51451 52 52 51

Sample Output

34

Winter Training Diary (Fri)--Midterm quiz