Submission

Score: 100

User: jamesz

Problemset: กองส้ม

Language: cpp

Time: 0.003 second

Submitted On: 2026-09-20 18:57:41

#include<iostream>
using namespace std;
int main(){
	int l,n,fl,m,k;
	cin>>l;
	cin>>n;
	m = l;
	int a[l];
	k = 0;
	while(l>0){
		a[k] = l*l;  
		l-=1;
		k++;
	}
	l = m;
	while(n>0){
		a[l-1]-=1;
		n-=1;
		if(a[l-1] == 0){
			l-=1;
		}
		if(n==0){
			break;
		}
	}
	l = m;			
	int count;
	count = 0;
	for(int i = 0; i<l; i++){
		if(a[i] != 0){
			count+=1;
		}
	}
	cout<<count;
	
}