Sob
시간 제한1초메모리 제한512 MB
x & y = x, 즉 x가 y의 부분 비트마스크가 되도록 {0..N-1}의 각 x를 {M..M+N-1}의 서로 다른 y와 짝지어 출력한다.
문제
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.