Combination Lock

链接

分析：在无限改之后终于过了，里面要处理的细节比较多，最后可以抽象成字符串，用set来去重

/*
    PROB:combo
    ID:wanghan
    LANG:C++
*/
#include "iostream"
#include "cstdio"
#include "cstring"
#include "string"
#include "vector"
#include "set"
using namespace std;
int n,num;
vector<int> Next;
set<string> h;
vector<int> p[4];
vector<int> q[4];
int a1,a2,a3,b1,b2,b3;
void init()
{
    for(int i=1;i<=n;i++)
        Next.push_back(i);
    for(int i=1;i<=n;i++)
        Next.push_back(i);
    if(Next.size()<=5){
        for(int i=1;i<=5;i++)
            Next.push_back(1);
    }
}
string Rev(int num){   //转化成字符串
    string res="";
    while(num){
        int mod=num%10;
        res+=(mod+'0');
        num/=10;
    }
    int i=0,j=res.length()-1;
    while(i<j){
        swap(res[i],res[j]);
        i++,j--;
    }
    return res;
}
void solve1(int ans,int flag){
    int pos;
    for(int i=0;i<Next.size();i++){
        if(ans==Next[i]){
            pos=i; break;
        }
    }
    if(pos<2) pos+=max(n,2);
    p[flag].push_back(Next[pos-2]);
    p[flag].push_back(Next[pos-1]);
    p[flag].push_back(Next[pos]);
    p[flag].push_back(Next[pos+1]);
    p[flag].push_back(Next[pos+2]);
    /*cout<<flag<<":"<<endl;
    for(int i=0;i<p[flag].size();i++)
        cout<<p[flag][i]<<endl;
    cout<<endl;*/
}
void solve2(int ans,int flag){
    int pos;
    for(int i=0;i<Next.size();i++){
        if(ans==Next[i]){
            pos=i; break;
        }
    }
    if(pos<2) pos+=max(2,n);
    q[flag].push_back(Next[pos-2]);
    q[flag].push_back(Next[pos-1]);
    q[flag].push_back(Next[pos]);
    q[flag].push_back(Next[pos+1]);
    q[flag].push_back(Next[pos+2]);
    /*cout<<flag<<":"<<endl;
    for(int i=0;i<q[flag].size();i++)
        cout<<q[flag][i]<<endl;
    cout<<endl;*/
}
int main()
{
    freopen("combo.in","r",stdin);
    freopen("combo.out","w",stdout);
    cin>>n;
    init();
    cin>>a1>>a2>>a3>>b1>>b2>>b3;
    solve1(a1,0);
    solve1(a2,1);
    solve1(a3,2);
    solve2(b1,0);
    solve2(b2,1);
    solve2(b3,2);
    for(int i=0;i<p[0].size();i++){
        for(int j=0;j<p[1].size();j++){
            for(int k=0;k<p[2].size();k++){
                string tt="";
                tt+=Rev(p[0][i]);
                tt+=Rev(p[1][j]);
                tt+=Rev(p[2][k]);
                h.insert(tt);
            }
        }
    }
    for(int i=0;i<q[0].size();i++){
        for(int j=0;j<q[1].size();j++){
            for(int k=0;k<q[2].size();k++){
                string yy="";
                yy+=Rev(q[0][i]);
                yy+=Rev(q[1][j]);
                yy+=Rev(q[2][k]);
                h.insert(yy);
            }
        }
    }
    set<string>::iterator it;
    /*for(it=h.begin();it!=h.end();it++)
        cout<<*it<<endl;*/
    cout<<h.size()<<endl;
    return 0;
}