Submission

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

Score: 100

User: Him123

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-16 11:30:34

#include <iostream>
using namespace std;

int main() {
	int L, N;
	cin >> L >> N;
	int remainingLayer = L;
	
	for (int i = 1; i <= L; i++) {
		int orangesInLayer = i * i;
		if (N < orangesInLayer) {
			remainingLayer = L - i + 1;
			
			break;
		}
		else {
			N -= orangesInLayer;
			remainingLayer = L - i;
		}
	}
	cout << remainingLayer;
}