Submission

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

Score: 70

User: Bune

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-12 08:42:19

#include<iostream>
#include<vector>
using std::cin,std::cout,std::string,std::vector;

int main(){
  int l,n,total=0,a=0;
  cin>>l>>n;
  vector<int> layers={};
  for(int i=1;i<=l;i++){
    a=i*i;
    layers.push_back(a);
    total+=a;
  } 
  for(int i=1;i<=layers.size()+1;i++){
    if(n-layers[i-1]>0){
      n-=layers[i-1];
      l--;
    }
    else if(n-layers[i-1]<0){
      cout<<l;
      return 0;
    }
    else{
      cout<<"0";
      return 0;
    }
  }
  cout<<l;
  
  return 0;
}