题解 | 小苯的计算式

考虑题目数据范围很小，直接暴力即可😋

#include <bits/stdc++.h>
#define MAXN 1000010
#define LL long long
#define INF 0x7fffffff
using namespace std;
const LL MOD = 1e9+7;

int main() {
    int n, c, ans = 0;
    cin >> n >> c;
    string sc = to_string(c);
    int cs = sc.length();
    for(int a = 0; a <= c; a++) {
        int b = c - a;
        if(to_string(a).length() + to_string(b).length() == n-cs-2) ans++;
    }
    cout << ans << endl;
    return 0;
}