思路:
可以dp[i]代表i根火柴正好能合成多少种数字,也可以dp[i][j]表示以i开头用了j根火柴能合成多少种合法数字。
前一种方法最后要减去 ,意思是减去所有以0开头的。
最后,结果非常大,需要用大数进行运算。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vll;
const int MAXN = 1e6 + 10;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int p[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int n, m, k;
vector<string> dp, sum;
string add(string a, string b){
if(a.length() > b.length())
swap(a, b);
for(int u = 0, v = a.length() - 1; u < v; u++, v--)
swap(a[u], a[v]);
for(int u = 0, v = b.length() - 1; u < v; u++, v--)
swap(b[u], b[v]);
int carry = 0;
string res;
for(int i = 0; i < (int)a.length(); i++){
res.push_back((a[i] - '0' + b[i] - '0' + carry) % 10 + '0');
carry = (a[i] - '0' + b[i] - '0' + carry) / 10;
}
for(int i = a.length(); i < (int)b.length(); i++){
res.push_back((b[i] - '0' + carry) % 10 + '0');
carry = (b[i] - '0' + carry) / 10;
}
if(carry)
res.push_back(carry + '0');
for(int u = 0, v = res.length() - 1; u < v; u++, v--)
swap(res[u], res[v]);
return res;
}
bool smaller(const string &a, const string &b){
if(a.length() == b.length())
return a < b;
return a.length() < b.length();
}
string Minus(string a, string b){
string res;
if(smaller(a, b)){
res.push_back('-');
swap(a, b);
}
for(int u = 0, v = a.length() - 1; u < v; u++, v--)
swap(a[u], a[v]);
for(int u = 0, v = b.length() - 1; u < v; u++, v--)
swap(b[u], b[v]);
int carry = 0;
for(int i = 0; i < (int)b.length(); i++){
int borrow = 0;
while(a[i] + borrow * 10 - carry - b[i] < 0)
borrow++;
res.push_back(a[i] + borrow * 10 - carry - b[i] + '0');
carry = borrow;
}
for(int i = b.length(); i < (int)a.length(); i++){
int borrow = 0;
while(a[i] + borrow * 10 - '0' - carry < 0)
borrow++;
res.push_back(a[i] + borrow * 10 - '0' - carry + '0');
carry = borrow;
}
for(int u = isdigit(res.front()) ? 0 : 1, v = (int)res.length() - 1; u < v; u++, v--)
swap(res[u], res[v]);
for(int i = 0; i < (int)res.length() - 1; ){
if(!isdigit(res[i])){
i++;
continue;
}
if(res[i] - '0')
break;
res.erase(res.begin() + i);
}
return res;
}
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
dp.resize(2000 + 1, "0");
for(int i = 0; i < 10; i++)
dp[p[i]] = add(dp[p[i]], "1");
for(int i = 0; i <= 2000; i++)
for(int j = 0; j < 10; j++)
if(i + p[j] <= 2000)
dp[i + p[j]] = add(dp[i + p[j]], dp[i]);
sum.resize(2000 + 1, "0");
for(int i = 1; i <= 2000; i++)
sum[i] = add(sum[i - 1], dp[i]);
while(cin >> n){
string res = sum[n];
if(n >= p[0])
res = Minus(res, sum[n - p[0]]);
cout << res << endl;
}
cerr << "execute time : " << (double)clock() / CLOCKS_PER_SEC << endl;
return 0;
}
未来可期。