n a^o7 !——栈

Think:
1知识点：栈

SDUT题目链接

以下为Accepted代码

#include <bits/stdc++.h>

using namespace std;

char st[104];

int main(){
    stack<char> s1;
    int T;
    scanf("%d", &T);
    getchar();
    for(int k = 1; k <= T; k++){
        while(!s1.empty()){
            s1.pop();
        }
        gets(st);
        int len = strlen(st);
        for(int i = 0; i < len; i++){
            if(st[i] == 'n')
                s1.push('u');
            else if(st[i] == ' ')
                s1.push(' ');
            else if(st[i] == '5')
                s1.push('s');
            else if(st[i] == '!')
                s1.push('i');
            else if(st[i] == 'w')
                s1.push('m');
            else if(st[i] == 'p')
                s1.push('d');
            else if(st[i] == 'u')
                s1.push('n');
            else if(st[i] == 'e')
                s1.push('a');
            else if(st[i] == 'a')
                s1.push('e');
            else if(st[i] == '^')
                s1.push('v');
            else if(st[i] == 'o')
                s1.push('o');
            else if(st[i] == '7')
                s1.push('l');
        }
        printf("Case %d: ", k);
        while(!s1.empty()){
            printf("%c", s1.top());
            s1.pop();
        }
        printf("\n");
    }
    return 0;
}


/***************************************************
User name: 
Result: Accepted
Take time: 0ms
Take Memory: 252KB
Submit time: 2017-07-14 11:12:55
****************************************************/