#include<iostream>

#include<vector>

#include<algorithm>

using namespace std;

bool isnum(int i, int sum, int half,vector<int> &bit)

{

if (sum == half)

return true;

if (i >= bit.size()-1)

return false;

return isnum(i + 1, sum + bit[i + 1], half, bit) || isnum(i + 1, sum , half, bit);

}

int main()

{

int l, r;

cin >> l >> r;

int count = 0;

for (size_t i = l; i <=r ; i++)

{

int num = i;

vector<int> bit;

int sum = 0;

while (num)

{

sum += num % 10;

bit.push_back(num % 10);

num = num / 10;

}

if (sum % 2 == 0)

{

if (isnum(0,bit[0], sum / 2, bit))

count++;

}

}

cout << count;

system("pause");

return 0;

}

用的暴力方法，求一个简单点的

创作者周榜