Ultraviolet A Problem Solution: 850-crypt kicker II

This problem is much easier than its brother, "843-crypt Kicker ". just find the key line and get the translate table from it will do all the job. I generate a "signature" for the key line to make the search easier. by the way, pay attention to blank line cases.

Code:

1. /*************************************** **********************************
2. * Copyright (c) 2008 by liukaipeng *
3. * Liukaipeng at gmail dot com *
4. **************************************** *********************************/
6. /* @ Judge_id 00000 850 C ++ "crypt kicker II "*/
8. # Include <cstring>
9. # Include <iostream>
10. # Include <fstream>
11. # Include <string>
12. # Include <vector>
14. Using namespace STD;
15.  
16. Int const linecount = 1500;
17. Int const linesize = 100;
18. Int const ncharacters = 128;
20. Char key [] = "The quick brown fox jumps over the lazy dog ";
21. Int const keysize = sizeof (key );
22. Int keysig [keysize];
24. Bool decrypt (char lines [] [linesize], char texts [] [linesize], int nlines)
25. {
26. /* Find the key line first */
27. Char trans [ncharacters] = {0 };
28. Bool found = false;
29. For (INT I = 0; I <nlines; ++ I ){
30. Int table [ncharacters] = {0 };
31. Table ['/0'] =-1;
32. Table [''] =-2;
33. Int S = 1;
34. Int J;
35. For (j = 0; j <keysize; ++ J ){
36. If (Table [lines [I] [J] = 0 ){
37. Table [lines [I] [J] = s ++;
38. }
39. If (Table [lines [I] [J]! = Keysig [J]) {
40. Break;
41. }
42. }
43. If (j = keysize) {/* We 've found it */
44. For (j = 0; j <keysize; ++ J ){
45. Trans [lines [I] [J] = Key [J];
46. }
47. Found = true;
48. Break;
49. }
50. }
51. If (found ){
52. For (INT I = 0; I <nlines; ++ I ){
53. For (Int J = 0; lines [I] [J]! = '/0'; ++ J ){
54. Texts [I] [J] = trans [lines [I] [J];
55. }
56. }
57. }
58. Return found;
59. }
61. Int main (INT argc, char * argv [])
62. {
63. # Ifndef online_judge
64. Filebuf In, out;
65. Cin. rdbuf (in. Open (string (argv [0]) + ". In"). c_str (), ios_base: In ));
66. Cout. rdbuf (out. Open (string (argv [0]) + ". Out"). c_str (), ios_base: Out ));
67. # Endif
69. Int table [ncharacters] = {0 };
70. Table ['/0'] =-1;
71. Table [''] =-2;
72. Int S = 1;
73. For (INT I = 0; I <keysize; ++ I ){
74. If (Table [Key [I] = 0 ){
75. Table [Key [I] = s ++;
76. }
77. Keysig [I] = table [Key [I];
78. }
80. Int ncases;
81. Cin> ncases;
82. Cin. Ignore (2048, '/N'). Ignore (2048,'/N ');
83. While (ncases --> 0 ){
84. Char lines [linecount] [linesize];
85. Int nlines = 0;
86. While (CIN. Getline (lines [nlines], linesize) & lines [nlines] [0]! = '/0 '){
87. ++ Nlines;
88. }
89. If (nlines = 0 ){
90. Cin. Ignore (2048, '/N ');
91. Cout <"no solution./N ";
92. } Else {
93. Char texts [linecount] [linesize] = {0 }};
94. If (decrypt (lines, texts, nlines )){
95. For (INT I = 0; I <nlines; ++ I ){
96. Cout <texts [I] <'/N ';
97. }
98. } Else {
99. Cout <"no solution./N ";
100. }
101. }
102. If (ncases> 0) cout <'/N ';
103. }
105. Return 0;
106. }
107.