QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#235. 最大倍数

Statistics

给定一个整数 $n$,Chiaki 想要找到三个正整数 $x, y$ 和 $z$,使得:$n = x + y + z$,$x \mid n$,$y \mid n$,$z \mid n$,并且 $xyz$ 最大。

输入包含多组测试数据。第一行包含一个整数 $T$ ($1 \le T \le 10^6$),表示测试数据的组数。对于每组测试数据: 第一行包含一个整数 $n$ ($1 \le n \le 10^6$)。

对于每组测试数据,输出一个整数,表示 $xyz$ 的最大值。如果不存在这样的整数,则输出 $-1$。

样例

输入格式 1

3
1
2
3

输出格式 1

-1
-1
1

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.