关于sscanf的小小实验

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> PII;
#define pb emplace_back
//#define int ll
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define lc u << 1
#define rc u << 1 | 1

void solve();

const int N = 1e6 + 10;


signed main() {
    IOS;
    ll t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}

char s[N];

ll sb(ll x)
{
    ll ans = 0;
    while(x) {x /= 10; ans++;}
    return ans;
}

void solve() {
    cin >> s;
    ll x = 0, sum = 0, l = 0;
    cout << "s:" << s << endl;
    while(sscanf(s+l,"%d%*2c",&x))
    {
        cout << "s+l:" << s+l << endl;
        cout << "l:" << l << endl;
        cout << x << endl;
        l += (sb(x) + 2);
        if(l >= strlen(s)) break;
    }
}