题目:https://www.hrbustacm.com/web/problem.php?id=1360
代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int maps[11]= {6,2,5,5,4,5,6,3,7,6};
int rt[11112];
int judge(int k)
{
int ans=0;
if(k==0)
return 6;
while(k)
{
ans=ans+maps[k%10];
k=k/10;
}
return ans;
}
int main()
{
for(int i=0; i<=1000; i++)
rt[i]=judge(i);
int n;
while(~scanf("%d",&n))
{
if(n<13)
{
printf("0\n");
continue ;
}
n=n-4;
int temp=0;
for(int i=0; i<=1000; i++)
{
for(int j=0; j<=1000; j++)
{
if(rt[i]+rt[j]+rt[i+j]==n&&rt[i+j]!=0)
{
//printf("%d %d %d\n",rt[i],rt[j],rt[i+j]);
//printf("%d %d %d\n",i,j,i+j);
temp++;
}
}
}
printf("%d\n",temp);
}
}
/*
24 23 221
128 88 65
*/