提交记录

代码：

#include<bits/stdc++.h>
using namespace std;
#define _________ <<
#define _ for(long long i=(0);i<(n);i++)
#define __ for(long long i=(1);i<=(n);i++)
#define ___ for(long long j=(0);j<=(5);j++)
#define _____ for(long long i=(1);i<=(9);i++)
#define ______ for(long long i=(n);i>=(1);i--)
#define ____ long
#define ________ cout
#define ______________ cin
#define _______________ >>
#define ________________ "\n"
#define __________________ 10000000000009
#define ___________________ 100009
#define ____________________ 9
#define _____________________ 1
____ ____ _______=__________________;
____ ____ dp[___________________][____________________];
____ ____ anke2017_AK_IOI_times,n,a[___________________],t,val[10],times[____________________]={_____________________,_____________________*(____________________+_____________________),100,1000,10000,100000};
string s;
signed main(){
	______________ _______________ anke2017_AK_IOI_times _______________ t;
	times[2]=_____________________*(____________________+_____________________);
	times[3]=(_____________________*(____________________+_____________________))*(____________________+_____________________);
	times[4]=((_____________________*(____________________+_____________________))*(____________________+_____________________))*(____________________+_____________________);
	times[5]=(((_____________________*(____________________+_____________________))*(____________________+_____________________))*(____________________+_____________________))*(____________________+_____________________);
	while(t--){
		____ ____ __________=_______;
		______________ _______________ s;
		n=s.length();
		_ a[i+_____________________]=(____ ____)(s[i]-'0');
		__ ___	dp[i][j]=_______;
		dp[n+_____________________][_____________________-_____________________]=_____________________-_____________________;
		_____ ______________ _______________ val[i];
		______{
			___{
				dp[i][j]=min(dp[i+_____________________][j]+val[a[i]],dp[i][j]);
				dp[i][j+_____________________]=min(dp[i+_____________________][j]+a[i]*times[j],dp[i][j+_____________________]);
			}
		}
		___ __________=min(__________,dp[_____________________][j]);
		________ _________ __________ _________ ________________;
	}
	return 0;
}