暴力模拟——cf988E

很简单的题，就是模拟一下

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a[],len;

int f(int x,int y){
    ll b[],flag=,res=;
    memcpy(b,a,sizeof a);

    int pos;
    for(int i=;i<=len;i++)
        if(b[i]==y){
            pos=i;flag=;break;
        }
    if(flag==)return 0x3f3f3f3f;
    flag=;
    for(int i=pos;i>;i--)
        swap(b[i],b[i-]),res++;

    for(int i=;i<=len;i++)
        if(b[i]==x){
            pos=i;flag=;break;
        }
    if(flag==)return 0x3f3f3f3f;
    flag=;
    for(int i=pos;i>;i--)
        swap(b[i],b[i-]),res++;

    if(b[len]==){
        for(int i=len-;i>=;i--)
            if(b[i]!=){
                pos=i;flag=;break;
            }
        if(flag==)return 0x3f3f3f3f;
        for(int i=len;i>pos;i--)
            swap(b[i],b[i-]),res++;
    }

    return res;
}

int main(){
    cin>>n;
    while(n){
        a[++len]=n%;
        n/=;
    }
    int ans=0x3f3f3f3f;
    ans=min(ans,f(,));
    ans=min(ans,f(,));
    ans=min(ans,f(,));
    ans=min(ans,f(,));
    if(ans!=0x3f3f3f3f)
        cout<<ans;
    else cout<<-;
}