import sys
input = sys.stdin.readline
k = int(input())
if k == 0:
print(0)
print(0, -1)
exit()
nodes = []
nodes.append((0, -1))
current_node = 1
paths = 0
while paths < k:
nodes.append((current_node, 0))
paths += 1
current_node += 1
print(len(nodes))
for node, parent in nodes:
print(node, parent)
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
30 ms |
18552 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
30 ms |
18552 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
30 ms |
18552 KB |
Integer parameter [name=N] equals to 0, violates the range [1, 1000000] |
2 |
Halted |
0 ms |
0 KB |
- |