p2015.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
#include <map>
#include <cmath>
using namespace std;
int main(){
    int d,x,n;
    scanf("%d",&x);
    while(x){
        string C,M,P,s;
        map<char,int> S;
        cin >> s >> P >> C;
        n = C.size();
        M.resize(n);
        for(int i = 0;i < s.size();++i)
            S[s[i]] = i;
        d = int(pow(double(n),1.5) + x) % n;
        M[d] = P[S[C[d]]];
        char ch(M[d]);
        for(int i = (d-1+n) % n;i != d;i = (i+n-1) % n){
            M[i] = P[S[C[i]] ^ S[ch]];
            ch = M[i];
        }
        cout << M << endl;
        scanf("%d",&x);
    }
}