Submission

Score: 100

User: kavin8888

Problemset: กองส้ม

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-09 21:06:14

#include<bits/stdc++.h> 
using namespace std;
#define ll long long
int n,m;
ll nub=0,ans=0;
int main() {
	cin>>n>>m;
	vector<int> v(n+1);
	for(int i=1;i<=n;i++) v[i]=i*i;
	for(int i=1;i<=n;i++) {
		nub+=v[i];
		if(nub>m){
			ans=i;
			break;
		}
	}
	if(ans==0) {
		cout<<"0\n";
		return 0;
	}
	cout<<n-ans+1;
	return 0;
}