Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:262144KB |
Total submit users: 20, Accepted users: 16 |
Problem 12906 : Special judge |
Problem description |
You are in a computer security business. Recently one of your clients developed a new test designed to separate humans from programs. Your task is to test its efficiency. |
Input |
The input file consists of ten lines, containing ten numbers each. Each number represents the round at which the corresponding cell will be shot. All numbers are distinct and belong to the range 1...100. |
Output |
Output the optimal ship arrangement for the battleship test. Empty cells should be represented by the dot (‘.’), occupied cells should by represented by the number sign (‘#’). |
Sample Input |
1 2 3 4 5 6 7 8 9 10 36 37 38 39 40 41 42 43 44 11 35 64 65 66 67 68 69 70 45 12 34 63 84 85 86 87 88 71 46 13 33 62 83 96 97 98 89 72 47 14 32 61 82 95 100 99 90 73 48 15 31 60 81 94 93 92 91 74 49 16 30 59 80 79 78 77 76 75 50 17 29 58 57 56 55 54 53 52 51 18 28 27 26 25 24 23 22 21 20 19 |
Sample Output |
...####... .......... #....##... #.#.....#. ........#. ...###.... .#........ ........#. ..#.....#. .....#..#. |
Problem Source
|
Battleship
最新推荐文章于 2022-10-24 11:10:06 发布