A10130 | Spongebob and Squares
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly $x$ distinct squares in the table consisting of $n$ rows and $m$ columns. For example, in a $3×5$ table there are $15$ squares with side one, $8$ squares with side two and $3$ squares with side three. The total number of distinct squares in a $3×5$ table is $15+8+3=26$ .
输入格式
The first line of the input contains a single integer $x$ ( $1<=x<=10^{18}$ ) — the number of squares inside the tables Spongebob is interested in.
输出格式
First print a single integer $k$ — the number of tables with exactly $x$ distinct squares inside.
Then print $k$ pairs of integers describing the tables. Print the pairs in the order of increasing $n$ , and in case of equality — in the order of increasing $m$ .
Then print $k$ pairs of integers describing the tables. Print the pairs in the order of increasing $n$ , and in case of equality — in the order of increasing $m$ .
输入输出样例
输入 #1
26
输出 #1
6 1 26 2 9 3 5 5 3 9 2 26 1
输入 #2
2
输出 #2
2 1 2 2 1
输入 #3
8
输出 #3
4 1 8 2 3 3 2 8 1
In a $1×2$ table there are $2$ $1×1$ squares. So, $2$ distinct squares in total.
In a $2×3$ table there are $6$ $1×1$ squares and $2$ $2×2$ squares. That is equal to $8$ squares in total.
In a $2×3$ table there are $6$ $1×1$ squares and $2$ $2×2$ squares. That is equal to $8$ squares in total.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted