New Maths

New Maths

解题思路：搜索。

#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<ll,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 5e2+10;
const ull base = 131;
const ll mod =  1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-4;

inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){str+=s;s=getchar();}return str;}
int random(int n){return (int)(rand()*rand())%n;}
void writestring(string s){int n = s.size();for(int i = 0;i < n;i++){printf("%c",s[i]);}}
ll fast_power(ll a,ll p){
    ll ans = 1;
    while(p){
        if(p&1) ans = (ans*a)%mod;
        p >>= 1;
        a = (a*a)%mod;
    }
    return ans;
}


char s[N];
int a[N];
int n,m;
int flag = 0;

void dfs(int k,int ans[]){
    if(flag) return;
    if(k == n+1){
        flag = 1;
        while(k>=1&&ans[k]==0){
            k--;
        }
        for(int i = 1;i <= k;i++){
            printf("%d",ans[i]);
        }
        return;
    }
    for(int i = 0;i <= 9;i++){
        ans[k] = i;
        int num = 0;
        for(int j = 1;j <= k;j++){
            num = (num+ans[j]*ans[k+1-j])%10;
        }
        if(num == a[k]){
            dfs(k+1,ans);
        }
    }
}
int ans[N];
int main(){
    srand((unsigned)time(NULL));
    //freopen(  "out.txt","w",stdout);
    scanf("%s",s+1);
    n = strlen(s+1);
    for(int i = 1;i <= n;i++){
        a[i] = s[i]-'0';
    }
    dfs(1,ans);
    if(flag == 0){
        puts("-1");
    }
    return 0;
}