Submission

Status:

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

Subtask/Task Score:

{0/10}{0/10}{0/10}{10/10}{0/10}{10/10}{10/10}{10/10}{10/10}{10/10}

Score: 60

User: nemuchannnUwU

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-17 10:19:47

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
	cin.tie(nullptr)->sync_with_stdio(0);
	cout.tie(nullptr)->sync_with_stdio(0);
	ll n,m; cin >> n >> m;
	vector<ll> v(101);
	v[0]=0;
	for (int i=1;i<=100;i++) v[i]=i*i;
	ll i=1;
	ll cnt=0;
	ll temp=m;
	while(m>0){
		m-=v[i];
		i++;
		cnt++;
	}
	ll sum=(n*(n+1)*(2*n+1))/6;
	if (sum==temp) cout << 0;
	else cout << n-cnt+1;
}