#include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define m0(x) memset(x,0,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define bg begin() #define ed end() #define all(x) x.bg,x.ed //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long int cal(int n) { return n-to_string(n).size(); } void solve() { int n; cin >> n; //増やせるのは0, 1, 2, 3, 4, 5, 6, 7, 8 //減らすのはいくらでも。 //fsum(a)-n=n-1 //f(a)=桁の数+n-1 //桁の数+n-1=sum(a) //n-1=sum(a)-桁の数 //使えるのは-9, -8, ..., 0, 1, 2, ..., INF //sum(a)-f(a)=2n-1 //要素数がnであるような物。 vi val; FOR(300) val.push_back(cal(i+1)); vi dp(n, 0); dp[0] = 1; FOR(n) { vi newdp(n, 0); rep(j, n) { for(auto e : val) { if(0<=j+e&&j+e