CSP-J T3写成这样：

#include<bits/stdc++.h>
using namespace std;
int a[15]={6,2,5,5,4,5,6,3,7,6},b[100008]={-1,-1,1,7,4,2,6,8};
void cf(int n){
	int sum=0,m=n;
	while(n>1){
		sum+=a[n%10];
		n/=10;
	}
	if(b[sum]==0){
		b[sum]=m;
	}
	return ;
}
int t,n;
int main(){
	freopen("sticks.in","r",stdin);
	freopen("sticks.out","w",stdout);
	for(int i=8;i<100001;i++){
		cf(i);
	}
	cin>>t;
	for(int i=0;i<t;i++){
		cin>>n;
		cout<<b[n]<<endl;
	}
	return 0;
}

这还有救吗？坐标FJ