QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 64 MB Total points: 80

#13745. Uzastopni

Statistics

输出将给定的正整数 $N$ 表示为若干个(两个或更多)连续正整数之和的所有方法。^1

输入格式

输入的第一行包含一个正整数 $N$ ($3 \le N \le 10^{10}$)。

输出格式

对于每种等于 $N$ 的连续正整数之和,在一行中输出其首项和末项(即第一个和最后一个加数)。输出中各行的顺序并不重要。在每个测试用例中,至少会存在一个满足条件的和。

样例

输入样例 1

10

输出样例 1

1 4

输入样例 2

27

输出样例 2

13 14
8 10
2 7

说明

样例 1 说明

$10 = 1 + 2 + 3 + 4$。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.