UVa 10222 Decode the Mad man

方法很.......

#include<stdio.h>
#include<string.h>

int main(void)
{
  char ch[1000];

  while (fgets(ch, 999, stdin) != NULL) {
    for (int i = 0; i < strlen(ch); i++) {
      if (ch[i] >= 'A' && ch[i] <= 'Z') {
        ch[i] = ch[i] + 32;
      }
      switch (ch[i]) {
        case 'b':ch[i] = 'c';break;
        case 'c':ch[i] = 'z';break;
        case 'd':ch[i] = 'a';break;
        case 'e':ch[i] = 'q';break;
        case 'f':ch[i] = 's';break;
        case 'g':ch[i] = 'd';break;
        case 'h':ch[i] = 'f';break;
        case 'i':ch[i] = 'y';break;
        case 'j':ch[i] = 'g';break;
        case 'k':ch[i] = 'h';break;
        case 'l':ch[i] = 'j';break;
        case 'm':ch[i] = 'b';break;
        case 'n':ch[i] = 'v';break;
        case 'o':ch[i] = 'u';break;
        case 'p':ch[i] = 'i';break;
        case 'r':ch[i] = 'w';break;
        case 't':ch[i] = 'e';break;
        case 'u':ch[i] = 't';break;
        case 'v':ch[i] = 'x';break;
        case 'y':ch[i] = 'r';break;
        case '[':ch[i] = 'o';break;
        case ']':ch[i] = 'p';break;
        case ';':ch[i] = 'k';break;
        case '\'':ch[i] = 'l';break;
        case ',':ch[i] = 'n';break;
        case '.':ch[i] = 'm';break;
      }
      printf("%c", ch[i]);
    }
  }
  return 0;
}