【扬中集训DAY2T2】 机智的AmyZhi

【题目链接】

点击打开链接

【算法】

据说标算是暴力？ 从N-200开始搜

不过我用了搜索+一些奇怪的剪枝，也A了....

【代码】

标程

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,cases;
bool check(ll x){
    ll tmp=x;
    for(int i=;i<=;i++){
        tmp+=x%;
        x/=;
    }
    if(tmp==n)return ;
    return ;
}
int main(){
        scanf("%I64d",&cases);
        int flag;
        while(cases--)
        {
            flag=;
            scanf("%I64d",&n);
            for(ll i=max(1LL,n-);i<=n;i++)
                if(check(i)){
                    printf("%I64d\n",i);
                    flag=;
                    break;
                }
            if (flag==) puts("Stupid SiriusRen");
        }
    return ;
}

我的程序

#include<bits/stdc++.h>
using namespace std;
#define MAXL 17
typedef long long LL;

LL i,j,l,T,N,len,lth,sum;
LL a[MAXL+][MAXL+],s[MAXL+][MAXL+],f[MAXL+],ans[MAXL+];
vector<LL> vec,res;
bool solved;

template <typename T> inline void read(T &x) {
    int f = ; x = ;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';
}

template <typename T> inline void write(T x) {
    if (x < ) { putchar('-'); x = -x; }
    if (x > ) write(x/);
    putchar(x%+'');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

inline void save_answer() {
    int i;
    for (i = ; i <= len; i++) res.push_back(ans[i]);
} 

inline void dfs(int dep) {
    int i,l,r;
    if (solved) return;
    if (sum > N) return;
    if (sum +  * (s[len][len] - s[len][dep-]) < N) return;
    if (dep > len) {
        if (sum == N) {
            solved = true;
            save_answer();
        }
    } else {
        l = ; r = ;
        if (dep == ) l = ;
        for (i = l; i <= r; i++) {
            if (solved) break;
            if (sum + a[len][dep] * i <= N) {
                sum += a[len][dep] * i;
                ans[++lth] = i;
                dfs(dep+);
                sum -= a[len][dep] * i;
                --lth;
            }
        }
    }
}

void print() {
    int i;
    for (i = ; i < res.size(); i++) write(res[i]);
    cout<<endl;
}

int main() {

    freopen("amy.in","r",stdin);
    freopen("amy.out","w",stdout);

    f[] = ;
    for (i = ; i <= MAXL; i++) f[i] = (f[i-] << ) + (f[i-] << );
    for (i = ; i <= MAXL; i++) {
        a[i][i] = ;
        for (j = i - ; j >= ; j--) {
            a[i][j] = f[i-j] + ;
        }
    }
    for (i = ; i <= MAXL; i++) {
        for (j = ; j <= MAXL; j++) {
            s[i][j] = s[i][j-] + a[i][j];
        }
    }
    read(T);
    while (T--) {
        vec.clear(); res.clear();
        solved = false;
        read(N);
        for (l = ; l <= MAXL; l++)    {
            if (s[l][l] *  < N) continue;
            if (a[l][] > N) break;
            vec.push_back(l);
        }
        for (i = ; i < vec.size(); i++) {
            lth = sum = ; len = vec[i];
            dfs();
            if (solved) break;
        }
        if (solved) print();
        else puts("Stupid SiriusRen");
    }

    return ;

}