850 - Crypt Kicker II
Time limit: 3.000 seconds
Crypt Kicker II
| Crypt Kicker II |
A common but insecure method of encrypting text is to permute the letters of the alphabet. That is, in the text, each letter of the alphabet is consistently replaced by some other letter. So as to ensure that the encryption is reversible, no two letters are replaced by the same letter.
A common method of cryptanalysis is the known plaintext attack. In a known plaintext attack, the cryptanalist manages to have a known phrase or sentence encrypted by the enemy, and by observing the encrypted text then deduces the method of encoding.
Your task is to decrypt several encrypted lines of text, assuming that each line uses the same set of replacements, and that one of the lines of input is the encrypted form of the plaintext
the quick brown fox jumps over the lazy dog
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
The input consists of several lines of input. Each line is encrypted as described above. The encrypted lines contain only lower case letters and spaces and do not exceed 80 characters in length. There are at most 100 input lines.
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
Decrypt each line and print it to standard output. If there is more than one possible decryption (several lines can be decoded to the key sentence), use the first line found for decoding.
If decryption is impossible, output a single line:
No solution.
Sample Input
1 vtz ud xnm xugm itr pyy jttk gmv xt otgm xt xnm puk ti xnm fprxq xnm ceuob lrtzv ita hegfd tsmr xnm ypwq ktj frtjrpgguvj otvxmdxd prm iev prmvx xnmq
Sample Output
now is the time for all good men to come to the aid of the party the quick brown fox jumps over the lazy dog programming contests are fun arent they
'ACM' 카테고리의 다른 글
| [Accept] 100 - The 3n+1 problem (0) | 2009.06.02 |
|---|---|
| 10006 - Carmichael Numbers (0) | 2009.06.02 |
| 10039 - Railroads (0) | 2009.06.02 |
| 10110 - Light, more light (0) | 2009.06.02 |
| 10132 - File Fragmentation (0) | 2009.06.02 |
Problem A: Railroads
| Problem A: Railroads |
Background
It's Friday evening and Jill hates two things which are common to all trains:- 1.
- They are always late.
- 2.
- The schedule is always wrong.
Nevertheless, tomorrow in the early morning hours Jill will have to travel from Hamburg to Darmstadt in order to get to the regional programming contest. Since she is afraid of arriving too late and being excluded from the contest she is looking for the train which gets her to Darmstadt as early as possible. However, she dislikes to get to the station too early, so if there are several schedules with the same arrival time then she will choose the one with the latest departure time.
Problem
Jill asks you to help her with her problem. You are given a set of railroad schedules from which you must compute the train with the earliest arrival time and the fastest connection from one location to another. One good thing: Jill is very experienced in changing trains. She can do this instantaneously, i.e., in zero time!!!Input
The very first line of the input gives the number of scenarios. Each scenario consists of three parts.Part one lists the names of all cities connected by the railroads. It starts with a number 
, followed by C lines containing city names. These names consist of letters.
Part two describes all the trains running during a day. It starts with a number 
followed by T train descriptions. Each of them consists of one line with a number 
and ti more lines with a time and a city name, meaning that passengers can get on or off the train at that time at that city.
Part three consists of three lines: Line one contains the earliest journey's starting time, line two the name of the city where she starts, and line three the destination city. The two cities are always different.
Output
For each scenario print a line containing ``Scenario i'', where i is the number of the scenario starting at 1.If a connection exists then print the two lines containing zero padded timestamps and locations as shown in the sample. Use blanks to achieve the indentation. If no connection exists on the same day (i.e., arrival before midnight) then print a line containing ``No connection''.
After each scenario print a blank line.
Sample Input
2 3 Hamburg Frankfurt Darmstadt 3 2 0949 Hamburg 1006 Frankfurt 2 1325 Hamburg 1550 Darmstadt 2 1205 Frankfurt 1411 Darmstadt 0800 Hamburg Darmstadt 2 Paris Tokyo 1 2 0100 Paris 2300 Tokyo 0800 Paris Tokyo
Sample Output
Scenario 1 Departure 0949 Hamburg Arrival 1411 Darmstadt Scenario 2 No connection
Miguel Revilla
2000-11-19
'ACM' 카테고리의 다른 글
| 10006 - Carmichael Numbers (0) | 2009.06.02 |
|---|---|
| 850 - Crypt Kicker II (0) | 2009.06.02 |
| 10110 - Light, more light (0) | 2009.06.02 |
| 10132 - File Fragmentation (0) | 2009.06.02 |
| 10099 - The Tourist Guide (0) | 2009.06.02 |
| Light, more light |
The Problem
There is man named "mabu" for switching on-off light in our University. He switches on-off the lights in a corridor. Every bulb has its own toggle switch. That is, if it is pressed then the bulb turns on. Another press will turn it off. To save power consumption (or may be he is mad or something else) he does a peculiar thing. If in a corridor there is `n' bulbs, he walks along the corridor back and forth `n' times and in i'th walk he toggles only the switches whose serial is divisable by i. He does not press any switch when coming back to his initial position. A i'th walk is defined as going down the corridor (while doing the peculiar thing) and coming back again.Now you have to determine what is the final condition of the last bulb. Is it on or off?
The Input
The input will be an integer indicating the n'th bulb in a corridor. Which is less then or equals 2^32-1. A zero indicates the end of input. You should not process this input.The Output
Output "yes" if the light is on otherwise "no" , in a single line.Sample Input
3 6241 8191 0
Sample Output
no yes no
Sadi Khan
Suman Mahbub
01-04-2001
'ACM' 카테고리의 다른 글
| 850 - Crypt Kicker II (0) | 2009.06.02 |
|---|---|
| 10039 - Railroads (0) | 2009.06.02 |
| 10132 - File Fragmentation (0) | 2009.06.02 |
| 10099 - The Tourist Guide (0) | 2009.06.02 |
| 10004 - Bicoloring (0) | 2009.06.02 |