1～3000所有包含5，6的数（如56，526，1635）的和

#include<iostream>
using namespace std;

const int contain_num[] = {5,6};
const int num_len = sizeof(contain_num)/sizeof(contain_num[0]);
const int MAX = 3000;
bool b_has[10] = {false};

bool if_contain(int n);
int contain_sum();

int  main() 
{
    int sum = contain_sum();
    cout<<sum<<endl;
	return 0;
}

bool if_contain(int n)
{
    int i;
    bool b_rst = true;
    for(i=0; i<num_len; i++)
        b_has[contain_num[i]] = true;
    int temp = n;
    while(temp)
    {
        b_has[temp%10] = false;
        temp /= 10;
    }
    for(i=0; i<num_len; i++)
    {
        if(b_has[contain_num[i]])
        {
            b_rst = false;
            break;
        }
    }

    return b_rst;
}

int contain_sum()
{
    int i, j;
    int sum=0;
    i = 1;
    j = num_len-1;
    while(j--)
        i*=10;
    
    for(; i<MAX; i++)
    {
        if(if_contain(i))
        {
            sum += i;
        }
    }
    return sum;
}