QOJ.ac

QOJ

Limite de temps : 1 s Limite de mémoire : 512 MB Points totaux : 100

#3074. 表示为和

Statistiques

给定一个整数 $N$,将其表示为至少两个连续正整数的和。例如: $10 = 1 + 2 + 3 + 4$ $24 = 7 + 8 + 9$ 如果存在多种方案,输出加数个数最少的那一种。

输入格式

输入的第一行包含测试用例的数量 $T$。接下来是各测试用例的描述: 每个测试用例包含一行,为一个整数 $N$ ($1 \leq N \leq 10^9$)。

输出格式

对于每个测试用例,输出一行格式为 $N = a + (a+1) + \dots + b$ 的等式,如样例所示。如果无解,则输出单词 “IMPOSSIBLE”。

样例

输入 1

3
8
10
24

输出 1

IMPOSSIBLE
10 = 1 + 2 + 3 + 4
24 = 7 + 8 + 9

数据范围

$1 \leq T \leq 1.1 \times 10^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.