#include <bits/stdc++.h>
using namespace std;
int a[10]={6,2,5,5,4,5,6,3,7,6};
int numbers[2201]={0};
int gt(int n){
if (!n)return a[0];
int res=0;
while (n){res+=a[n%10];n/=10;}
return res;
}
int main() {
int n,sum=0;
scanf("%d",&n);
n-=4;
for (int i = 0; i <=1100 ; ++i) {
if (numbers[i]==0)
numbers[i]=gt(i);
for (int j = 0; j <=1100 ; ++j) {
if (numbers[j]==0)
numbers[j]=gt(j);
if (numbers[i+j]==0)
numbers[i+j]=gt(i+j);
if (numbers[i]+numbers[j]+numbers[i+j]==n)
sum++;
}
}
cout<<sum<<endl;
return 0;
}
P1149 火柴棒等式
最新推荐文章于 2020-02-11 22:52:22 发布