2026-10-15 21:31:15
发布于：广东
0阅读
0回复
0点赞
#include <bits/stdc++.h>
#include <tuple>
using namespace std;
typedef long long ll;
const ll N=1e6+10;
const ll M=5050;
ll t,n;
ll zhi[10]={6,2,5,5,4,5,6,3,7,6};
bool check(ll a){
ll need=0;
while(a){
ll b=a%10;
a/=10;
need+=zhi[b];
}
return need==n;
}
int main(){
cin>>t;
while(t--){
ll ans=-1;
cin>>n;
ll maxn=1;
for(ll i=1;i<=ceil(n*1.0/2);i++){
maxn=maxn<<1;
maxn+=1;
}
for(ll i=0;i<=maxn;i++){
if(check(i)){
ans=i;
break;
}
}
cout<<ans<<'\n';
ans=-1;
}
return 0;
}
这里空空如也
有帮助，赞一个