zoj 1009

　　

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#include <string>
#include <deque>

const int N = 30;
int n,m;
string rotor[4];
string tmp;
deque<int> level[4];
deque<int> a,b,c;

void cover();
void solve();
int main()
{    
    int cas = 0;
    while(cin >> m && m){
        if(cas++)cout << endl;
        cin >> rotor[0] >> rotor[1] >> rotor[2];
        cover();
        cin >> n;
        cout << "Enigma " << cas << ':' << endl;
        while(n--){
            cin >> tmp;
            solve();
        }
    }
    return 0;
}
void cover()
{
    int x,y,offset,index;
    level[0].resize(m); level[1].resize(m); level[2].resize(m);
    for(x = 0; x < 3; ++x){
        for(y = 0; y < m; ++y){
            index = rotor[x][y] - 'A';
            offset = y - index ;        
            level[x][index] = offset;
        }    
    }
}
void solve()
{    
    a = level[0]; b = level[1]; c = level[2];    
    string txt;
    char ch;
    int k;
    int s;
    for(int i = 0; i < tmp.size(); ++i){
        ch = tmp[i];
        k = ch - 'A';

        s = (k + c[k] + m)%m;    
        k = (s + b[s] + m)%m;
        s = (k + a[k] + m)%m;        

        txt += ('a' + s);
        
        k = a.back();    a.pop_back();    a.push_front(k);//role a    

        if( (i+1) % m == 0){//role b        
            k = b.back();    b.pop_back();    b.push_front(k);            
        }
        if( (i+1) % (m*m) == 0){//role c    
            k = c.back();    c.pop_back(); c.push_front(k);            
        }
    }
    cout << txt << endl;
}