谁来帮忙看一下这个题错在哪里？

Winter_moon

Cryptoquote

- F: X; v8 j& O9 _' ~8 g: o7 k
9 |* J" y8 r3 c5 C( ^0 ATime Limit: 1000 ms Memory Limit: 65536 kB
* w& n% P2 {: |; n# LSolved: 79 Tried: 281
' A$ X# n3 N3 E' L
4 h1 u7 I$ n6 D, sDescription
: Y- |. t( Q, t+ @2 y8 \. v$ D' QA cryptoquote is a ** encoded message where one letter is simply replaced by another throughout the message. For example:

, R9 y% z7 e: \$ y" g  \Encoded: HPC PJVYMIY
Decoded: ACM CONTEST
% E: V0 Q' {  ~. I
In the example above, H=A, P=C, C=M, J=O, V=N, Y=T, M=E and I=S. For this problem, you will decode messages.

* E, S9 ?; m7 }  ]7 J4 m
Input
The first line of input contains a single integer N,(1<=N<=1000) which is the number of data sets that follow. Each data set consists of two lines of input. The first line is the encoded message. The second line is a 26 character string of upper case letters giving the character mapping for each letter of the alphabet: the first character gives the mapping for A, the second for B and so on. Only upper case letters will be used. Spaces may appear in the encoded message, and should be preserved in the output string.


( k- s. e& _+ Y4 M- Z
6 k1 O. M$ W, g/ r1 ~+ _6 SOutput
! }" \& G) F, xFor each data set, you should generate one line of output with the following values: The data set number as a decimal integer (start counting at one), a space and the decoded message.
5 a( K& r7 {) K+ h8 `

" M1 ?! U- E  Z6 r) ]: ?% @$ u1 [Sample Input
2
HPC PJVYMIY
! y% h: X, ~' W/ X. jBLMRGJIASOPZEFDCKWYHUNXQTV
FDY GAI BG UKMY
KIMHOTSQYRLCUZPAGWJNBVDXEF
' g- d% X! L; e& e
! ^( U9 v5 k8 }+ E- D+ ~' q

Sample Output
1 ACM CONTEST
2 THE SKY IS BLUE


- z  U2 L2 p0 K$ |: o5 ~3 c  Q3 |
; Y) Y* `4 ^1 Y; z  z我的代码是：
#include<stdio.h>
: c) g) ^3 o4 J" z0 A$ Z#include<string.h>
int main()
+ h* ?4 u( H2 W6 k; x- Q( p# v{
8 Y2 J/ g7 t! Z7 s/ D3 b# C     int N,i,j,k;
     char c;
     char code[1000];
     char map[27];
     char trans[1000];
( b% S7 _7 c7 y' g     char wrong[3];
     scanf("%d",&N);
     gets(wrong);
     int h=1;
& m7 C! F, n3 j# h8 B) n     while(N--)
     {
* r) Z: l$ C; t+ X# _         gets(code);
: I" K- ~* P1 b6 A7 G         gets(map);
1 `. x$ }3 W& U9 y& ]- m& ^3 P3 Z         for(i=0;((c=code[i])!='\0');i++)
0 h' Y) t7 G: ?& j5 `         {
             if(c==' ')trans[i]=' ';
             else {j=code[i]-'A';
             trans[i]=map[j];}       }
         printf("%d ",h);
. I: m4 X; G5 X8 ?         for(i=0;((k=trans[i]<=90)&&(k=trans[i]>=65)||(k=trans[i]==' '));i++)
         printf("%c",trans[i]);
         h++;
! D. B, j4 P# c$ h         printf("\n");
     }
     return 0;
% J1 V" i2 @: g  Y) ^" P2 T}


+ C3 ]6 J2 p& t5 n! i9 G样例过了，但是提交答案的时候还是wrong answer。是哪里有陷阱？

huangliao6252

int h=1;这个定义应该在 scanf("%d",&N);前面。

_我还活着

没有看懂.....

linmatsas

C………………………………

葉_浅浅

.....................

zjqylcy

把答案也附上来吗。。。
是不是k是int型？