Type: RemoteJudge 1000ms 128MiB

分苹果

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

题目描述

把一堆苹果分给 nn 个小朋友,要使每个人都能拿到苹果,而且每个人拿到的苹果数都不同的话,这堆苹果至少应该有多少个?

输入格式

一个不大于 10001000 的正整数 nn,代表小朋友人数。

输出格式

一个整数,表示满足条件的最少苹果个数。

8

36

系统测试

Not Attended
Status
Done
Rule
IOI
Problem
8
Start at
2026-1-5 16:45
End at
2026-1-10 16:45
Duration
120 hour(s)
Host
Partic.
16