Submission
Status:
[P][P][P][P][P][P][P][P][PP][P]
Subtask/Task Score:
{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}
Score: 100
User: nemuchannnUwU
Problemset: กองส้ม
Language: cpp
Time: 0.002 second
Submitted On: 2025-10-17 10:24:04
#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(n+1);
v[0]=0;
for (ll i=1;i<=n;i++) v[i]=i*i;
ll x=n+1;
ll sum=0;
for (ll i=1;i<=n;i++){
sum+=v[i];
if (sum>m){
x=i;
break;
}
}
cout << n-x+1;
}