非常像 DP 背包的概念,才知道這概念其實有衍生到排列組合上
參考:http://blog.sina.com.cn/s/blog_77dc9e080101hx8j.html
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
class bignum{
public:
int n\[200\];
const static int maxn=200;
const static int base\=10000;
bignum(){
Set(n,0);
}
bignum operator\=(int num){
n\[0\]=num;
return \*this;
}
bignum operator+=(bignum &d){
int c=0;
for(int i=0;i<maxn;i++){
int tmp=d.n\[i\]+n\[i\]+c;
n\[i\]=tmp%base;
c=tmp/base;
}
return \*this;
}
void print(){
int i=maxn-1;
for(;i>0;i--)
if(n\[i\])break;
printf("%d",n\[i--\]);
for(;i>=0;i--){
printf("%04d",n\[i\]);
}Pln();
}
};
int x\[10\]={6,2,5,5,4,5,6,3,7,6};
int m;
bignum one;
bignum dp\[2100\];
void pre(){
one=1;
for(int i=1;i<10;i++){
dp\[x\[i\]\]+=one;
}
for(int i=1;i<2005;i++){
for(int j=0;j<10;j++){
dp\[x\[j\]+i\]+=dp\[i\];
}
}
dp\[6\]+=one;
for(int i=1;i<2005;i++){
dp\[i\]+=dp\[i-1\];
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
pre();
while(~scanf("%d",&m)){
dp\[m\].print();
}
}