Submission

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

Score: 100

User: akuyga1

Problemset: กองส้ม

Language: cpp

Time: 0.003 second

Submitted On: 2025-02-26 10:20:39

#include "bits/stdc++.h"
using namespace std;
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N,K;
	cin>>N>>K;
	vector<int> ps(N+1,0);
	for(int i=1;i<=N;i++){
	    //top to bottom
	    ps[i]=ps[i-1];
	    ps[i]+=i*i;
	    if(ps[i]==K){cout<<N-i; break;}
	    if(ps[i]>K){cout<<N-i+1; break;}
	}
    
}