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: I_am_me
Problemset: กองส้ม
Language: c
Time: 0.003 second
Submitted On: 2025-10-12 17:54:43
#include <stdio.h>
int main() {
int l,n ;
scanf("%d %d",&l,&n);
int total = l*(l+1)*(2*l+1)/6 ;
int remain = total - n;
int sumofpiles ;
for(int i = 1;i<=l;i++){
if (remain == 0) {
printf("0") ;
break;
}
sumofpiles += (l-i+1)*(l-i+1) ;
if(sumofpiles >= remain) {
printf("%d",i) ;
break;
}
}
return 0;
}