knuu

# 予選Aで日本人60位までが通過したという情報を元にしたランキング
# 日本人順位(全体順位): ハンドルネーム
# 通過済みの日本人順位は--としている
--(4): yutaka1999
--(22): tozangezan
--(23): mcfx
1(24): DEGwer
2(32): yokozuna57
3(33): sugim48
--(34): kmjp

knuu

import sequtils, strutils, algorithm

type
  FenwickTree[T] = object
    dat: seq[T]
    size: int
    initial: T

proc initFenwickTree[T](size: int, initial: T): FenwickTree[T] =
  assert(size > 0)

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

struct SuffixArray {
  int N, k;
  string S;
  vector<int> sa, rank, tmp;

knuu

import sys
if sys.version[0] == '2':
    range, input = xrange, raw_input


def linear_recursion_solver(a, x, k, e0, e1):
    # https://github.com/spaghetti-source/algorithm
    def rec(k):
        c = [e0] * n
        if k < n:

knuu

from copy import deepcopy
import sys
if sys.version[0] == '2':
    range, input = xrange, raw_input


class Matrix:
    ZERO = 0
    ONE = (1 << 32) - 1

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

const int INF = 1e7;

template <typename T>
struct MinCostFlow {

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

struct SuffixArray {
  int N, k;
  string S;
  vector<int> sa, rank, tmp;

knuu

import sys
import collections

if sys.version[0] == '2':
    range, input = xrange, raw_input


class MaxFlow:
    """Dinic Algorithm: find max-flow
       complexity: O(EV^2)

knuu

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)

#define INF 1<<29

template <typename T>
struct MaxFlow {

knuu

import collections


class MaxFlow:
    """Dinic Algorithm: find max-flow
       complexity: O(EV^2)
       used in GRL6A(AOJ)
    """
    class Edge:
        def __init__(self, to, cap, rev):