A15697 | Divisors and Table
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an $n \times n$ multiplication table and a positive integer $m = m_1 \cdot m_2$ . A $n \times n$ multiplication table is a table with $n$ rows and $n$ columns numbered from $1$ to $n$ , where $a_{i, j} = i \cdot j$ .
For each divisor $d$ of $m$ , check: does $d$ occur in the table at least once, and if it does, what is the minimum row that contains $d$ .
For each divisor $d$ of $m$ , check: does $d$ occur in the table at least once, and if it does, what is the minimum row that contains $d$ .
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10$ ) — the number of test cases.
The first and only line of each test case contains three integers $n$ , $m_1$ and $m_2$ ( $1 \le n \le 10^9$ ; $1 \le m_1, m_2 \le 10^9$ ) — the size of the multiplication table and the integer $m$ represented as $m_1 \cdot m_2$ .
The first and only line of each test case contains three integers $n$ , $m_1$ and $m_2$ ( $1 \le n \le 10^9$ ; $1 \le m_1, m_2 \le 10^9$ ) — the size of the multiplication table and the integer $m$ represented as $m_1 \cdot m_2$ .
输出格式
For each test case, let $d_1, d_2, \dots, d_k$ be all divisors of $m$ sorted in the increasing order. And let $a_1, a_2, \dots, a_k$ be an array of answers, where $a_i$ is equal to the minimum row index where divisor $d_i$ occurs, or $0$ , if there is no such row.
Since array $a$ may be large, first, print an integer $s$ — the number of divisors of $m$ that are present in the $n \times n$ table. Next, print a single value $X = a_1 \oplus a_2 \oplus \dots \oplus a_k$ , where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
Since array $a$ may be large, first, print an integer $s$ — the number of divisors of $m$ that are present in the $n \times n$ table. Next, print a single value $X = a_1 \oplus a_2 \oplus \dots \oplus a_k$ , where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
输入输出样例
输入 #1
3 3 72 1 10 10 15 6 1 210
输出 #1
6 2 10 0 8 5
In the first test case, $m = 72 \cdot 1 = 72$ and has $12$ divisors $[1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72]$ . The $3 \times 3$ multiplication table looks like that:
123112322463369 For each divisor of $m$ that is present in the table, the position with minimum row index is marked. So the array of answers $a$ is equal to $[1, 1, 1, 2, 2, 0, 3, 0, 0, 0, 0, 0]$ . There are only $6$ non-zero values, and xor of $a$ is equal to $2$ .
In the second test case, $m = 10 \cdot 15 = 150$ and has $12$ divisors $[1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150]$ . All divisors except $75$ and $150$ are present in the $10 \times 10$ table. Array $a$ $=$ $[1, 1, 1, 1, 1, 1, 3, 5, 3, 5, 0, 0]$ . There are $10$ non-zero values, and xor of $a$ is equal to $0$ .
In the third test case, $m = 1 \cdot 210 = 210$ and has $16$ divisors $[1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210]$ . The $6 \times 6$ table with marked divisors is shown below:
1234561123456224681012336912151844812162024551015202530661218243036 Array $a$ $=$ $[1, 1, 1, 1, 1, 0, 2, 0, 3, 0, 5, 0, 0, 0, 0, 0]$ . There are $8$ non-zero values, and xor of $a$ is equal to $5$ .
123112322463369 For each divisor of $m$ that is present in the table, the position with minimum row index is marked. So the array of answers $a$ is equal to $[1, 1, 1, 2, 2, 0, 3, 0, 0, 0, 0, 0]$ . There are only $6$ non-zero values, and xor of $a$ is equal to $2$ .
In the second test case, $m = 10 \cdot 15 = 150$ and has $12$ divisors $[1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150]$ . All divisors except $75$ and $150$ are present in the $10 \times 10$ table. Array $a$ $=$ $[1, 1, 1, 1, 1, 1, 3, 5, 3, 5, 0, 0]$ . There are $10$ non-zero values, and xor of $a$ is equal to $0$ .
In the third test case, $m = 1 \cdot 210 = 210$ and has $16$ divisors $[1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210]$ . The $6 \times 6$ table with marked divisors is shown below:
1234561123456224681012336912151844812162024551015202530661218243036 Array $a$ $=$ $[1, 1, 1, 1, 1, 0, 2, 0, 3, 0, 5, 0, 0, 0, 0, 0]$ . There are $8$ non-zero values, and xor of $a$ is equal to $5$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted