程序代码：

#include<stdio.h>
#define size 20
int main()
{
    int n,m,i,k,flag;
    char a[size],b[size],c[size];
    scanf("%d",&m);
    while(m--)
    {
        scanf("%d",&n);
        flag=k=0;
        for(i=0;i<n;i++)
        {
            scanf("%s",a);
            if(a[0]=='S')
            {
                scanf("%s",b);
                if(flag%2==0)
                    c[k++]=b[0]-32;
                else if(flag%2==1)
                    c[k++]=b[0];
            }
            else if(a[0]=='C')
            {
                flag++;
                continue;
            }
            else
            {
                if(flag%2==1)
                    c[k++]=a[0]-32;
                else if(flag%2==0)
                    c[k++]=a[0];
            }
        }
        c[k]='\0';
        printf("%s\n",c);
    }
    return 0;
}

程序代码：

#include<iostream>
#include<string>
#include<ctype.h>
#include<cstdio>
using namespace std;
class Case
{
public:
    Case(int n=0);
    ~Case(){}
    void cal();
    void show(char word);
private:
    bool caps;
    bool shift;
    size_t nmLines;
};
Case::Case(int n):caps(false),shift(false)
{
    nmLines=n;
}
void Case::show(char word)
{
    if( (caps && ! shift) || (!caps && shift))
        printf("%c",toupper(word));
    else
        printf("%c",tolower(word));
}
void Case::cal()
{
    string line;
    while(nmLines--)
    {
        cin>>line;
        if( line == "Caps")
            caps=(caps==true)?false:true;
        else if( line == "Shift")
        {
            shift=true;
            char c;
            cin>>c;
            show(c);
            shift=false;
        }
        else
            show(line.c_str()[0]);
    }
}
int main()
{
    int count;
    cin>>count;
    while(count--)
    {
        int n;
        cin>>n;
        Case ca(n);
        ca.cal();
        cout<<endl;
    }
    return 0;
}