Poj 2141 message decowding)

[Description]: The description of this question is very simple and will not be repeated.

[Analysis]: directly regard the input character as the subscript of the key value array.

// 164 K 16 Ms # include <iostream> using namespace STD; char key [27]; char decoded [81]; int main () {gets (key ); gets (decoded); For (INT I = 0; I <strlen (decoded); I ++) {If (decoded [I]> = 'A' & decoded [I] <= 'Z ') cout <char (Key [decoded [I]-'a']-'A' + 'A '); else if (decoded [I]> = 'A' & decoded [I] <= 'Z') cout <key [decoded [I]-'a']; elsecout <decoded [I];} return 0 ;}

Poj 2141 message decowding)