Luogu_ P1149 [noip2008 improvement group] matchstick equation_ Enumeration and tabulation

Luogu _P1149 [NOIP2008 Improvement group ] The matchstick equation _ Enumeration and tabulation

 

 

//  The meter  
#include<bits/stdc++.h>
using namespace std;

const int N=99999;
    //      0 1 2 3 4 5 6 7 8 9 10 11 12
int mp[N]={ 6,2,5,5,4,5,6,3,7,6, 8,4,7 };

void init()
{
    int i,t,sum;
    
    for( i=10;i<N;i++ )
    {
        t=i; sum=0;
        while( t ) { sum+=mp[t%10]; t/=10; }
        mp[i]=sum;
    }
}

int main()
{
	init();
    int n,i,j,k,sum,ans; 

    while( cin>>n )
    {
        for( k=0;k<=24;k++ )
        {
        	ans=0;							// pos
        	for( i=0;i<N/2;i++ )				
	            for( j=0;j<N/2;j++ )
	            {
	                sum=mp[i]+mp[j]+mp[i+j]+4;
	                if( sum==k ) ans++;
	            }
			cout<<ans<<" ";
		}
    }
    return 0;
}

//  Add comma  
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    
    while( cin>>n )
    {
        cout<<n<<",";
    }
    return 0;
}

//
#include<bits/stdc++.h>
using namespace std;

const int ans[]={ 0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,8,9,6,9,29,39,38,65,88,128 };

int main()
{
    int n;
    
    while( cin>>n ) 
    {
        cout<<ans[n]<<endl;
    }
    return 0;
}