Submission

Status:

[P][P][P][P][P][P][P][P][PP][P]

Score: 100

User: Whally

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-14 14:32:36

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll lv[110];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    for (int i = 1; i <= 100; i++) lv[i] = (i*(i+1)*(2*i+1)) / 6;
    int n,l; cin >> l >> n;
    int idx = upper_bound(lv, lv+101, n) - lv - 1;
    cout << l-idx;

    return 0;
}