Problem:


Score : 500 points

Problem Statement

You are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)
N players will participate in this competition, and they are given distinct integers from 1 through N.
The arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).
You cannot assign the same integer to multiple playing fields.
The competition consists of N rounds, each of which proceeds as follows:

For each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.

Then, each player adds 1 to its integer. If it becomes N+1, change it to 1.

You want to ensure that no player fights the same opponent more than once during the N rounds.
Print an assignment of integers to the playing fields satisfying this condition.
It can be proved that such an assignment always exists under the constraints given.

Constraints

1 \leq M

M \times 2 +1 \leq N \leq 200000

Input

Input is given from Standard Input in the following format:

N M

Output

Print M lines in the format below.
The i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.

a_1 b_1
a_2 b_2
:
a_M b_M

Sample Input 1

4 1

Sample Output 1

2 3

Let us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.

The 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.

The 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.

The 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.

The 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.

No player fights the same opponent more than once during the four rounds, so this solution will be accepted.

Sample Input 2

7 3

Sample Output 2

1 6
2 5
3 4



Sample input:
4 1


Sample output:
2 3

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
if M%2 == 0:
    a2 = int(N/2)+1
    a1 = 1
    b1 = a2+1
    b2 = N
else:
    a2 = int(N/2)
    a1 = 1
    b1 = a2+1
    b2 = N

anls = []
m1 = int(M/2)
m2 = M-m1
for i in range(m1):
    anls.append([a1,a2])
    a1 += 1
    a2 -= 1
for i in range(m2):
    anls.append([b1,b2])
    b1 += 1
    b2 -= 1

for i in range(M):
    print(anls[i][0],anls[i][1])

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
if M%2 == 0:
    a2 = int(N/2)+1
    a1 = 1
    b1 = a2+1
    b2 = N
else:
    a2 = int(N/2)
    a1 = 1
    b1 = a2+1
    b2 = N

anls = []
while a1 < a2:
    anls.append([a1,a2])
    a1 += 1
    a2 -= 1
    if len(anls) == M:
        break
while b1 < b2:
    anls.append([b1,b2])
    b1 += 1
    b2 -= 1
    if len(anls) == M:
        break

for i in range(M):
    print(anls[i][0],anls[i][1])

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
a2 = int(N/2)
a1 = 1
b1 = a2+1
b2 = N
anls = []
while a1 < a2:
    anls.append([a1,a2])
    a1 += 1
    a2 -= 1
    if len(anls) == M:
        break
while b1 < b2:
    anls.append([b1,b2])
    b1 += 1
    b2 -= 1
    if len(anls) == M:
        break

for i in range(M):
    print(anls[i][0],anls[i][1])

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
if N % 4 in [1,2]:
    odd_pair = [N//2//2 , N//2//2+1]
    even_pair = [N-N//2//2-1,N-N//2//2+1]
else:
    odd_pair = [N-N//2//2-1 , N-N//2//2]
    even_pair = [N//2//2,N//2//2+2]
cnt = 0
while True:
    print(*odd_pair)
    cnt += 1
    if cnt == M:
        break
    odd_pair[0] -= 1
    odd_pair[1] += 1
    print(*even_pair)
    cnt += 1
    if cnt == M:
        break
    even_pair[0] -= 1
    even_pair[1] += 1

Submission status: Wrong Answer

Solution code:
import math

nums = [int(e) for e in input().split()]
n = nums[0]
m = nums[1]

x = -1
y = -1

ms = []

if n%2 == 0:
    x = 1
    y = n

    while x <= y:
        if y-x == n/2:
            y -= 1
        ms += [[x,y]]
        x += 1
        y -= 1


else:
    x = 1
    y = n
    while x < y:
        ms += [[x, y]]
        x += 1
        y -= 1


# print(ms)

for i in range(m):
    print(str(ms[i][0]) + " " + str(ms[i][1]))

Submission status: Wrong Answer

Solution code:
import math

nums = [int(e) for e in input().split()]
n = nums[0]
m = nums[1]

x = -1
y = -1

ms = []

if n%2 == 0:
    x = 1
    y = n

    while x < y:
        if y-x == n/2:
            y -= 1
        ms += [[x,y]]
        x += 1
        y -= 1


else:
    x = 1
    y = n
    while x < y:
        ms += [[x, y]]
        x += 1
        y -= 1


# print(ms)

for i in range(m):
    print(str(ms[i][0]) + " " + str(ms[i][1]))

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
pre_pair = [N//2//2 , N//2//2+1]
post_pair = [N-N//2//2-1,N-N//2//2+1]
cnt = 0
while True:
    print(*pre_pair)
    cnt += 1
    if cnt == M:
        break
    pre_pair[0] -= 1
    pre_pair[1] += 1
    print(*post_pair)
    cnt += 1
    if cnt == M:
        break
    post_pair[0] -= 1
    post_pair[1] += 1

Submission status: Wrong Answer

Solution code:
import math

nums = [int(e) for e in input().split()]
n = nums[0]
m = nums[1]

x = -1
y = -1

ms = []

if n%2 == 0:
    if n%4 == 0:
        roop1 = math.floor(n/4) -1
        roop2 = math.floor(n/4)
    else:
        roop1 = math.floor(n/4)
        roop2 = math.floor(n/4)

    x = int(n/2)
    y = int(n/2)
    for i in range(roop1):
        x -= 1
        y += 1
        ms += [[x, y]]

    x -= 1

    for i in range(roop2):
        x -= 1
        y += 1
        ms += [[x, y]]

else:
    x = math.floor(n/2)+1
    y = math.floor(n/2)+1
    for i in range(math.floor(n/2)):
        x -= 1
        y += 1
        ms += [[x, y]]


# print(ms)

for i in range(m):
    print(str(ms[i][0]) + " " + str(ms[i][1]))

Submission status: Wrong Answer

Solution code:
N,M = map(int,input().split())
pre_pair = [N//2//2 , N//2//2+1]
post_pair = [N-N//2//2-1,N-N//2//2+1]
cnt = 0
while cnt < M:
    print(*pre_pair)
    cnt += 1
    pre_pair[0] -= 1
    pre_pair[1] += 1
    print(*post_pair)
    cnt += 1
    post_pair[0] -= 1
    post_pair[1] += 1

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
"""アリーナの番号の割り当てが変更すると考える　参加者の番号が固有でアリーナの番号がひとつづつ減ってく
"""
def bul(x,y,m,n,result):#アリーナの動きを平面上の天の位置の動きと同一視した時の制限m(参加者)でn個進んだ時の座標
    k = y - x
    xx = 1-k
    if x - xx >= n:
        result.append([x-n,y-n])
    else:
        bul(m,m+k-1,m,n-(y-1)-1,result)
def rap(x,y,m,n):
    result = []
    bul(x,y,m,n,result)
    return result
anls = []
k = 1
dot = [N,N-1]
anls.append(dot)
while  k < M:
    x1 = dot[0]
    x2 = dot[1]
    an = rap(x1,x2,N,N)
    dot = an[0]
    anls.append(dot)
    k += 1
for item in anls:
    print(item[0],item[1])

Submission status: Wrong Answer

Solution code:
N, M = map(int, input().split())
"""アリーナの番号の割り当てが変更すると考える　参加者の番号が固有でアリーナの番号がひとつづつ減ってく
"""
def bul(x,y,m,n,result):#アリーナの動きを平面上の天の位置の動きと同一視した時の制限m(参加者)でn個進んだ時の座標
    k = y - x
    xx = 1-k
    if x - xx >= n:
        result.append([x-n,y-n])
    else:
        bul(m,m+k-1,m,n-(y-1)-1,result)
def rap(x,y,m,n):
    result = []
    bul(x,y,m,n,result)
    return result
anls = []
k = 1
dot = [N,N-1]
anls.append(dot)
while  k < M:
    x1 = dot[0]
    x2 = dot[1]
    an = rap(x1,x2,N,N+1)
    dot = an[0]
    anls.append(dot)
    k += 1
for item in anls:
    print(item[0],item[1])

Submission status: Wrong Answer

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    N, M = R()
    if N%2 == 0: # even
        j = 2
        for i in range(1, M+1):
            print(j, N+1-i)
            j += 1
            if j == (N+6)//4:
                j+=1
    else: # odd
        for i in range(M):
            print(i+2, N-i)

    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()