Submission

Status:

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

Score: 100

User: solarsunny

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-31 20:11:15

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

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int l,n = 0;
    cin >> l >> n;
    int p[l];
    for(int i=0; i<l; i++) {
        p[i] = (i+1)*(i+1);
    }
    int h=l;
    for(int i=0; i<l; i++) {
        if((n-p[i])>=0) {
            n = n - p[i];   
            h--;
        } else {
            break;
        }
        
        
    }
    cout << h << endl;
}