Submission

Score: 10

User: Prap

Problemset: กองส้ม

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-20 16:06:40

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
using namespace std;
int checkprime(int numbertocheck) {
	for (int i = 2; i<numbertocheck; i++) {
		if (numbertocheck%i == 0) {
			return false;
		}
	}
	return true;
}
int isodd(int numbertochec) {
	if (numbertochec%2 == 0) {
		return false;
	}
	return true;
}
int main() {
	int L,N;
	cin>>L>>N;
	int num = 0;
	for (int i = 1; i<=L; i++) {
		num = num + (i*i);
		if (N>num) {
			cout<<N-num;
			return 0;
		}
	}
	return 0;
}