시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 512 MB | 47 | 26 | 22 | 64.706% |
It was a dark and dreary Christmas Eve when our hero pondered, weak and weary, over a quaint and curious COCI task. When he nodded, nearly napping, suddenly he heard a tapping, tapping and a mighty roar. A giant reindeer broke through his chamber door, merely this and nothing more. While our hero’s heart slightly fluttered, the beast simply uttered: “I won’t leave until you solve this problem”.
In the problem you were given two integers N and M and you were supposed to perfectly match the numbers from sets A = {0, 1, 2, . . . , N − 1} and B = {M, . . . , M + N − 1} into N pairs, such that for the matched numbers x ∈ A and y ∈ B it holds x & y = x, where & denotes a bitwise AND operation.
The first line contains two integers N and M (1 ≤ N ≤ M, N + M ≤ 106) from the task description.
You should output N lines and in each line you should output two integers x and y, where x belongs to set A and y belongs to set B. Numbers in each line should correspond to one of the matched pairs from task description.
It is possible to prove that the solution always exists.
번호 | 배점 | 제한 |
---|---|---|
1 | 10 | N is a power of 2 |
2 | 29 | N + M is a power of 2 |
3 | 39 | N + M ≤ 1000 |
4 | 32 | No additional constraints. |
1 3
0 3
3 5
0 5 1 7 2 6
5 10
0 12 1 13 2 10 3 11 4 14