Function floor_sum_super_slow

code/mathematics/floor_sum.test.cpp:3–14

// Field testing: MIPT 2015, 4J Triangle

ll floor_sum_super_slow(ll n, ll a, ll b, ll c) {
    if (c < 0) return 0;
    ll cnt = 0;
    for (ll x = 0; x <= n; x++) {
        for (ll y = 0; y <= c; y++) {
            if (a*x + b*y <= c) {
                cnt++;
            }
        }
    }
    return cnt;
}
ll floor_sum_slow(ll n, ll a, ll b, ll c) {
    if (c < 0) return 0;
    ll cnt = 0;