Submission

Score: 100

User: speed_coding

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2026-09-27 21:10:53

#include<bits/stdc++.h>
using namespace std;
int main(){
    int l ,n;
    cin >> l >> n;
    int left = (l*(l+1)*(2*l+1))/6-n;
    if(left == 0){
    	cout << 0;
    	return 0;
	}
	int layers = 0;
	for (int i = l; i >= 1; i--){
		if (left > 0){
			layers++ ;
			left -= i*i;		
		}
	}
	cout << layers;
}