不要抄，这个题用字符串和拆数都能做，时间复杂度一样，这里放字符串做法

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

bool xingyun(string a) {
	int smji = 0, smou = 0;
	for (int i = 0; i < a.size(); i += 2) smji += a[i] - '0';
	for (int i = 1; i < a.size(); i += 2) smou += a[i] - '0';
	if (smji == smou) return true;
	else return false;
}

int main() {
	int a, b, ans = 0;
	cin >> a >> b;
	for (int i = a; i <= b; i++) if (xingyun(to_string(i)) == true) ans++;
	cout << ans;
	return 0;
}