{
  "schema_version": 1,
  "source": "https://oj.vnoi.info/tags/",
  "groups": [
    {
      "code": "",
      "name": "Lý thuyết Đồ thị",
      "tags": [
        {
          "code": "dfs_bfs",
          "name": "DFS / BFS"
        },
        {
          "code": "euler_tour",
          "name": "Chu trình Euler"
        },
        {
          "code": "dijkstra",
          "name": "Đường đi ngắn nhất - Dijkstra"
        },
        {
          "code": "mst",
          "name": "Cây khung nhỏ nhất"
        },
        {
          "code": "2sat",
          "name": "2-satisfiability"
        },
        {
          "code": "lca",
          "name": "LCA"
        },
        {
          "code": "graph",
          "name": "Đồ thị"
        },
        {
          "code": "cycle",
          "name": "Chu trình"
        },
        {
          "code": "biconnected",
          "name": "Thành phần song liên thông"
        },
        {
          "code": "strongly_connected",
          "name": "Thành phần liên thông mạnh"
        },
        {
          "code": "topo_sort",
          "name": "Topo sort"
        },
        {
          "code": "tree_euler_tour",
          "name": "Euler tour trên cây"
        },
        {
          "code": "Centroid",
          "name": "Centroid"
        },
        {
          "code": "isomorphism",
          "name": "Tree isomorphism (Cây đồng dạng)"
        },
        {
          "code": "floyd",
          "name": "Đường đi ngắn nhất - Floyd"
        },
        {
          "code": "bfs01",
          "name": "BFS 01"
        },
        {
          "code": "dsu",
          "name": "Disjoint set (DSU)"
        },
        {
          "code": "boruvka",
          "name": "Boruvka"
        },
        {
          "code": "clique",
          "name": "Maximum Clique"
        },
        {
          "code": "dsu_rollback",
          "name": "DSU rollback"
        },
        {
          "code": "cactus_graph",
          "name": "Đồ thị đặc biệt - Xương rồng"
        },
        {
          "code": "function_graph",
          "name": "Đồ thị đặc biệt - Function graph"
        },
        {
          "code": "bridge-and-articulation-points",
          "name": "Cầu với khớp"
        }
      ]
    },
    {
      "code": "",
      "name": "Cấu trúc dữ liệu",
      "tags": [
        {
          "code": "stl",
          "name": "C++ STL (Heap, Set, Map, ...)"
        },
        {
          "code": "bbst",
          "name": "Balanced BST (cây nhị phân cân bằng)"
        },
        {
          "code": "prefix_sum",
          "name": "Mảng cộng dồn"
        },
        {
          "code": "segment_tree",
          "name": "Segment Tree (Interval Tree)"
        },
        {
          "code": "hld",
          "name": "Heavy Light Decomposition"
        },
        {
          "code": "mono_queue",
          "name": "Monotonic Queue"
        },
        {
          "code": "segtree_walk",
          "name": "Segment Tree Walk"
        },
        {
          "code": "bitset",
          "name": "Bitset"
        },
        {
          "code": "fenwick_2d",
          "name": "Fenwick Tree 2D"
        },
        {
          "code": "segtree_2d",
          "name": "Segment Tree 2D"
        },
        {
          "code": "rmq",
          "name": "RMQ"
        },
        {
          "code": "fenwick",
          "name": "Fenwick Tree (Binary Indexed Tree)"
        },
        {
          "code": "binary_lifting",
          "name": "Binary Lifting"
        },
        {
          "code": "sparse_table",
          "name": "Sparse table"
        },
        {
          "code": "segtree_persistent",
          "name": "Persistent Segment Tree"
        },
        {
          "code": "lichao-tree",
          "name": "Segment Tree đoạn thẳng (Li Chao)"
        },
        {
          "code": "pbds",
          "name": "GNU C++ PBDS (ordered set)"
        },
        {
          "code": "segtree_beats",
          "name": "Segment Tree Beats"
        },
        {
          "code": "block_cut_tree",
          "name": "Block cut tree (graph)"
        },
        {
          "code": "offline-query",
          "name": "Xử lý offline"
        }
      ]
    },
    {
      "code": "",
      "name": "Xử lý xâu",
      "tags": [
        {
          "code": "hash",
          "name": "Hashing"
        },
        {
          "code": "trie",
          "name": "Trie"
        },
        {
          "code": "suffix_array",
          "name": "Suffix Array / Suffix Automaton / Suffix Tree"
        },
        {
          "code": "kmp",
          "name": "KMP"
        },
        {
          "code": "z_func",
          "name": "Z-function"
        },
        {
          "code": "manacher",
          "name": "Manacher"
        },
        {
          "code": "palin-tree",
          "name": "Palindrome Tree"
        },
        {
          "code": "aho",
          "name": "Aho Corasick"
        }
      ]
    },
    {
      "code": "",
      "name": "Quy Hoạch Động",
      "tags": [
        {
          "code": "dp",
          "name": "Quy hoạch động"
        },
        {
          "code": "dp_digit",
          "name": "Quy hoạch động chữ số"
        },
        {
          "code": "dp_bitmask",
          "name": "Quy hoạch động bitmask"
        },
        {
          "code": "dp-convexhull",
          "name": "Quy hoạch động bao lồi"
        },
        {
          "code": "dp_lexicographical",
          "name": "Quy hoạch động thứ tự từ điển"
        },
        {
          "code": "dp_on_tree",
          "name": "Quy hoạch động trên cây"
        },
        {
          "code": "dp-tree-knapsack",
          "name": "Quy hoạch động Knapsack trên cây"
        },
        {
          "code": "dp-dag",
          "name": "Quy hoạch động trên DAG"
        },
        {
          "code": "dp-count",
          "name": "Quy hoạch động đếm"
        },
        {
          "code": "dp-dnc",
          "name": "Quy hoạch động chia để trị"
        },
        {
          "code": "dp-permutation",
          "name": "Quy hoạch động hoán vị"
        },
        {
          "code": "dp-sos",
          "name": "Quy hoạch động bitmask tổng tập con"
        },
        {
          "code": "dp-swap-label",
          "name": "Quy hoạch động đổi nhãn"
        },
        {
          "code": "dp_knuth",
          "name": "Knuth Optimization"
        },
        {
          "code": "dp-openclose",
          "name": "Open Close Interval Trick"
        },
        {
          "code": "dp-alien",
          "name": "Alien Trick"
        },
        {
          "code": "dp-slope",
          "name": "Slope Trick"
        }
      ]
    },
    {
      "code": "",
      "name": "Kĩ năng khác",
      "tags": [
        {
          "code": "binary_search",
          "name": "Tìm kiếm nhị phân (Binary search)"
        },
        {
          "code": "matrix_mul",
          "name": "Nhân ma trận"
        },
        {
          "code": "bignum",
          "name": "Xử lý số lớn"
        },
        {
          "code": "compress",
          "name": "Rời rạc hóa"
        },
        {
          "code": "ad_hoc",
          "name": "Ad hoc (không thuộc thể loại nào)"
        },
        {
          "code": "sweep_line",
          "name": "Sweep line"
        },
        {
          "code": "dnc",
          "name": "Divide & Conquer (Chia để trị)"
        },
        {
          "code": "2_pointers",
          "name": "2 con trỏ"
        },
        {
          "code": "bin-search-parallel",
          "name": "Parallel Binary Search"
        },
        {
          "code": "small-to-large",
          "name": "Gộp set (Small to Large)"
        },
        {
          "code": "constructive",
          "name": "Constructive"
        },
        {
          "code": "interactive",
          "name": "Interactive"
        },
        {
          "code": "random",
          "name": "Random"
        },
        {
          "code": "casework",
          "name": "Xét trường hợp"
        },
        {
          "code": "hard-implementation",
          "name": "Cài đặt khó"
        },
        {
          "code": "static-data",
          "name": "Mảng hằng"
        },
        {
          "code": "reversal",
          "name": "Lật ngược bài toán"
        },
        {
          "code": "implementation",
          "name": "Cài đặt"
        },
        {
          "code": "ternary-search",
          "name": "Tìm kiếm tam phân (Ternary search)"
        }
      ]
    },
    {
      "code": "",
      "name": "Hình học",
      "tags": [
        {
          "code": "geometry",
          "name": "Hình học"
        },
        {
          "code": "convexhull",
          "name": "Bao lồi"
        },
        {
          "code": "inversive-geometry",
          "name": "Inversive Geometry"
        }
      ]
    },
    {
      "code": "",
      "name": "Toán học",
      "tags": [
        {
          "code": "number_theory",
          "name": "Số học"
        },
        {
          "code": "gauss",
          "name": "Khử Gauss"
        },
        {
          "code": "fft",
          "name": "Fast Fourier Transform (FFT)"
        },
        {
          "code": "combination",
          "name": "Tổ hợp"
        },
        {
          "code": "bitwise",
          "name": "Bitwise"
        },
        {
          "code": "math-adhoc",
          "name": "Toán - adhoc"
        },
        {
          "code": "lagrange-inter",
          "name": "Nội suy Lagrange"
        },
        {
          "code": "extgcd",
          "name": "Extended GCD"
        },
        {
          "code": "inclusion-exclusion",
          "name": "Bao hàm loại trừ (Inclusion Exclusion)"
        },
        {
          "code": "mobius",
          "name": "Hàm Mobius"
        },
        {
          "code": "probability",
          "name": "Xác suất"
        },
        {
          "code": "multiplicative",
          "name": "Hàm nhân tính"
        },
        {
          "code": "sieve",
          "name": "Sàng nguyên tố"
        },
        {
          "code": "chinese-remainder",
          "name": "Thặng dư Trung Hoa"
        }
      ]
    },
    {
      "code": "",
      "name": "Luồng & Cặp ghép",
      "tags": [
        {
          "code": "flow",
          "name": "Luồng"
        },
        {
          "code": "matching",
          "name": "Cặp ghép"
        },
        {
          "code": "weighted_matching",
          "name": "Cặp ghép có trọng số"
        },
        {
          "code": "flow-mincost",
          "name": "Luồng mincost"
        },
        {
          "code": "matching-hall",
          "name": "Định lý Hall"
        },
        {
          "code": "flow-demands",
          "name": "Luồng cận dưới"
        },
        {
          "code": "matching-general",
          "name": "Cặp ghép trên đồ thị thường"
        }
      ]
    },
    {
      "code": "",
      "name": "Tham lam",
      "tags": [
        {
          "code": "greedy",
          "name": "Tham lam"
        },
        {
          "code": "greedy-more",
          "name": "Tham lam - Moore"
        },
        {
          "code": "greedy-exchange",
          "name": "Tham lam - Exchange argument"
        }
      ]
    },
    {
      "code": "",
      "name": "Lý thuyết trò chơi",
      "tags": [
        {
          "code": "Grundy",
          "name": "Lý thuyết trò chơi - Grundy"
        },
        {
          "code": "nim",
          "name": "Lý thuyết trò chơi - Nim"
        },
        {
          "code": "minimax",
          "name": "Lý thuyết trò chơi - Minimax"
        },
        {
          "code": "game_theory_adhoc",
          "name": "Lý thuyết trò chơi - Adhoc"
        }
      ]
    },
    {
      "code": "",
      "name": "Duyệt",
      "tags": [
        {
          "code": "brute_force",
          "name": "Duyệt"
        },
        {
          "code": "backtrack",
          "name": "Đệ quy (backtrack)"
        },
        {
          "code": "branch-bound",
          "name": "Nhánh cận (branch & bound)"
        },
        {
          "code": "meet-in-the-middle",
          "name": "Chia đôi tập / Meet in the middle"
        }
      ]
    },
    {
      "code": "",
      "name": "Chia căn (Sqrt Decomposition)",
      "tags": [
        {
          "code": "sqrt-buckets",
          "name": "Chia block"
        },
        {
          "code": "sqrt-time",
          "name": "Chia theo truy vấn"
        },
        {
          "code": "sqrt-2way",
          "name": "Chia 2 cách làm"
        },
        {
          "code": "mo-general",
          "name": "Mo algorithm"
        },
        {
          "code": "sqrt-babygiant",
          "name": "Baby step giant step"
        },
        {
          "code": "mo-update",
          "name": "Mo algorithm có cập nhật"
        }
      ]
    }
  ],
  "problems": [
    {
      "code": "AC_abc134_e",
      "name": "E. Sequence Decomposing",
      "url": "https://atcoder.jp/contests/abc134/tasks/abc134_e",
      "judge": "Atcoder",
      "tags": [
        "constructive",
        "greedy"
      ]
    },
    {
      "code": "AC_abc139_e",
      "name": "E. League",
      "url": "https://atcoder.jp/contests/abc139/tasks/abc139_e",
      "judge": "Atcoder",
      "tags": [
        "graph"
      ]
    },
    {
      "code": "AC_abc141_f",
      "name": "F. Xor Sum 3",
      "url": "https://atcoder.jp/contests/abc141/tasks/abc141_f",
      "judge": "Atcoder",
      "tags": [
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "AC_abc144_f",
      "name": "F. Fork in the Road",
      "url": "https://atcoder.jp/contests/abc144/tasks/abc144_f",
      "judge": "Atcoder",
      "tags": [
        "graph",
        "dp-dag"
      ]
    },
    {
      "code": "AC_abc147_f",
      "name": "F. Sum Difference",
      "url": "https://atcoder.jp/contests/abc147/tasks/abc147_f",
      "judge": "Atcoder",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "AC_abc150_f",
      "name": "F. Xor Shift",
      "url": "https://atcoder.jp/contests/abc150/tasks/abc150_f",
      "judge": "Atcoder",
      "tags": [
        "kmp",
        "z_func",
        "bitwise"
      ]
    },
    {
      "code": "AC_abc206_f",
      "name": "F. Interval Game 2",
      "url": "https://atcoder.jp/contests/abc206/tasks/abc206_f",
      "judge": "Atcoder",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "AC_abc219_g",
      "name": "G. Propagation",
      "url": "https://atcoder.jp/contests/abc219/tasks/abc219_g",
      "judge": "Atcoder",
      "tags": [
        "graph",
        "sqrt-2way"
      ]
    },
    {
      "code": "AC_abc262_e",
      "name": "E. Red and Blue Graph",
      "url": "https://atcoder.jp/contests/abc262/tasks/abc262_e",
      "judge": "Atcoder",
      "tags": [
        "graph",
        "combination"
      ]
    },
    {
      "code": "AC_abc326_g",
      "name": "G. Unlock Achievement",
      "url": "https://atcoder.jp/contests/abc326/tasks/abc326_g",
      "judge": "Atcoder",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "AC_agc011_c",
      "name": "C. Squared Graph",
      "url": "https://atcoder.jp/contests/agc011/tasks/agc011_c",
      "judge": "Atcoder",
      "tags": [
        "dfs_bfs",
        "graph"
      ]
    },
    {
      "code": "AC_agc014_d",
      "name": "D. Black and White Tree",
      "url": "https://atcoder.jp/contests/agc014/tasks/agc014_d",
      "judge": "Atcoder",
      "tags": [
        "dfs_bfs",
        "matching",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "AC_agc030_b",
      "name": "B. Tree Burning",
      "url": "https://atcoder.jp/contests/agc030/tasks/agc030_b",
      "judge": "Atcoder",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "AC_agc039_c",
      "name": "C. Division by Two with Something",
      "url": "https://atcoder.jp/contests/agc039/tasks/agc039_c",
      "judge": "Atcoder",
      "tags": [
        "dp",
        "number_theory",
        "bitwise",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "AC_arc068_c",
      "name": "E. Snuke Line",
      "url": "https://atcoder.jp/contests/arc068/tasks/arc068_c",
      "judge": "Atcoder",
      "tags": [
        "segment_tree",
        "fenwick",
        "sieve"
      ]
    },
    {
      "code": "AC_arc125_e",
      "name": "E. Snack",
      "url": "https://atcoder.jp/contests/arc125/tasks/arc125_e",
      "judge": "Atcoder",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "AC_arc131_d",
      "name": "D. AtArcher",
      "url": "https://atcoder.jp/contests/arc131/tasks/arc131_d",
      "judge": "Atcoder",
      "tags": [
        "math-adhoc",
        "greedy"
      ]
    },
    {
      "code": "AC_zone2021_f",
      "name": "F. Encounter and Farewell",
      "url": "https://atcoder.jp/contests/zone2021/tasks/zone2021_f",
      "judge": "Atcoder",
      "tags": [
        "bitwise"
      ]
    },
    {
      "code": "CF_1000_C",
      "name": "Covered Points Count",
      "url": "https://codeforces.com/contest/1000/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "implementation"
      ]
    },
    {
      "code": "CF_1000_D",
      "name": "Yet Another Problem On a Subsequence",
      "url": "https://codeforces.com/problemset/problem/1000/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1000_E",
      "name": "We Need More Bosses",
      "url": "https://codeforces.com/contest/1000/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "biconnected"
      ]
    },
    {
      "code": "CF_1000_F",
      "name": "One Occurrence",
      "url": "https://codeforces.com/contest/1000/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dnc",
        "mo-general",
        "mo-update"
      ]
    },
    {
      "code": "CF_1003_E",
      "name": "Tree Constructing",
      "url": "https://codeforces.com/contest/1003/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "ad_hoc",
        "graph",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1003_F",
      "name": "Abbreviation",
      "url": "https://codeforces.com/contest/1003/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "dp",
        "implementation"
      ]
    },
    {
      "code": "CF_1004_D",
      "name": "Sonya and Matrix",
      "url": "https://codeforces.com/contest/1004/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1004_E",
      "name": "Sonya and Ice Cream",
      "url": "https://codeforces.com/contest/1004/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1004_F",
      "name": "Sonya and Bitwise OR",
      "url": "https://codeforces.com/contest/1004/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "2_pointers",
        "bitwise"
      ]
    },
    {
      "code": "CF_1005_E1",
      "name": "Median on Segments (Permutations Edition)",
      "url": "https://codeforces.com/contest/1005/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1006_D",
      "name": "Two Strings Swaps",
      "url": "https://codeforces.com/contest/1006/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1006_F",
      "name": "Xor-Paths",
      "url": "https://codeforces.com/contest/1006/problem/F",
      "judge": "Codeforces",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "CF_1007_B",
      "name": "Pave the Parallelepiped",
      "url": "https://codeforces.com/contest/1007/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "number_theory",
        "combination",
        "casework"
      ]
    },
    {
      "code": "CF_1009_C",
      "name": "Annoying Present",
      "url": "https://codeforces.com/contest/1009/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1009_D",
      "name": "Relatively Prime Graph",
      "url": "https://codeforces.com/contest/1009/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "brute_force",
        "number_theory",
        "greedy",
        "graph",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1009_E",
      "name": "Intercity Travelling",
      "url": "https://codeforces.com/contest/1009/problem/E",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "probability"
      ]
    },
    {
      "code": "CF_1009_F",
      "name": "Dominant Indices",
      "url": "https://codeforces.com/contest/1009/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "dsu",
        "small-to-large"
      ]
    },
    {
      "code": "CF_1010_C",
      "name": "Border",
      "url": "https://codeforces.com/contest/1010/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_1010_D",
      "name": "Mars rover",
      "url": "https://codeforces.com/contest/1010/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_lifting",
        "bitwise"
      ]
    },
    {
      "code": "CF_1010_E",
      "name": "Store",
      "url": "https://codeforces.com/contest/1010/problem/E",
      "judge": "Codeforces",
      "tags": [
        "sweep_line",
        "2_pointers",
        "fenwick"
      ]
    },
    {
      "code": "CF_1011_D",
      "name": "Rocket",
      "url": "https://codeforces.com/contest/1011/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "interactive"
      ]
    },
    {
      "code": "CF_1011_E",
      "name": "Border",
      "url": "https://codeforces.com/contest/1011/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1012_C",
      "name": "Hills",
      "url": "https://codeforces.com/contest/1012/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1012_E",
      "name": "Cycle sort",
      "url": "https://codeforces.com/contest/1012/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_1013_E",
      "name": "Hills",
      "url": "https://codeforces.com/contest/1013/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1015_E1",
      "name": "Stars Drawing (Easy Edition)",
      "url": "https://codeforces.com/contest/1015/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1015_E2",
      "name": "Stars Drawing (Hard Edition)",
      "url": "https://codeforces.com/contest/1015/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "brute_force",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1015_F",
      "name": "Bracket Substring",
      "url": "https://codeforces.com/contest/1015/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1016_C",
      "name": "Vasya And The Mushrooms",
      "url": "https://codeforces.com/contest/1016/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1016_D",
      "name": "Vasya And The Matrix",
      "url": "https://codeforces.com/contest/1016/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1016_E",
      "name": "Rest In The Shades",
      "url": "https://codeforces.com/contest/1016/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "CF_1016_F",
      "name": "Road Projects",
      "url": "https://codeforces.com/contest/1016/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1017_E",
      "name": "The Supersonic Rocket",
      "url": "https://codeforces.com/contest/1017/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "geometry",
        "convexhull",
        "kmp"
      ]
    },
    {
      "code": "CF_1017_F",
      "name": "The Neutral Zone",
      "url": "https://codeforces.com/contest/1017/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "bitset",
        "sieve"
      ]
    },
    {
      "code": "CF_1017_G",
      "name": "The Tree",
      "url": "https://codeforces.com/contest/1017/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hld"
      ]
    },
    {
      "code": "CF_1019_C",
      "name": "Sergey's problem",
      "url": "https://codeforces.com/contest/1019/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1019_D",
      "name": "Large Triangle",
      "url": "https://codeforces.com/contest/1019/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "geometry"
      ]
    },
    {
      "code": "CF_1023_E",
      "name": "Down or Right",
      "url": "https://codeforces.com/contest/1023/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1023_F",
      "name": "Mobile Phone Network",
      "url": "https://codeforces.com/contest/1023/problem/F",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "lca",
        "dsu"
      ]
    },
    {
      "code": "CF_1025_D",
      "name": "Recovering BST",
      "url": "https://codeforces.com/contest/1025/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_1025_F",
      "name": "Disjoint Triangles",
      "url": "https://codeforces.com/contest/1025/problem/F",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "sweep_line"
      ]
    },
    {
      "code": "CF_1027_E",
      "name": "Inverse Coloring",
      "url": "https://codeforces.com/contest/1027/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-count"
      ]
    },
    {
      "code": "CF_1027_F",
      "name": "Session in BSU",
      "url": "https://codeforces.com/contest/1027/problem/F",
      "judge": "Codeforces",
      "tags": [
        "matching",
        "matching-hall"
      ]
    },
    {
      "code": "CF_1028_E",
      "name": "Restore Array",
      "url": "https://codeforces.com/contest/1028/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive"
      ]
    },
    {
      "code": "CF_1028_G",
      "name": "Guess the number",
      "url": "https://codeforces.com/contest/1028/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1028_H",
      "name": "Make Square",
      "url": "https://codeforces.com/contest/1028/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_bitmask",
        "sieve"
      ]
    },
    {
      "code": "CF_1029_D",
      "name": "Concatenated Multiples",
      "url": "https://codeforces.com/contest/1029/problem/D",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1029_F",
      "name": "Multicolored Markers",
      "url": "https://codeforces.com/contest/1029/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "geometry",
        "brute_force",
        "number_theory"
      ]
    },
    {
      "code": "CF_1031_D",
      "name": "Minimum path",
      "url": "https://codeforces.com/contest/1031/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_1031_E",
      "name": "Triple Flips",
      "url": "https://codeforces.com/contest/1031/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive"
      ]
    },
    {
      "code": "CF_1032_D",
      "name": "Barcelonian Distance",
      "url": "https://codeforces.com/contest/1032/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "geometry"
      ]
    },
    {
      "code": "CF_1032_E",
      "name": "The Unbearable Lightness of Weights",
      "url": "https://codeforces.com/contest/1032/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1032_F",
      "name": "Vasya and Maximum Matching",
      "url": "https://codeforces.com/contest/1032/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1033_D",
      "name": "Divisors",
      "url": "https://codeforces.com/contest/1033/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "interactive"
      ]
    },
    {
      "code": "CF_1033_E",
      "name": "Hidden Bipartite Graph",
      "url": "https://codeforces.com/contest/1033/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "mst",
        "binary_search",
        "interactive"
      ]
    },
    {
      "code": "CF_1034_B",
      "name": "Little C Loves 3 II",
      "url": "https://codeforces.com/contest/1034/problem/B",
      "judge": "Codeforces",
      "tags": [
        "matching",
        "brute_force",
        "casework"
      ]
    },
    {
      "code": "CF_1034_D",
      "name": "Intervals of Intervals",
      "url": "https://codeforces.com/contest/1034/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "binary_search",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1036_C",
      "name": "Classy Numbers",
      "url": "https://codeforces.com/contest/1036/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp-permutation"
      ]
    },
    {
      "code": "CF_1036_E",
      "name": "Covered Points",
      "url": "https://codeforces.com/contest/1036/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "number_theory",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1036_F",
      "name": "Relatively Prime Powers",
      "url": "https://codeforces.com/contest/1036/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "number_theory",
        "sieve"
      ]
    },
    {
      "code": "CF_1037_D",
      "name": "Valid BFS?",
      "url": "https://codeforces.com/contest/1037/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1037_E",
      "name": "Trips",
      "url": "https://codeforces.com/contest/1037/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph"
      ]
    },
    {
      "code": "CF_1037_F",
      "name": "Maximum Reduction",
      "url": "https://codeforces.com/contest/1037/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "prefix_sum",
        "mono_queue",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1037_H",
      "name": "Security",
      "url": "https://codeforces.com/contest/1037/problem/H",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "suffix_array",
        "binary_search"
      ]
    },
    {
      "code": "CF_1038_D",
      "name": "Slime",
      "url": "https://codeforces.com/contest/1038/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1038_E",
      "name": "Maximum Matching",
      "url": "https://codeforces.com/contest/1038/problem/E",
      "judge": "Codeforces",
      "tags": [
        "euler_tour",
        "dp_bitmask",
        "brute_force"
      ]
    },
    {
      "code": "CF_1039_A",
      "name": "Timetable",
      "url": "https://codeforces.com/contest/1039/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1039_B",
      "name": "Subway Pursuit",
      "url": "https://codeforces.com/contest/1039/problem/B",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "interactive"
      ]
    },
    {
      "code": "CF_1039_C",
      "name": "Network Safety",
      "url": "https://codeforces.com/contest/1039/problem/C",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dsu",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1039_D",
      "name": "You Are Given a Tree",
      "url": "https://codeforces.com/contest/1039/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dp_on_tree",
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_103_C",
      "name": "Russian Roulette",
      "url": "https://codeforces.com/contest/103/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1041_F",
      "name": "Ray in the tube",
      "url": "https://codeforces.com/contest/1041/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dnc"
      ]
    },
    {
      "code": "CF_1042_D",
      "name": "Petya and Array",
      "url": "https://codeforces.com/contest/1042/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "fenwick"
      ]
    },
    {
      "code": "CF_1042_E",
      "name": "Vasya and Magic Matrix",
      "url": "https://codeforces.com/contest/1042/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "dp-count",
        "probability"
      ]
    },
    {
      "code": "CF_1042_F",
      "name": "Leaf Sets",
      "url": "https://codeforces.com/contest/1042/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1043_E",
      "name": "Train Hard, Win Easy",
      "url": "https://codeforces.com/contest/1043/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "combination",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1043_F",
      "name": "Make It One",
      "url": "https://codeforces.com/contest/1043/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "number_theory",
        "dp-sos"
      ]
    },
    {
      "code": "CF_1044_F",
      "name": "DFS",
      "url": "https://codeforces.com/contest/1044/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca"
      ]
    },
    {
      "code": "CF_1045_A",
      "name": "Last chance",
      "url": "https://codeforces.com/contest/1045/problem/A",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "segment_tree"
      ]
    },
    {
      "code": "CF_1045_B",
      "name": "Space Isaac",
      "url": "https://codeforces.com/contest/1045/problem/B",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "kmp",
        "z_func",
        "manacher"
      ]
    },
    {
      "code": "CF_1045_C",
      "name": "Hyperspace Highways",
      "url": "https://codeforces.com/contest/1045/problem/C",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "block_cut_tree",
        "biconnected"
      ]
    },
    {
      "code": "CF_1045_D",
      "name": "Interstellar battle",
      "url": "https://codeforces.com/contest/1045/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sqrt-2way",
        "probability"
      ]
    },
    {
      "code": "CF_1045_G",
      "name": "AI robots",
      "url": "https://codeforces.com/contest/1045/problem/G",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "pbds"
      ]
    },
    {
      "code": "CF_1045_H",
      "name": "Self-exploration",
      "url": "https://codeforces.com/contest/1045/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1046_F",
      "name": "Splitting money",
      "url": "https://codeforces.com/contest/1046/problem/F",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_1051_D",
      "name": "Bicolorings",
      "url": "https://codeforces.com/contest/1051/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1051_F",
      "name": "The Shortest Statement",
      "url": "https://codeforces.com/contest/1051/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "mst",
        "lca",
        "floyd"
      ]
    },
    {
      "code": "CF_1053_B",
      "name": "Vasya and Good Sequences",
      "url": "https://codeforces.com/contest/1053/problem/B",
      "judge": "Codeforces",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "CF_1053_C",
      "name": "Putting Boxes Together",
      "url": "https://codeforces.com/contest/1053/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search"
      ]
    },
    {
      "code": "CF_1054_E",
      "name": "Chips Puzzle",
      "url": "https://codeforces.com/contest/1054/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1055_C",
      "name": "Lucky Days",
      "url": "https://codeforces.com/contest/1055/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_1055_E",
      "name": "Segments on the Line",
      "url": "https://codeforces.com/contest/1055/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_1055_F",
      "name": "Tree and XOR",
      "url": "https://codeforces.com/contest/1055/problem/F",
      "judge": "Codeforces",
      "tags": [
        "bitwise"
      ]
    },
    {
      "code": "CF_1056_C",
      "name": "Pick Heroes",
      "url": "https://codeforces.com/contest/1056/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "interactive",
        "implementation"
      ]
    },
    {
      "code": "CF_1056_F",
      "name": "Write The Contest",
      "url": "https://codeforces.com/contest/1056/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "probability"
      ]
    },
    {
      "code": "CF_1059_D",
      "name": "Nature Reserve",
      "url": "https://codeforces.com/contest/1059/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "geometry"
      ]
    },
    {
      "code": "CF_1059_E",
      "name": "Split the Tree",
      "url": "https://codeforces.com/contest/1059/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "binary_lifting"
      ]
    },
    {
      "code": "CF_1060_D",
      "name": "Social Circles",
      "url": "https://codeforces.com/contest/1060/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1060_E",
      "name": "Sergey and Subway",
      "url": "https://codeforces.com/contest/1060/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "combination"
      ]
    },
    {
      "code": "CF_1060_H",
      "name": "Sophisticated Device",
      "url": "https://codeforces.com/contest/1060/problem/H",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "constructive"
      ]
    },
    {
      "code": "CF_1061_C",
      "name": "Multiplicity",
      "url": "https://codeforces.com/contest/1061/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1061_E",
      "name": "Politics",
      "url": "https://codeforces.com/contest/1061/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_1061_F",
      "name": "Lost Root",
      "url": "https://codeforces.com/contest/1061/problem/F",
      "judge": "Codeforces",
      "tags": [
        "interactive",
        "random"
      ]
    },
    {
      "code": "CF_1062_E",
      "name": "Company",
      "url": "https://codeforces.com/contest/1062/problem/E",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "rmq",
        "sparse_table",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_1063_C",
      "name": "Dwarves, Hats and Extrasensory Abilities",
      "url": "https://codeforces.com/contest/1063/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "geometry",
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1063_F",
      "name": "String Journey",
      "url": "https://codeforces.com/contest/1063/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "suffix_array",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_1065_D",
      "name": "Three Pieces",
      "url": "https://codeforces.com/contest/1065/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1065_E",
      "name": "Side Transmutations",
      "url": "https://codeforces.com/contest/1065/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1065_F",
      "name": "Up and Down the Tree",
      "url": "https://codeforces.com/contest/1065/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1067_A",
      "name": "Array Without Local Maximums",
      "url": "https://codeforces.com/contest/1067/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1067_B",
      "name": "Multihedgehog",
      "url": "https://codeforces.com/contest/1067/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "casework"
      ]
    },
    {
      "code": "CF_1067_C",
      "name": "Knights",
      "url": "https://codeforces.com/contest/1067/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_106_C",
      "name": "Buns",
      "url": "https://codeforces.com/contest/106/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1070_A",
      "name": "Find a Number",
      "url": "https://codeforces.com/contest/1070/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra",
        "dp_digit"
      ]
    },
    {
      "code": "CF_1070_G",
      "name": "Monsters and Potions",
      "url": "https://codeforces.com/contest/1070/problem/G",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1070_I",
      "name": "Privatization of Roads in Berland",
      "url": "https://codeforces.com/contest/1070/problem/I",
      "judge": "Codeforces",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "CF_1070_J",
      "name": "Streets and Avenues in Berhattan",
      "url": "https://codeforces.com/contest/1070/problem/J",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force"
      ]
    },
    {
      "code": "CF_1070_L",
      "name": "Odd Federalization",
      "url": "https://codeforces.com/contest/1070/problem/L",
      "judge": "Codeforces",
      "tags": [
        "bitset",
        "constructive"
      ]
    },
    {
      "code": "CF_1073_D",
      "name": "Berland Fair",
      "url": "https://codeforces.com/contest/1073/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1073_E",
      "name": "Segment Sum",
      "url": "https://codeforces.com/contest/1073/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1073_F",
      "name": "Choosing Two Paths",
      "url": "https://codeforces.com/contest/1073/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1073_G",
      "name": "Yet Another LCP Problem",
      "url": "https://codeforces.com/contest/1073/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "suffix_array"
      ]
    },
    {
      "code": "CF_1074_C",
      "name": "Optimal Polygon Perimeter",
      "url": "https://codeforces.com/contest/1074/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "greedy"
      ]
    },
    {
      "code": "CF_1074_D",
      "name": "Deduction Queries",
      "url": "https://codeforces.com/contest/1074/problem/D",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dsu",
        "bitwise"
      ]
    },
    {
      "code": "CF_1074_F",
      "name": "DFS",
      "url": "https://codeforces.com/contest/1074/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_1076_E",
      "name": "Vasya and a Tree",
      "url": "https://codeforces.com/contest/1076/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "binary_search"
      ]
    },
    {
      "code": "CF_1076_F",
      "name": "Summer Practice Report",
      "url": "https://codeforces.com/contest/1076/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1076_G",
      "name": "Array Game",
      "url": "https://codeforces.com/contest/1076/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1078_C",
      "name": "Vasya and Maximum Matching",
      "url": "https://codeforces.com/contest/1078/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_107_E",
      "name": "Darts",
      "url": "https://codeforces.com/contest/107/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "sweep_line"
      ]
    },
    {
      "code": "CF_1080_D",
      "name": "Olya and magical square",
      "url": "https://codeforces.com/contest/1080/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1080_F",
      "name": "Katya and Segments Sets",
      "url": "https://codeforces.com/contest/1080/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "segtree_persistent"
      ]
    },
    {
      "code": "CF_1081_D",
      "name": "Maximum Distance",
      "url": "https://codeforces.com/contest/1081/problem/D",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dsu"
      ]
    },
    {
      "code": "CF_1081_E",
      "name": "Missing Numbers",
      "url": "https://codeforces.com/contest/1081/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "constructive"
      ]
    },
    {
      "code": "CF_1081_F",
      "name": "Tricky Interactor",
      "url": "https://codeforces.com/contest/1081/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1082_E",
      "name": "Increasing Frequency",
      "url": "https://codeforces.com/contest/1082/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1082_G",
      "name": "Petya and Graph",
      "url": "https://codeforces.com/contest/1082/problem/G",
      "judge": "Codeforces",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "CF_1083_C",
      "name": "Max Mex",
      "url": "https://codeforces.com/contest/1083/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca"
      ]
    },
    {
      "code": "CF_1083_D",
      "name": "The Fair Nut's getting crazy",
      "url": "https://codeforces.com/contest/1083/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1083_E",
      "name": "The Fair Nut and Rectangles",
      "url": "https://codeforces.com/contest/1083/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "CF_1083_F",
      "name": "The Fair Nut and Amusing Xor",
      "url": "https://codeforces.com/contest/1083/problem/F",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_1085_D",
      "name": "Minimum Diameter Tree",
      "url": "https://codeforces.com/contest/1085/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1085_F",
      "name": "Rock-Paper-Scissors Champion",
      "url": "https://codeforces.com/contest/1085/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segtree_walk"
      ]
    },
    {
      "code": "CF_1086_C",
      "name": "Vasya and Templates",
      "url": "https://codeforces.com/contest/1086/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1086_E",
      "name": "Beautiful Matrix",
      "url": "https://codeforces.com/contest/1086/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-permutation",
        "fenwick"
      ]
    },
    {
      "code": "CF_1088_D",
      "name": "Ehab and another another xor problem",
      "url": "https://codeforces.com/contest/1088/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "constructive",
        "bitwise",
        "interactive",
        "implementation"
      ]
    },
    {
      "code": "CF_1088_E",
      "name": "Ehab and a component choosing problem",
      "url": "https://codeforces.com/contest/1088/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1088_F",
      "name": "Ehab and a weird weight formula",
      "url": "https://codeforces.com/contest/1088/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "lca",
        "rmq"
      ]
    },
    {
      "code": "CF_1089_A",
      "name": "Alice the Fan",
      "url": "https://codeforces.com/contest/1089/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1089_B",
      "name": "Bimatching",
      "url": "https://codeforces.com/contest/1089/problem/B",
      "judge": "Codeforces",
      "tags": [
        "matching-general"
      ]
    },
    {
      "code": "CF_1089_C",
      "name": "Cactus Search",
      "url": "https://codeforces.com/contest/1089/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "interactive"
      ]
    },
    {
      "code": "CF_1089_I",
      "name": "Interval-Free Permutations",
      "url": "https://codeforces.com/contest/1089/problem/I",
      "judge": "Codeforces",
      "tags": [
        "dp-permutation"
      ]
    },
    {
      "code": "CF_1089_K",
      "name": "King Kog's Reception",
      "url": "https://codeforces.com/contest/1089/problem/K",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_108_E",
      "name": "Arrangement",
      "url": "https://codeforces.com/contest/108/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "brute_force",
        "dp-count"
      ]
    },
    {
      "code": "CF_1090_E",
      "name": "Horseback Riding",
      "url": "https://codeforces.com/contest/1090/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_1090_F",
      "name": "How to Learn You Score",
      "url": "https://codeforces.com/contest/1090/problem/F",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "math-adhoc",
        "interactive"
      ]
    },
    {
      "code": "CF_1090_J",
      "name": "Two Prefixes",
      "url": "https://codeforces.com/contest/1090/problem/J",
      "judge": "Codeforces",
      "tags": [
        "aho"
      ]
    },
    {
      "code": "CF_1090_K",
      "name": "Right Expansion Of The Mind",
      "url": "https://codeforces.com/contest/1090/problem/K",
      "judge": "Codeforces",
      "tags": [
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1091_D",
      "name": "New Year and the Permutation Concatenation",
      "url": "https://codeforces.com/contest/1091/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1091_E",
      "name": "New Year and the Acquaintance Estimation",
      "url": "https://codeforces.com/contest/1091/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1091_F",
      "name": "New Year and the Mallard Expedition",
      "url": "https://codeforces.com/contest/1091/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1092_D1",
      "name": "Great Vova Wall (Version 1)",
      "url": "https://codeforces.com/contest/1092/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1092_E",
      "name": "Minimal Diameter Forest",
      "url": "https://codeforces.com/contest/1092/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1092_F",
      "name": "Tree with Maximum Cost",
      "url": "https://codeforces.com/contest/1092/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1093_D",
      "name": "Beautiful Graph",
      "url": "https://codeforces.com/contest/1093/problem/D",
      "judge": "Codeforces",
      "tags": [
        "graph"
      ]
    },
    {
      "code": "CF_1093_E",
      "name": "Intersection of Permutations",
      "url": "https://codeforces.com/contest/1093/problem/E",
      "judge": "Codeforces",
      "tags": [
        "fenwick_2d",
        "fenwick",
        "pbds"
      ]
    },
    {
      "code": "CF_1093_G",
      "name": "Multidimensional Queries",
      "url": "https://codeforces.com/contest/1093/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1096_D",
      "name": "Easy Problem",
      "url": "https://codeforces.com/contest/1096/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1096_E",
      "name": "The Top Scorer",
      "url": "https://codeforces.com/contest/1096/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1096_F",
      "name": "Inversion Expectation",
      "url": "https://codeforces.com/contest/1096/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc",
        "probability"
      ]
    },
    {
      "code": "CF_1096_G",
      "name": "Lucky Tickets",
      "url": "https://codeforces.com/contest/1096/problem/G",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_1097_D",
      "name": "Makoto and a Blackboard",
      "url": "https://codeforces.com/contest/1097/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "probability"
      ]
    },
    {
      "code": "CF_1097_E",
      "name": "Egor and an RPG game",
      "url": "https://codeforces.com/contest/1097/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1097_F",
      "name": "Alex and a TV Show",
      "url": "https://codeforces.com/contest/1097/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "bitset",
        "inclusion-exclusion",
        "multiplicative",
        "sieve"
      ]
    },
    {
      "code": "CF_1098_B",
      "name": "Nice table",
      "url": "https://codeforces.com/contest/1098/problem/B",
      "judge": "Codeforces",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "CF_1099_F",
      "name": "Cookies",
      "url": "https://codeforces.com/contest/1099/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "fenwick"
      ]
    },
    {
      "code": "CF_109_C",
      "name": "Lucky Tree",
      "url": "https://codeforces.com/contest/109/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_109_D",
      "name": "Lucky Sorting",
      "url": "https://codeforces.com/contest/109/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1100_E",
      "name": "Andrew and Taxi",
      "url": "https://codeforces.com/contest/1100/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "topo_sort"
      ]
    },
    {
      "code": "CF_1100_F",
      "name": "Ivan and Burgers",
      "url": "https://codeforces.com/contest/1100/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dnc",
        "gauss",
        "bitset"
      ]
    },
    {
      "code": "CF_1101_D",
      "name": "GCD Counting",
      "url": "https://codeforces.com/contest/1101/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1101_E",
      "name": "Polycarp's New Job",
      "url": "https://codeforces.com/contest/1101/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1101_F",
      "name": "Trucks and Cities",
      "url": "https://codeforces.com/contest/1101/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "2_pointers",
        "random"
      ]
    },
    {
      "code": "CF_1101_G",
      "name": "(Zero XOR Subset)-less",
      "url": "https://codeforces.com/contest/1101/problem/G",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1102_F",
      "name": "Elongated Matrix",
      "url": "https://codeforces.com/contest/1102/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1104_D",
      "name": "Game with modulo",
      "url": "https://codeforces.com/contest/1104/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "number_theory",
        "interactive"
      ]
    },
    {
      "code": "CF_1105_E",
      "name": "Helping Hiasat",
      "url": "https://codeforces.com/contest/1105/problem/E",
      "judge": "Codeforces",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "CF_1106_E",
      "name": "Lunar New Year and Red Envelopes",
      "url": "https://codeforces.com/contest/1106/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1106_F",
      "name": "Lunar New Year and a Recursive Sequence",
      "url": "https://codeforces.com/contest/1106/problem/F",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "number_theory",
        "sqrt-babygiant"
      ]
    },
    {
      "code": "CF_1107_F",
      "name": "Vasya and Endless Credits",
      "url": "https://codeforces.com/contest/1107/problem/F",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "dp",
        "flow-mincost"
      ]
    },
    {
      "code": "CF_1107_G",
      "name": "Vasya and Maximum Profit",
      "url": "https://codeforces.com/contest/1107/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_1109_D",
      "name": "Sasha and Interesting Fact from Graph Theory",
      "url": "https://codeforces.com/contest/1109/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1109_E",
      "name": "Sasha and a Very Easy Test",
      "url": "https://codeforces.com/contest/1109/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "extgcd"
      ]
    },
    {
      "code": "CF_110_E",
      "name": "Lucky Tree",
      "url": "https://codeforces.com/contest/110/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dp-count"
      ]
    },
    {
      "code": "CF_1110_D",
      "name": "Jongmah",
      "url": "https://codeforces.com/contest/1110/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1110_E",
      "name": "Magic Stones",
      "url": "https://codeforces.com/contest/1110/problem/E",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "ad_hoc",
        "constructive"
      ]
    },
    {
      "code": "CF_1110_F",
      "name": "Nearest Leaf",
      "url": "https://codeforces.com/contest/1110/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "tree_euler_tour",
        "Centroid"
      ]
    },
    {
      "code": "CF_1111_B",
      "name": "Average Superhero Gang Power",
      "url": "https://codeforces.com/contest/1111/problem/B",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1111_C",
      "name": "Creative Snap",
      "url": "https://codeforces.com/contest/1111/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "binary_search",
        "ad_hoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1111_E",
      "name": "Tree",
      "url": "https://codeforces.com/contest/1111/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1114_C",
      "name": "Trailing Loves (or L'oeufs?)",
      "url": "https://codeforces.com/contest/1114/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1114_D",
      "name": "Flood Fill",
      "url": "https://codeforces.com/contest/1114/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1114_E",
      "name": "Arithmetic Progression",
      "url": "https://codeforces.com/contest/1114/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "interactive",
        "random"
      ]
    },
    {
      "code": "CF_1114_F",
      "name": "Please, another Queries on Array?",
      "url": "https://codeforces.com/contest/1114/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1117_D",
      "name": "Magic Gems",
      "url": "https://codeforces.com/contest/1117/problem/D",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "CF_1117_E",
      "name": "Decypher the String",
      "url": "https://codeforces.com/contest/1117/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1117_F",
      "name": "Crisp String",
      "url": "https://codeforces.com/contest/1117/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1117_G",
      "name": "Recursive Queries",
      "url": "https://codeforces.com/contest/1117/problem/G",
      "judge": "Codeforces",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "CF_1118_C",
      "name": "Palindromic Matrix",
      "url": "https://codeforces.com/contest/1118/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1118_D1",
      "name": "Coffee and Coursework (Easy version)",
      "url": "https://codeforces.com/contest/1118/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "brute_force",
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1118_D2",
      "name": "Coffee and Coursework (Hard Version)",
      "url": "https://codeforces.com/contest/1118/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1118_E",
      "name": "Yet Another Ball Problem",
      "url": "https://codeforces.com/contest/1118/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1118_F1",
      "name": "Tree Cutting (Easy Version)",
      "url": "https://codeforces.com/contest/1118/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "dp_on_tree",
        "implementation"
      ]
    },
    {
      "code": "CF_1119_E",
      "name": "Pavel and Triangles",
      "url": "https://codeforces.com/contest/1119/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1119_F",
      "name": "Niyaz and Small Degrees",
      "url": "https://codeforces.com/contest/1119/problem/F",
      "judge": "Codeforces",
      "tags": [
        "bbst",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1120_D",
      "name": "Power Tree",
      "url": "https://codeforces.com/contest/1120/problem/D",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1129_C",
      "name": "Morse Code",
      "url": "https://codeforces.com/contest/1129/problem/C",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "dp"
      ]
    },
    {
      "code": "CF_1129_D",
      "name": "Isolation",
      "url": "https://codeforces.com/contest/1129/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_1131_F",
      "name": "Asya And Kittens",
      "url": "https://codeforces.com/contest/1131/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu",
        "constructive"
      ]
    },
    {
      "code": "CF_1131_G",
      "name": "Most Dangerous Shark",
      "url": "https://codeforces.com/contest/1131/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "CF_1132_D",
      "name": "Stressful Training",
      "url": "https://codeforces.com/contest/1132/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "pbds",
        "greedy"
      ]
    },
    {
      "code": "CF_1132_F",
      "name": "Clear the String",
      "url": "https://codeforces.com/contest/1132/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1132_G",
      "name": "Greedy Subsequences",
      "url": "https://codeforces.com/contest/1132/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "mono_queue",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_1133_E",
      "name": "K Balanced Teams",
      "url": "https://codeforces.com/contest/1133/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "2_pointers",
        "fenwick"
      ]
    },
    {
      "code": "CF_1133_F2",
      "name": "Spanning Tree with One Fixed Degree",
      "url": "https://codeforces.com/contest/1133/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "greedy",
        "dsu"
      ]
    },
    {
      "code": "CF_1137_C",
      "name": "Museums Tour",
      "url": "https://codeforces.com/contest/1137/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-dag",
        "strongly_connected"
      ]
    },
    {
      "code": "CF_1137_D",
      "name": "Cooperative Game",
      "url": "https://codeforces.com/contest/1137/problem/D",
      "judge": "Codeforces",
      "tags": [
        "function_graph",
        "constructive"
      ]
    },
    {
      "code": "CF_1137_E",
      "name": "Train Car Selection",
      "url": "https://codeforces.com/contest/1137/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "CF_1139_D",
      "name": "Steps to One",
      "url": "https://codeforces.com/contest/1139/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "inclusion-exclusion",
        "probability"
      ]
    },
    {
      "code": "CF_1139_E",
      "name": "Maximize Mex",
      "url": "https://codeforces.com/contest/1139/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "matching",
        "reversal"
      ]
    },
    {
      "code": "CF_1140_F",
      "name": "Extending Set of Points",
      "url": "https://codeforces.com/contest/1140/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dnc",
        "dsu_rollback"
      ]
    },
    {
      "code": "CF_1140_G",
      "name": "Double Tree",
      "url": "https://codeforces.com/contest/1140/problem/G",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "Centroid",
        "binary_lifting",
        "dp"
      ]
    },
    {
      "code": "CF_1141_E",
      "name": "Superhero Battle",
      "url": "https://codeforces.com/contest/1141/problem/E",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1141_F1",
      "name": "Same Sum Blocks (Easy)",
      "url": "https://codeforces.com/contest/1141/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "CF_1141_F2",
      "name": "Same Sum Blocks (Hard)",
      "url": "https://codeforces.com/contest/1141/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "CF_1142_C",
      "name": "U2",
      "url": "https://codeforces.com/contest/1142/problem/C",
      "judge": "Codeforces",
      "tags": [
        "convexhull"
      ]
    },
    {
      "code": "CF_1142_D",
      "name": "Foreigner",
      "url": "https://codeforces.com/contest/1142/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "CF_1143_D",
      "name": "The Beatles",
      "url": "https://codeforces.com/contest/1143/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "number_theory",
        "casework"
      ]
    },
    {
      "code": "CF_1144_F",
      "name": "Graph Without Long Directed Paths",
      "url": "https://codeforces.com/contest/1144/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_1146_F",
      "name": "Leaf Partition",
      "url": "https://codeforces.com/contest/1146/problem/F",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1146_H",
      "name": "Satanic Panic",
      "url": "https://codeforces.com/contest/1146/problem/H",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "bitset"
      ]
    },
    {
      "code": "CF_1148_C",
      "name": "Crazy Diamond",
      "url": "https://codeforces.com/contest/1148/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1148_E",
      "name": "Earth Wind and Fire",
      "url": "https://codeforces.com/contest/1148/problem/E",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "CF_1148_F",
      "name": "Foo Fighters",
      "url": "https://codeforces.com/contest/1148/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1149_B",
      "name": "Three Religions",
      "url": "https://codeforces.com/contest/1149/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1149_C",
      "name": "Tree Generator™",
      "url": "https://codeforces.com/contest/1149/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca"
      ]
    },
    {
      "code": "CF_1149_D",
      "name": "Abandoning Roads",
      "url": "https://codeforces.com/contest/1149/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "mst",
        "dp_bitmask",
        "dsu"
      ]
    },
    {
      "code": "CF_1151_C",
      "name": "Problem for Nazar",
      "url": "https://codeforces.com/contest/1151/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1151_E",
      "name": "Number of Components",
      "url": "https://codeforces.com/contest/1151/problem/E",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_1151_F",
      "name": "Sonya and Informatics",
      "url": "https://codeforces.com/contest/1151/problem/F",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "combination",
        "probability"
      ]
    },
    {
      "code": "CF_1152_C",
      "name": "Neko does Maths",
      "url": "https://codeforces.com/contest/1152/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_1152_D",
      "name": "Neko and Aki's Prank",
      "url": "https://codeforces.com/contest/1152/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1155_D",
      "name": "Beautiful Array",
      "url": "https://codeforces.com/contest/1155/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "greedy",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_1155_E",
      "name": "Guess the Root",
      "url": "https://codeforces.com/contest/1155/problem/E",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "interactive"
      ]
    },
    {
      "code": "CF_1156_D",
      "name": "0-1-Tree",
      "url": "https://codeforces.com/contest/1156/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "Centroid",
        "dsu"
      ]
    },
    {
      "code": "CF_1156_E",
      "name": "Special Segments of Permutation",
      "url": "https://codeforces.com/contest/1156/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dnc",
        "dp-dnc",
        "sparse_table"
      ]
    },
    {
      "code": "CF_1156_F",
      "name": "Card Bag",
      "url": "https://codeforces.com/contest/1156/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "probability"
      ]
    },
    {
      "code": "CF_1157_E",
      "name": "Minimum Array",
      "url": "https://codeforces.com/contest/1157/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1158_B",
      "name": "The minimal unique substring",
      "url": "https://codeforces.com/contest/1158/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "casework"
      ]
    },
    {
      "code": "CF_1158_C",
      "name": "Permutation recovery",
      "url": "https://codeforces.com/contest/1158/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "segment_tree",
        "topo_sort",
        "constructive"
      ]
    },
    {
      "code": "CF_1158_D",
      "name": "Winding polygonal line",
      "url": "https://codeforces.com/contest/1158/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "greedy"
      ]
    },
    {
      "code": "CF_1158_F",
      "name": "Density of subarrays",
      "url": "https://codeforces.com/contest/1158/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_1159_E",
      "name": "Permutation recovery",
      "url": "https://codeforces.com/contest/1159/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1161_C",
      "name": "Thanos Nim",
      "url": "https://codeforces.com/contest/1161/problem/C",
      "judge": "Codeforces",
      "tags": [
        "nim",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_1161_D",
      "name": "Palindrome XOR",
      "url": "https://codeforces.com/contest/1161/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_1163_C1",
      "name": "Power Transmission (Easy Edition)",
      "url": "https://codeforces.com/contest/1163/problem/C1",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "brute_force"
      ]
    },
    {
      "code": "CF_1163_C2",
      "name": "Power Transmission (Hard Edition)",
      "url": "https://codeforces.com/contest/1163/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "geometry",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1163_D",
      "name": "Mysterious Code",
      "url": "https://codeforces.com/contest/1163/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1163_E",
      "name": "Magical Permutation",
      "url": "https://codeforces.com/contest/1163/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1165_E",
      "name": "Two Arrays and Sum of Functions",
      "url": "https://codeforces.com/contest/1165/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy-exchange",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1165_F2",
      "name": "Microtransactions (hard version)",
      "url": "https://codeforces.com/contest/1165/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1166_E",
      "name": "The LCMs Must be Large",
      "url": "https://codeforces.com/contest/1166/problem/E",
      "judge": "Codeforces",
      "tags": [
        "bitset",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1166_F",
      "name": "Vicky's Delivery Service",
      "url": "https://codeforces.com/contest/1166/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dsu"
      ]
    },
    {
      "code": "CF_1167_E",
      "name": "Range Deleting",
      "url": "https://codeforces.com/contest/1167/problem/E",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "binary_search",
        "implementation"
      ]
    },
    {
      "code": "CF_1167_F",
      "name": "Scalar Queries",
      "url": "https://codeforces.com/contest/1167/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "combination",
        "fenwick"
      ]
    },
    {
      "code": "CF_1168_B",
      "name": "Good Triple",
      "url": "https://codeforces.com/contest/1168/problem/B",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "2_pointers",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1168_C",
      "name": "And Reachability",
      "url": "https://codeforces.com/contest/1168/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_1169_C",
      "name": "Increasing by Modulo",
      "url": "https://codeforces.com/contest/1169/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1169_E",
      "name": "And Reachability",
      "url": "https://codeforces.com/contest/1169/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1172_B",
      "name": "Nauuo and Circle",
      "url": "https://codeforces.com/contest/1172/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1172_C2",
      "name": "Nauuo and Pictures (hard version)",
      "url": "https://codeforces.com/contest/1172/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "probability"
      ]
    },
    {
      "code": "CF_1173_E1",
      "name": "Nauuo and Pictures (easy version)",
      "url": "https://codeforces.com/contest/1173/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "probability"
      ]
    },
    {
      "code": "CF_1174_D",
      "name": "Ehab and the Expected XOR Problem",
      "url": "https://codeforces.com/contest/1174/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1174_E",
      "name": "Ehab and the Expected GCD Problem",
      "url": "https://codeforces.com/contest/1174/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "combination",
        "dp-count",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1174_F",
      "name": "Ehab and the Big Finale",
      "url": "https://codeforces.com/contest/1174/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "Centroid",
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1175_E",
      "name": "Minimal Segment Cover",
      "url": "https://codeforces.com/contest/1175/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "greedy",
        "binary_lifting"
      ]
    },
    {
      "code": "CF_1175_F",
      "name": "The Number of Subpermutations",
      "url": "https://codeforces.com/contest/1175/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "brute_force"
      ]
    },
    {
      "code": "CF_1175_G",
      "name": "Yet Another Partiton Problem",
      "url": "https://codeforces.com/contest/1175/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dnc"
      ]
    },
    {
      "code": "CF_1176_D",
      "name": "Recover it!",
      "url": "https://codeforces.com/contest/1176/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "number_theory",
        "greedy",
        "constructive",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_1176_E",
      "name": "Cover it!",
      "url": "https://codeforces.com/contest/1176/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "graph",
        "dsu",
        "implementation"
      ]
    },
    {
      "code": "CF_1176_F",
      "name": "Destroy it!",
      "url": "https://codeforces.com/contest/1176/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1177_B",
      "name": "Digits Sequence (Hard Edition)",
      "url": "https://codeforces.com/contest/1177/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1178_E",
      "name": "Archaeology",
      "url": "https://codeforces.com/contest/1178/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1178_F1",
      "name": "Short Colorful Strip",
      "url": "https://codeforces.com/contest/1178/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "mono_queue",
        "rmq",
        "dsu"
      ]
    },
    {
      "code": "CF_1178_F2",
      "name": "Long Colorful Strip",
      "url": "https://codeforces.com/contest/1178/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1178_G",
      "name": "The Awesomest Vertex",
      "url": "https://codeforces.com/contest/1178/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp-convexhull",
        "tree_euler_tour",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_1179_C",
      "name": "Serge and Dining Room",
      "url": "https://codeforces.com/contest/1179/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1179_E",
      "name": "Alesya and Discrete Math",
      "url": "https://codeforces.com/contest/1179/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dnc",
        "interactive",
        "random"
      ]
    },
    {
      "code": "CF_1180_E",
      "name": "Serge and Dining Room",
      "url": "https://codeforces.com/contest/1180/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "segtree_walk"
      ]
    },
    {
      "code": "CF_1182_D",
      "name": "Complete Mirror",
      "url": "https://codeforces.com/contest/1182/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1182_E",
      "name": "Product Oriented Recurrence",
      "url": "https://codeforces.com/contest/1182/problem/E",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "number_theory"
      ]
    },
    {
      "code": "CF_1183_E",
      "name": "Subsequences (easy version)",
      "url": "https://codeforces.com/contest/1183/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "implementation",
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_1183_F",
      "name": "Topforces Strikes Back",
      "url": "https://codeforces.com/contest/1183/problem/F",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1183_H",
      "name": "Subsequences (hard version)",
      "url": "https://codeforces.com/contest/1183/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1184_C2",
      "name": "Heidi and the Turing Test (Medium)",
      "url": "https://codeforces.com/contest/1184/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sweep_line"
      ]
    },
    {
      "code": "CF_1184_E3",
      "name": "Daleks' Invasion (hard)",
      "url": "https://codeforces.com/contest/1184/problem/E3",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "fenwick",
        "dsu"
      ]
    },
    {
      "code": "CF_1185_C2",
      "name": "Exam in BerSU (hard version)",
      "url": "https://codeforces.com/contest/1185/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1185_D",
      "name": "Extra Element",
      "url": "https://codeforces.com/contest/1185/problem/D",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1185_E",
      "name": "Polycarp and Snakes",
      "url": "https://codeforces.com/contest/1185/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "implementation"
      ]
    },
    {
      "code": "CF_1185_F",
      "name": "Two Pizzas",
      "url": "https://codeforces.com/contest/1185/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "dp-sos",
        "bitwise",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_1185_G1",
      "name": "Playlist for Polycarp (easy version)",
      "url": "https://codeforces.com/contest/1185/problem/G1",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-count",
        "backtrack",
        "implementation"
      ]
    },
    {
      "code": "CF_1186_C",
      "name": "Vus the Cossack and Strings",
      "url": "https://codeforces.com/contest/1186/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1186_F",
      "name": "Vus the Cossack and a Graph",
      "url": "https://codeforces.com/contest/1186/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1187_C",
      "name": "Vasya And Array",
      "url": "https://codeforces.com/contest/1187/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1187_D",
      "name": "Subarray Sorting",
      "url": "https://codeforces.com/contest/1187/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1187_E",
      "name": "Tree Painting",
      "url": "https://codeforces.com/contest/1187/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1187_F",
      "name": "Expected Square Beauty",
      "url": "https://codeforces.com/contest/1187/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "inclusion-exclusion",
        "probability"
      ]
    },
    {
      "code": "CF_1187_G",
      "name": "Gang Up",
      "url": "https://codeforces.com/contest/1187/problem/G",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_1188_B",
      "name": "Count Pairs",
      "url": "https://codeforces.com/contest/1188/problem/B",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "number_theory",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1188_C",
      "name": "Array Beauty",
      "url": "https://codeforces.com/contest/1188/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_118_D",
      "name": "Caesar's Legions",
      "url": "https://codeforces.com/contest/118/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp-count"
      ]
    },
    {
      "code": "CF_118_E",
      "name": "Bertown roads",
      "url": "https://codeforces.com/contest/118/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1190_C",
      "name": "Tokitsukaze and Duel",
      "url": "https://codeforces.com/contest/1190/problem/C",
      "judge": "Codeforces",
      "tags": [
        "game_theory_adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_1190_D",
      "name": "Tokitsukaze and Strange Rectangle",
      "url": "https://codeforces.com/contest/1190/problem/D",
      "judge": "Codeforces",
      "tags": [
        "2_pointers",
        "fenwick",
        "pbds",
        "offline-query"
      ]
    },
    {
      "code": "CF_1191_D",
      "name": "Tokitsukaze, CSL and Stone Game",
      "url": "https://codeforces.com/contest/1191/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_1194_D",
      "name": "1-2-K Game",
      "url": "https://codeforces.com/contest/1194/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1194_F",
      "name": "Crossword Expert",
      "url": "https://codeforces.com/contest/1194/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "probability"
      ]
    },
    {
      "code": "CF_1194_G",
      "name": "Another Meme Problem",
      "url": "https://codeforces.com/contest/1194/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "CF_1195_D2",
      "name": "Submarine in the Rybinsk Sea (hard edition)",
      "url": "https://codeforces.com/contest/1195/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "combination",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1195_E",
      "name": "OpenStreetMap",
      "url": "https://codeforces.com/contest/1195/problem/E",
      "judge": "Codeforces",
      "tags": [
        "mono_queue",
        "2_pointers",
        "implementation"
      ]
    },
    {
      "code": "CF_1195_F",
      "name": "Geometers Anonymous Club",
      "url": "https://codeforces.com/contest/1195/problem/F",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "sweep_line",
        "fenwick",
        "mo-general"
      ]
    },
    {
      "code": "CF_1197_D",
      "name": "Yet Another Subarray Problem",
      "url": "https://codeforces.com/contest/1197/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_1197_E",
      "name": "Culture Code",
      "url": "https://codeforces.com/contest/1197/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_1198_D",
      "name": "Rectangle Painting 1",
      "url": "https://codeforces.com/contest/1198/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1198_E",
      "name": "Rectangle Painting 2",
      "url": "https://codeforces.com/contest/1198/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "CF_1199_F",
      "name": "Rectangle Painting 1",
      "url": "https://codeforces.com/contest/1199/problem/F",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dp"
      ]
    },
    {
      "code": "CF_119_C",
      "name": "Education Reform",
      "url": "https://codeforces.com/contest/119/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_11_B",
      "name": "Jumping Jack",
      "url": "https://codeforces.com/contest/11/problem/B",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_11_D",
      "name": "A Simple Task",
      "url": "https://codeforces.com/contest/11/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1200_D",
      "name": "White Lines",
      "url": "https://codeforces.com/contest/1200/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "2_pointers",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1200_E",
      "name": "Compress Words",
      "url": "https://codeforces.com/contest/1200/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "implementation"
      ]
    },
    {
      "code": "CF_1200_F",
      "name": "Graph Traveler",
      "url": "https://codeforces.com/contest/1200/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1201_D",
      "name": "Treasure Hunting",
      "url": "https://codeforces.com/contest/1201/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy",
        "hard-implementation",
        "implementation"
      ]
    },
    {
      "code": "CF_1202_B",
      "name": "You Are Given a Decimal String...",
      "url": "https://codeforces.com/contest/1202/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "constructive"
      ]
    },
    {
      "code": "CF_1202_D",
      "name": "Print a 1337-string...",
      "url": "https://codeforces.com/contest/1202/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "constructive"
      ]
    },
    {
      "code": "CF_1202_E",
      "name": "You Are Given Some Strings...",
      "url": "https://codeforces.com/contest/1202/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "aho"
      ]
    },
    {
      "code": "CF_1203_D2",
      "name": "Remove the Substring (hard version)",
      "url": "https://codeforces.com/contest/1203/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1203_F1",
      "name": "Complete the Projects (easy version)",
      "url": "https://codeforces.com/contest/1203/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1203_F2",
      "name": "Complete the Projects (hard version)",
      "url": "https://codeforces.com/contest/1203/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1204_E",
      "name": "Natasha, Sasha and the Prefix Sums",
      "url": "https://codeforces.com/contest/1204/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1205_C",
      "name": "Palindromic Paths",
      "url": "https://codeforces.com/contest/1205/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive",
        "interactive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1206_E",
      "name": "Palindromic Paths",
      "url": "https://codeforces.com/contest/1206/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "interactive",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_1206_F",
      "name": "Almost All",
      "url": "https://codeforces.com/contest/1206/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1207_D",
      "name": "Number Of Permutations",
      "url": "https://codeforces.com/contest/1207/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "inclusion-exclusion",
        "implementation"
      ]
    },
    {
      "code": "CF_1207_E",
      "name": "XOR Guessing",
      "url": "https://codeforces.com/contest/1207/problem/E",
      "judge": "Codeforces",
      "tags": [
        "bitwise",
        "math-adhoc",
        "interactive"
      ]
    },
    {
      "code": "CF_1207_F",
      "name": "Remainder Problem",
      "url": "https://codeforces.com/contest/1207/problem/F",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets",
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_1207_G",
      "name": "Indie Album",
      "url": "https://codeforces.com/contest/1207/problem/G",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "aho"
      ]
    },
    {
      "code": "CF_1208_D",
      "name": "Restore Permutation",
      "url": "https://codeforces.com/contest/1208/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "segtree_walk"
      ]
    },
    {
      "code": "CF_1208_E",
      "name": "Let Them Slide",
      "url": "https://codeforces.com/contest/1208/problem/E",
      "judge": "Codeforces",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "CF_1208_F",
      "name": "Bits And Pieces",
      "url": "https://codeforces.com/contest/1208/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy",
        "bitwise"
      ]
    },
    {
      "code": "CF_1209_E1",
      "name": "Rotate Columns (easy version)",
      "url": "https://codeforces.com/contest/1209/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "brute_force",
        "greedy",
        "bitwise"
      ]
    },
    {
      "code": "CF_1209_E2",
      "name": "Rotate Columns (hard version)",
      "url": "https://codeforces.com/contest/1209/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_1209_F",
      "name": "Koala and Notebook",
      "url": "https://codeforces.com/contest/1209/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "trie",
        "lca",
        "dijkstra"
      ]
    },
    {
      "code": "CF_1211_D",
      "name": "Teams",
      "url": "https://codeforces.com/contest/1211/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_1213_E",
      "name": "Two Small Strings",
      "url": "https://codeforces.com/contest/1213/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive",
        "casework"
      ]
    },
    {
      "code": "CF_1213_F",
      "name": "Unstable String Sort",
      "url": "https://codeforces.com/contest/1213/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_1213_G",
      "name": "Path Queries",
      "url": "https://codeforces.com/contest/1213/problem/G",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dsu",
        "offline-query"
      ]
    },
    {
      "code": "CF_1214_E",
      "name": "Petya and Construction Set",
      "url": "https://codeforces.com/contest/1214/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1214_F",
      "name": "Employment",
      "url": "https://codeforces.com/contest/1214/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "sweep_line"
      ]
    },
    {
      "code": "CF_1214_G",
      "name": "Feeling Good",
      "url": "https://codeforces.com/contest/1214/problem/G",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "bitset",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1214_H",
      "name": "Tiles Placement",
      "url": "https://codeforces.com/contest/1214/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "constructive"
      ]
    },
    {
      "code": "CF_1215_E",
      "name": "Marbles",
      "url": "https://codeforces.com/contest/1215/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1215_F",
      "name": "Radio Stations",
      "url": "https://codeforces.com/contest/1215/problem/F",
      "judge": "Codeforces",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "CF_1216_C",
      "name": "White Sheet",
      "url": "https://codeforces.com/contest/1216/problem/C",
      "judge": "Codeforces",
      "tags": [
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1216_E2",
      "name": "Numerical Sequence (hard version)",
      "url": "https://codeforces.com/contest/1216/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "number_theory"
      ]
    },
    {
      "code": "CF_1216_F",
      "name": "Wi-Fi",
      "url": "https://codeforces.com/contest/1216/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "mono_queue"
      ]
    },
    {
      "code": "CF_1217_C",
      "name": "The Number Of Good Substrings",
      "url": "https://codeforces.com/contest/1217/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "bitwise"
      ]
    },
    {
      "code": "CF_1217_D",
      "name": "Coloring Edges",
      "url": "https://codeforces.com/contest/1217/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1217_F",
      "name": "Forced Online Queries Problem",
      "url": "https://codeforces.com/contest/1217/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dsu",
        "sqrt-buckets",
        "sqrt-time"
      ]
    },
    {
      "code": "CF_1218_D",
      "name": "Xor Spanning Tree",
      "url": "https://codeforces.com/contest/1218/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_1218_H",
      "name": "Function Composition",
      "url": "https://codeforces.com/contest/1218/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "function_graph"
      ]
    },
    {
      "code": "CF_1218_I",
      "name": "The Light Square",
      "url": "https://codeforces.com/contest/1218/problem/I",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "2sat",
        "casework"
      ]
    },
    {
      "code": "CF_1219_C",
      "name": "Periodic integer number",
      "url": "https://codeforces.com/contest/1219/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1219_D",
      "name": "Workout plan",
      "url": "https://codeforces.com/contest/1219/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_1220_E",
      "name": "Tourism",
      "url": "https://codeforces.com/contest/1220/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1220_F",
      "name": "Gardener Alex",
      "url": "https://codeforces.com/contest/1220/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search"
      ]
    },
    {
      "code": "CF_1221_D",
      "name": "Make The Fence Great Again",
      "url": "https://codeforces.com/contest/1221/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1221_F",
      "name": "Choose a Square",
      "url": "https://codeforces.com/contest/1221/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sweep_line"
      ]
    },
    {
      "code": "CF_1223_D",
      "name": "Sequence Sorting",
      "url": "https://codeforces.com/contest/1223/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1223_F",
      "name": "Stack Exterminable Arrays",
      "url": "https://codeforces.com/contest/1223/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_1225_E",
      "name": "Rock Is Push",
      "url": "https://codeforces.com/contest/1225/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1228_C",
      "name": "Primes and Multiplication",
      "url": "https://codeforces.com/contest/1228/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1228_D",
      "name": "Complete Tripartite",
      "url": "https://codeforces.com/contest/1228/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1228_E",
      "name": "Another Filling the Grid",
      "url": "https://codeforces.com/contest/1228/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1228_F",
      "name": "One Node is Gone",
      "url": "https://codeforces.com/contest/1228/problem/F",
      "judge": "Codeforces",
      "tags": [
        "graph",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1229_C",
      "name": "Konrad and Company Evaluation",
      "url": "https://codeforces.com/contest/1229/problem/C",
      "judge": "Codeforces",
      "tags": [
        "graph"
      ]
    },
    {
      "code": "CF_1229_D",
      "name": "Wojtek and Card Tricks",
      "url": "https://codeforces.com/contest/1229/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1229_E1",
      "name": "Marek and Matching (easy version)",
      "url": "https://codeforces.com/contest/1229/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "dp-sos",
        "probability"
      ]
    },
    {
      "code": "CF_1230_C",
      "name": "Anadi and Domino",
      "url": "https://codeforces.com/contest/1230/problem/C",
      "judge": "Codeforces",
      "tags": [
        "graph",
        "backtrack"
      ]
    },
    {
      "code": "CF_1234_F",
      "name": "Yet Another Substring Reverse",
      "url": "https://codeforces.com/contest/1234/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp-sos"
      ]
    },
    {
      "code": "CF_1236_D",
      "name": "Alice and the Doll",
      "url": "https://codeforces.com/contest/1236/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1236_F",
      "name": "Alice and the Cactus",
      "url": "https://codeforces.com/contest/1236/problem/F",
      "judge": "Codeforces",
      "tags": [
        "probability"
      ]
    },
    {
      "code": "CF_1237_C1",
      "name": "Balanced Removals (Easier)",
      "url": "https://codeforces.com/contest/1237/problem/C1",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1237_C2",
      "name": "Balanced Removals (Harder)",
      "url": "https://codeforces.com/contest/1237/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "dp-dnc",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1237_D",
      "name": "Balanced Playlist",
      "url": "https://codeforces.com/contest/1237/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "2_pointers",
        "rmq",
        "implementation"
      ]
    },
    {
      "code": "CF_1237_E",
      "name": "Balanced Binary Search Trees",
      "url": "https://codeforces.com/contest/1237/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1237_F",
      "name": "Balanced Domino Placements",
      "url": "https://codeforces.com/contest/1237/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_1237_H",
      "name": "Balanced Reversals",
      "url": "https://codeforces.com/contest/1237/problem/H",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1238_D",
      "name": "AB-string",
      "url": "https://codeforces.com/contest/1238/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1238_E",
      "name": "Keyboard Purchase",
      "url": "https://codeforces.com/contest/1238/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1238_F",
      "name": "The Maximum Subtree",
      "url": "https://codeforces.com/contest/1238/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1238_G",
      "name": "Adilbek and the Watering System",
      "url": "https://codeforces.com/contest/1238/problem/G",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1239_B",
      "name": "The World Is Just a Programming Task (Hard Version)",
      "url": "https://codeforces.com/contest/1239/problem/B",
      "judge": "Codeforces",
      "tags": [
        "hard-implementation"
      ]
    },
    {
      "code": "CF_1239_C",
      "name": "Queue in the Train",
      "url": "https://codeforces.com/contest/1239/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1239_D",
      "name": "Catowice City",
      "url": "https://codeforces.com/contest/1239/problem/D",
      "judge": "Codeforces",
      "tags": [
        "strongly_connected"
      ]
    },
    {
      "code": "CF_1239_E",
      "name": "Turtle",
      "url": "https://codeforces.com/contest/1239/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1240_D",
      "name": "Stack Exterminable Arrays",
      "url": "https://codeforces.com/contest/1240/problem/D",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "dnc"
      ]
    },
    {
      "code": "CF_1242_B",
      "name": "0-1 MST",
      "url": "https://codeforces.com/contest/1242/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_1242_C",
      "name": "Sum Balance",
      "url": "https://codeforces.com/contest/1242/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1244_C",
      "name": "The Football Season",
      "url": "https://codeforces.com/contest/1244/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "number_theory"
      ]
    },
    {
      "code": "CF_1244_E",
      "name": "Minimizing Difference",
      "url": "https://codeforces.com/contest/1244/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "2_pointers",
        "constructive"
      ]
    },
    {
      "code": "CF_1244_F",
      "name": "Chips",
      "url": "https://codeforces.com/contest/1244/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1244_G",
      "name": "Running in Pairs",
      "url": "https://codeforces.com/contest/1244/problem/G",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1245_F",
      "name": "Daniel and Spring Cleaning",
      "url": "https://codeforces.com/contest/1245/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "combination",
        "bitwise"
      ]
    },
    {
      "code": "CF_1246_D",
      "name": "Tree Factory",
      "url": "https://codeforces.com/contest/1246/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1246_E",
      "name": "To Make 1",
      "url": "https://codeforces.com/contest/1246/problem/E",
      "judge": "Codeforces",
      "tags": [
        "bitset"
      ]
    },
    {
      "code": "CF_1248_D1",
      "name": "The World Is Just a Programming Task (Easy Version)",
      "url": "https://codeforces.com/contest/1248/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1249_D1",
      "name": "Too Many Segments (easy version)",
      "url": "https://codeforces.com/contest/1249/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1249_D2",
      "name": "Too Many Segments (hard version)",
      "url": "https://codeforces.com/contest/1249/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "mono_queue",
        "greedy"
      ]
    },
    {
      "code": "CF_1249_E",
      "name": "By Elevator or Stairs?",
      "url": "https://codeforces.com/contest/1249/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1249_F",
      "name": "Maximum Weight Subset",
      "url": "https://codeforces.com/contest/1249/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1250_E",
      "name": "The Coronation",
      "url": "https://codeforces.com/contest/1250/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "2sat",
        "graph"
      ]
    },
    {
      "code": "CF_1250_I",
      "name": "Show Must Go On",
      "url": "https://codeforces.com/contest/1250/problem/I",
      "judge": "Codeforces",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "CF_1250_M",
      "name": "SmartGarden",
      "url": "https://codeforces.com/contest/1250/problem/M",
      "judge": "Codeforces",
      "tags": [
        "dnc",
        "constructive"
      ]
    },
    {
      "code": "CF_1251_D",
      "name": "Salary Changing",
      "url": "https://codeforces.com/contest/1251/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1251_E1",
      "name": "Voting (Easy Version)",
      "url": "https://codeforces.com/contest/1251/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1251_E2",
      "name": "Voting (Hard Version)",
      "url": "https://codeforces.com/contest/1251/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_1251_F",
      "name": "Red-White Fence",
      "url": "https://codeforces.com/contest/1251/problem/F",
      "judge": "Codeforces",
      "tags": [
        "fft",
        "combination"
      ]
    },
    {
      "code": "CF_1252_B",
      "name": "Cleaning Robots",
      "url": "https://codeforces.com/contest/1252/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "combination"
      ]
    },
    {
      "code": "CF_1252_D",
      "name": "Find String in a Grid",
      "url": "https://codeforces.com/contest/1252/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "trie",
        "suffix_array",
        "binary_search",
        "sweep_line",
        "aho",
        "small-to-large",
        "offline-query"
      ]
    },
    {
      "code": "CF_1252_E",
      "name": "Songwriter",
      "url": "https://codeforces.com/contest/1252/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1252_F",
      "name": "Regular Forestation",
      "url": "https://codeforces.com/contest/1252/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "hash",
        "Centroid",
        "isomorphism"
      ]
    },
    {
      "code": "CF_1252_G",
      "name": "Performance Review",
      "url": "https://codeforces.com/contest/1252/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1252_H",
      "name": "Twin Buildings",
      "url": "https://codeforces.com/contest/1252/problem/H",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1252_J",
      "name": "Tiling Terrace",
      "url": "https://codeforces.com/contest/1252/problem/J",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1252_K",
      "name": "Addition Robot",
      "url": "https://codeforces.com/contest/1252/problem/K",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_1252_L",
      "name": "Road Construction",
      "url": "https://codeforces.com/contest/1252/problem/L",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "flow",
        "flow-mincost",
        "flow-demands"
      ]
    },
    {
      "code": "CF_1253_D",
      "name": "Harmonious Graph",
      "url": "https://codeforces.com/contest/1253/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "dsu",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1253_F",
      "name": "Cheap Robot",
      "url": "https://codeforces.com/contest/1253/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "mst",
        "lca",
        "dsu"
      ]
    },
    {
      "code": "CF_1254_B1",
      "name": "Send Boxes to Alice (Easy Version)",
      "url": "https://codeforces.com/contest/1254/problem/B1",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "greedy",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1254_B2",
      "name": "Send Boxes to Alice (Hard Version)",
      "url": "https://codeforces.com/contest/1254/problem/B2",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "greedy",
        "2_pointers",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1254_C",
      "name": "Point Ordering",
      "url": "https://codeforces.com/contest/1254/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "interactive"
      ]
    },
    {
      "code": "CF_1254_D",
      "name": "Tree Queries",
      "url": "https://codeforces.com/contest/1254/problem/D",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "binary_search",
        "fenwick",
        "sqrt-2way",
        "probability"
      ]
    },
    {
      "code": "CF_1254_E",
      "name": "Send Tree to Charlie",
      "url": "https://codeforces.com/contest/1254/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "combination",
        "lca",
        "dsu"
      ]
    },
    {
      "code": "CF_1255_D",
      "name": "Feeding Chicken",
      "url": "https://codeforces.com/contest/1255/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1255_E1",
      "name": "Send Boxes to Alice (Easy Version)",
      "url": "https://codeforces.com/contest/1255/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1256_C",
      "name": "Platforms Jumping",
      "url": "https://codeforces.com/contest/1256/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1256_E",
      "name": "Yet Another Division Into Teams",
      "url": "https://codeforces.com/contest/1256/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "greedy",
        "fenwick",
        "implementation"
      ]
    },
    {
      "code": "CF_1256_F",
      "name": "Equalizing Two Strings",
      "url": "https://codeforces.com/contest/1256/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1257_D",
      "name": "Yet Another Monster Killing Problem",
      "url": "https://codeforces.com/contest/1257/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1257_E",
      "name": "The Contest",
      "url": "https://codeforces.com/contest/1257/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1257_F",
      "name": "Make Them Similar",
      "url": "https://codeforces.com/contest/1257/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "brute_force",
        "meet-in-the-middle",
        "bitwise"
      ]
    },
    {
      "code": "CF_1257_G",
      "name": "Divisor Set",
      "url": "https://codeforces.com/contest/1257/problem/G",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "number_theory",
        "dnc",
        "fft"
      ]
    },
    {
      "code": "CF_1260_E",
      "name": "Tournament",
      "url": "https://codeforces.com/contest/1260/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1260_F",
      "name": "Colored Tree",
      "url": "https://codeforces.com/contest/1260/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "fenwick",
        "Centroid",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1261_C",
      "name": "Arson In Berland Forest",
      "url": "https://codeforces.com/contest/1261/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1261_D1",
      "name": "Wrong Answer on test 233 (Easy Version)",
      "url": "https://codeforces.com/contest/1261/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1261_D2",
      "name": "Wrong Answer on test 233 (Hard Version)",
      "url": "https://codeforces.com/contest/1261/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "fft",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1261_E",
      "name": "Not Same",
      "url": "https://codeforces.com/contest/1261/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1261_F",
      "name": "Xor-Set",
      "url": "https://codeforces.com/contest/1261/problem/F",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "sweep_line",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1263_E",
      "name": "Editor",
      "url": "https://codeforces.com/contest/1263/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1263_F",
      "name": "Economic Difficulties",
      "url": "https://codeforces.com/contest/1263/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "flow",
        "dp_on_tree",
        "lca",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_1264_C",
      "name": "Beautiful Mirrors with queries",
      "url": "https://codeforces.com/contest/1264/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "probability"
      ]
    },
    {
      "code": "CF_1264_D1",
      "name": "Beautiful Bracket Sequence (easy version)",
      "url": "https://codeforces.com/contest/1264/problem/D1",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-count"
      ]
    },
    {
      "code": "CF_1264_D2",
      "name": "Beautiful Bracket Sequence (hard version)",
      "url": "https://codeforces.com/contest/1264/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1264_E",
      "name": "Beautiful League",
      "url": "https://codeforces.com/contest/1264/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_1265_D",
      "name": "Beautiful Sequence",
      "url": "https://codeforces.com/contest/1265/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1266_D",
      "name": "Decreasing Debts",
      "url": "https://codeforces.com/problemset/problem/1266/D",
      "judge": "Codeforces",
      "tags": [
        "graph"
      ]
    },
    {
      "code": "CF_1266_E",
      "name": "Spaceship Solitaire",
      "url": "https://codeforces.com/contest/1266/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1266_F",
      "name": "Almost Same Distance",
      "url": "https://codeforces.com/contest/1266/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1267_A",
      "name": "Apprentice Learning Trajectory",
      "url": "https://codeforces.com/contest/1267/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1267_F",
      "name": "Foolprüf Security",
      "url": "https://codeforces.com/contest/1267/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1267_I",
      "name": "Intriguing Selection",
      "url": "https://codeforces.com/contest/1267/problem/I",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1267_K",
      "name": "Key Storage",
      "url": "https://codeforces.com/contest/1267/problem/K",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1268_B",
      "name": "Domino for Young",
      "url": "https://codeforces.com/contest/1268/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1268_C",
      "name": "K Integers",
      "url": "https://codeforces.com/contest/1268/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1268_E",
      "name": "Happy Cactus",
      "url": "https://codeforces.com/contest/1268/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "cactus_graph"
      ]
    },
    {
      "code": "CF_1269_D",
      "name": "Domino for Young",
      "url": "https://codeforces.com/contest/1269/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_126_B",
      "name": "Password",
      "url": "https://codeforces.com/contest/126/problem/B",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "binary_search",
        "z_func"
      ]
    },
    {
      "code": "CF_1270_D",
      "name": "Strange Device",
      "url": "https://codeforces.com/contest/1270/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1270_E",
      "name": "Divide Points",
      "url": "https://codeforces.com/contest/1270/problem/E",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "number_theory",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1270_F",
      "name": "Awesome Substrings",
      "url": "https://codeforces.com/contest/1270/problem/F",
      "judge": "Codeforces",
      "tags": [
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_1270_G",
      "name": "Subset with Zero Sum",
      "url": "https://codeforces.com/contest/1270/problem/G",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "function_graph",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1270_H",
      "name": "Number of Components",
      "url": "https://codeforces.com/contest/1270/problem/H",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1271_D",
      "name": "Portals",
      "url": "https://codeforces.com/contest/1271/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_1272_E",
      "name": "Nearest Opposite Parity",
      "url": "https://codeforces.com/contest/1272/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_1272_F",
      "name": "Two Bracket Sequences",
      "url": "https://codeforces.com/contest/1272/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1276_B",
      "name": "Two Fairs",
      "url": "https://codeforces.com/problemset/problem/1276/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph",
        "dsu"
      ]
    },
    {
      "code": "CF_1276_C",
      "name": "Beautiful Rectangle",
      "url": "https://codeforces.com/contest/1276/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive"
      ]
    },
    {
      "code": "CF_1276_D",
      "name": "Tree Elimination",
      "url": "https://codeforces.com/contest/1276/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1276_F",
      "name": "Asterisk Substrings",
      "url": "https://codeforces.com/contest/1276/problem/F",
      "judge": "Codeforces",
      "tags": [
        "suffix_array",
        "small-to-large"
      ]
    },
    {
      "code": "CF_1278_F",
      "name": "Cards",
      "url": "https://codeforces.com/contest/1278/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1279_D",
      "name": "Santa's Bot",
      "url": "https://codeforces.com/contest/1279/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "probability",
        "implementation"
      ]
    },
    {
      "code": "CF_1279_F",
      "name": "New Year and Handle Change",
      "url": "https://codeforces.com/contest/1279/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dp-alien"
      ]
    },
    {
      "code": "CF_1280_B",
      "name": "Beingawesomeism",
      "url": "https://codeforces.com/contest/1280/problem/B",
      "judge": "Codeforces",
      "tags": [
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1280_C",
      "name": "Jeremy Bearimy",
      "url": "https://codeforces.com/contest/1280/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1280_D",
      "name": "Miss Punyverse",
      "url": "https://codeforces.com/contest/1280/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dp-tree-knapsack"
      ]
    },
    {
      "code": "CF_1280_E",
      "name": "Kirchhoff's Current Loss",
      "url": "https://codeforces.com/contest/1280/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1282_E",
      "name": "The Cake Is a Lie",
      "url": "https://codeforces.com/contest/1282/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1283_E",
      "name": "New Year Parties",
      "url": "https://codeforces.com/contest/1283/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1283_F",
      "name": "DIY Garland",
      "url": "https://codeforces.com/contest/1283/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1284_C",
      "name": "New Year and Permutation",
      "url": "https://codeforces.com/contest/1284/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1284_D",
      "name": "New Year and Conference",
      "url": "https://codeforces.com/contest/1284/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "sweep_line",
        "implementation"
      ]
    },
    {
      "code": "CF_1284_E",
      "name": "New Year and Castle Construction",
      "url": "https://codeforces.com/contest/1284/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "sweep_line",
        "combination"
      ]
    },
    {
      "code": "CF_1284_F",
      "name": "New Year and Social Network",
      "url": "https://codeforces.com/contest/1284/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "ad_hoc",
        "greedy",
        "dsu",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1285_D",
      "name": "Dr. Evil Underscores",
      "url": "https://codeforces.com/contest/1285/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dnc",
        "bitwise"
      ]
    },
    {
      "code": "CF_1285_E",
      "name": "Delete a Segment",
      "url": "https://codeforces.com/contest/1285/problem/E",
      "judge": "Codeforces",
      "tags": [
        "2_pointers",
        "fenwick",
        "graph"
      ]
    },
    {
      "code": "CF_1285_F",
      "name": "Classical?",
      "url": "https://codeforces.com/contest/1285/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "mobius"
      ]
    },
    {
      "code": "CF_1286_B",
      "name": "Numbers on Tree",
      "url": "https://codeforces.com/contest/1286/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1286_C1",
      "name": "Madhouse (Easy version)",
      "url": "https://codeforces.com/contest/1286/problem/C1",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "math-adhoc",
        "interactive"
      ]
    },
    {
      "code": "CF_1286_D",
      "name": "LCC",
      "url": "https://codeforces.com/contest/1286/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "matrix_mul",
        "math-adhoc",
        "probability"
      ]
    },
    {
      "code": "CF_1286_E",
      "name": "Fedya the Potter Strikes Back",
      "url": "https://codeforces.com/contest/1286/problem/E",
      "judge": "Codeforces",
      "tags": [
        "kmp"
      ]
    },
    {
      "code": "CF_1288_D",
      "name": "Minimax Problem",
      "url": "https://codeforces.com/contest/1288/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "bitwise"
      ]
    },
    {
      "code": "CF_128_E",
      "name": "Birthday",
      "url": "https://codeforces.com/contest/128/problem/E",
      "judge": "Codeforces",
      "tags": [
        "sweep_line",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_1290_B",
      "name": "Irreducible Anagrams",
      "url": "https://codeforces.com/contest/1290/problem/B",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_1290_C",
      "name": "Prefix Enlightenment",
      "url": "https://codeforces.com/contest/1290/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_1290_D",
      "name": "Coffee Varieties (hard version)",
      "url": "https://codeforces.com/contest/1290/problem/D",
      "judge": "Codeforces",
      "tags": [
        "interactive"
      ]
    },
    {
      "code": "CF_1290_E",
      "name": "Cartesian Tree",
      "url": "https://codeforces.com/contest/1290/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segtree_beats"
      ]
    },
    {
      "code": "CF_1292_C",
      "name": "Xenon's Attack on the Gangs",
      "url": "https://codeforces.com/contest/1292/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "combination"
      ]
    },
    {
      "code": "CF_1292_D",
      "name": "Chaotic V.",
      "url": "https://codeforces.com/contest/1292/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "binary_search",
        "lca",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1292_F",
      "name": "Nora's Toy Boxes",
      "url": "https://codeforces.com/contest/1292/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1293_D",
      "name": "Aroma's Search",
      "url": "https://codeforces.com/contest/1293/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive"
      ]
    },
    {
      "code": "CF_1294_E",
      "name": "Obtain a Permutation",
      "url": "https://codeforces.com/contest/1294/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1294_F",
      "name": "Three Paths on a Tree",
      "url": "https://codeforces.com/contest/1294/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1295_B",
      "name": "Infinite Prefixes",
      "url": "https://codeforces.com/contest/1295/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "math-adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_1295_D",
      "name": "Same GCDs",
      "url": "https://codeforces.com/contest/1295/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1295_F",
      "name": "Good Contest",
      "url": "https://codeforces.com/contest/1295/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "dp-count",
        "probability"
      ]
    },
    {
      "code": "CF_1296_E2",
      "name": "String Coloring (hard version)",
      "url": "https://codeforces.com/contest/1296/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_1296_F",
      "name": "Berland Beauty",
      "url": "https://codeforces.com/contest/1296/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "hld",
        "lca"
      ]
    },
    {
      "code": "CF_1299_B",
      "name": "Aerodynamic",
      "url": "https://codeforces.com/contest/1299/problem/B",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1299_C",
      "name": "Water Balance",
      "url": "https://codeforces.com/contest/1299/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy-more"
      ]
    },
    {
      "code": "CF_1299_D",
      "name": "Around the World",
      "url": "https://codeforces.com/contest/1299/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_129_D",
      "name": "String",
      "url": "https://codeforces.com/contest/129/problem/D",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_12_E",
      "name": "Start of the session",
      "url": "https://codeforces.com/contest/12/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1300_D",
      "name": "Aerodynamic",
      "url": "https://codeforces.com/contest/1300/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "CF_1301_C",
      "name": "Ayoub's function",
      "url": "https://codeforces.com/contest/1301/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "combination",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1301_D",
      "name": "Time to Run",
      "url": "https://codeforces.com/contest/1301/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1301_E",
      "name": "Nanosoft",
      "url": "https://codeforces.com/contest/1301/problem/E",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dp",
        "binary_search",
        "rmq",
        "binary_lifting",
        "implementation"
      ]
    },
    {
      "code": "CF_1301_F",
      "name": "Super Jaber",
      "url": "https://codeforces.com/contest/1301/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_1303_D",
      "name": "Fill The Bag",
      "url": "https://codeforces.com/contest/1303/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "greedy",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_1303_E",
      "name": "Erase Subsequences",
      "url": "https://codeforces.com/contest/1303/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1303_F",
      "name": "Number of Components",
      "url": "https://codeforces.com/contest/1303/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_1303_G",
      "name": "Sum of Prefix Sums",
      "url": "https://codeforces.com/contest/1303/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "convexhull",
        "Centroid"
      ]
    },
    {
      "code": "CF_1304_E",
      "name": "1-Trees and Queries",
      "url": "https://codeforces.com/contest/1304/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "lca",
        "cycle",
        "casework"
      ]
    },
    {
      "code": "CF_1304_F1",
      "name": "Animal Observation (easy version)",
      "url": "https://codeforces.com/contest/1304/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1304_F2",
      "name": "Animal Observation (hard version)",
      "url": "https://codeforces.com/contest/1304/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_1305_D",
      "name": "Kuroni and the Celebration",
      "url": "https://codeforces.com/contest/1305/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "interactive"
      ]
    },
    {
      "code": "CF_1305_E",
      "name": "Kuroni and the Score Distribution",
      "url": "https://codeforces.com/contest/1305/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_1305_F",
      "name": "Kuroni and the Punishment",
      "url": "https://codeforces.com/contest/1305/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "probability",
        "random"
      ]
    },
    {
      "code": "CF_1305_G",
      "name": "Kuroni and Antihype",
      "url": "https://codeforces.com/contest/1305/problem/G",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "dp-sos",
        "dsu",
        "boruvka"
      ]
    },
    {
      "code": "CF_1307_D",
      "name": "Cow and Fields",
      "url": "https://codeforces.com/contest/1307/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra",
        "dp",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1307_E",
      "name": "Cow and Treats",
      "url": "https://codeforces.com/contest/1307/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_1307_F",
      "name": "Cow and Vacation",
      "url": "https://codeforces.com/contest/1307/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_1310_B",
      "name": "Double Elimination",
      "url": "https://codeforces.com/contest/1310/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "implementation"
      ]
    },
    {
      "code": "CF_1311_D",
      "name": "Three Integers",
      "url": "https://codeforces.com/contest/1311/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_1311_E",
      "name": "Construct the Binary Tree",
      "url": "https://codeforces.com/contest/1311/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1311_F",
      "name": "Moving Points",
      "url": "https://codeforces.com/contest/1311/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dnc",
        "fenwick"
      ]
    },
    {
      "code": "CF_1312_D",
      "name": "Count the Arrays",
      "url": "https://codeforces.com/contest/1312/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1312_E",
      "name": "Array Shrinking",
      "url": "https://codeforces.com/contest/1312/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1312_F",
      "name": "Attack on Red Kingdom",
      "url": "https://codeforces.com/contest/1312/problem/F",
      "judge": "Codeforces",
      "tags": [
        "Grundy",
        "static-data"
      ]
    },
    {
      "code": "CF_1312_G",
      "name": "Autocompletion",
      "url": "https://codeforces.com/contest/1312/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "trie",
        "dp",
        "aho"
      ]
    },
    {
      "code": "CF_1313_B",
      "name": "Different Rules",
      "url": "https://codeforces.com/contest/1313/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1313_C2",
      "name": "Skyscrapers (hard version)",
      "url": "https://codeforces.com/contest/1313/problem/C2",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_1313_D",
      "name": "Happy New Year",
      "url": "https://codeforces.com/contest/1313/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_1313_E",
      "name": "Concatenation with intersection",
      "url": "https://codeforces.com/contest/1313/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "fenwick",
        "z_func"
      ]
    },
    {
      "code": "CF_1314_B",
      "name": "Double Elimination",
      "url": "https://codeforces.com/contest/1314/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1314_C",
      "name": "Au Pont Rouge",
      "url": "https://codeforces.com/contest/1314/problem/C",
      "judge": "Codeforces",
      "tags": [
        "suffix_array",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_1314_D",
      "name": "Tourism",
      "url": "https://codeforces.com/contest/1314/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "cycle",
        "backtrack",
        "random"
      ]
    },
    {
      "code": "CF_1316_C",
      "name": "Primitive Primes",
      "url": "https://codeforces.com/contest/1316/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive",
        "math-adhoc",
        "implementation",
        "ternary-search"
      ]
    },
    {
      "code": "CF_1316_D",
      "name": "Nash Matrix",
      "url": "https://codeforces.com/contest/1316/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "implementation"
      ]
    },
    {
      "code": "CF_1316_E",
      "name": "Team Building",
      "url": "https://codeforces.com/contest/1316/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "greedy"
      ]
    },
    {
      "code": "CF_1316_F",
      "name": "Battalion Strength",
      "url": "https://codeforces.com/contest/1316/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "combination",
        "probability"
      ]
    },
    {
      "code": "CF_1320_B",
      "name": "Navigation System",
      "url": "https://codeforces.com/contest/1320/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "bfs01"
      ]
    },
    {
      "code": "CF_1320_C",
      "name": "World of Darkraft: Battle for Azathoth",
      "url": "https://codeforces.com/contest/1320/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "CF_1320_D",
      "name": "Reachable Strings",
      "url": "https://codeforces.com/contest/1320/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hash"
      ]
    },
    {
      "code": "CF_1321_D",
      "name": "Navigation System",
      "url": "https://codeforces.com/contest/1321/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_1321_E",
      "name": "World of Darkraft: Battle for Azathoth",
      "url": "https://codeforces.com/contest/1321/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_1321_F",
      "name": "Reachable Strings",
      "url": "https://codeforces.com/contest/1321/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hash",
        "casework"
      ]
    },
    {
      "code": "CF_1322_B",
      "name": "Present",
      "url": "https://codeforces.com/contest/1322/problem/B",
      "judge": "Codeforces",
      "tags": [
        "2_pointers",
        "fenwick",
        "bitwise"
      ]
    },
    {
      "code": "CF_1322_C",
      "name": "Instant Noodles",
      "url": "https://codeforces.com/contest/1322/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "number_theory",
        "random"
      ]
    },
    {
      "code": "CF_1322_E",
      "name": "Median Mountain Range",
      "url": "https://codeforces.com/contest/1322/problem/E",
      "judge": "Codeforces",
      "tags": [
        "rmq"
      ]
    },
    {
      "code": "CF_1324_F",
      "name": "Maximum White Subtree",
      "url": "https://codeforces.com/contest/1324/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1325_D",
      "name": "Ehab the Xorcist",
      "url": "https://codeforces.com/contest/1325/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1325_E",
      "name": "Ehab's REAL Number Theory Problem",
      "url": "https://codeforces.com/contest/1325/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "number_theory",
        "sieve",
        "casework"
      ]
    },
    {
      "code": "CF_1325_F",
      "name": "Ehab's Last Theorem",
      "url": "https://codeforces.com/contest/1325/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "cycle"
      ]
    },
    {
      "code": "CF_1326_D2",
      "name": "Prefix-Suffix Palindrome (Hard version)",
      "url": "https://codeforces.com/contest/1326/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "binary_search",
        "greedy",
        "2_pointers",
        "z_func",
        "manacher"
      ]
    },
    {
      "code": "CF_1326_E",
      "name": "Bombs",
      "url": "https://codeforces.com/contest/1326/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1326_F1",
      "name": "Wise Men (Easy Version)",
      "url": "https://codeforces.com/contest/1326/problem/F1",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "brute_force"
      ]
    },
    {
      "code": "CF_1327_D",
      "name": "Infinite Path",
      "url": "https://codeforces.com/contest/1327/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "brute_force",
        "cycle",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1327_E",
      "name": "Count The Blocks",
      "url": "https://codeforces.com/contest/1327/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1327_F",
      "name": "AND Segments",
      "url": "https://codeforces.com/contest/1327/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "2_pointers",
        "combination",
        "dp-count",
        "bitwise",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1327_G",
      "name": "Letters and Question Marks",
      "url": "https://codeforces.com/contest/1327/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "aho"
      ]
    },
    {
      "code": "CF_1328_D",
      "name": "Carousel",
      "url": "https://codeforces.com/contest/1328/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1328_E",
      "name": "Tree Queries",
      "url": "https://codeforces.com/contest/1328/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "stl",
        "rmq"
      ]
    },
    {
      "code": "CF_1328_F",
      "name": "Make k Equal",
      "url": "https://codeforces.com/contest/1328/problem/F",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1329_A",
      "name": "Dreamoon Likes Coloring",
      "url": "https://codeforces.com/contest/1329/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1329_B",
      "name": "Dreamoon Likes Sequences",
      "url": "https://codeforces.com/contest/1329/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1329_C",
      "name": "Drazil Likes Heap",
      "url": "https://codeforces.com/contest/1329/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_132_C",
      "name": "Logo Turtle",
      "url": "https://codeforces.com/contest/132/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1330_C",
      "name": "Dreamoon Likes Coloring",
      "url": "https://codeforces.com/contest/1330/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1330_D",
      "name": "Dreamoon Likes Sequences",
      "url": "https://codeforces.com/contest/1330/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1330_E",
      "name": "Drazil Likes Heap",
      "url": "https://codeforces.com/contest/1330/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_1332_D",
      "name": "Walk on Matrix",
      "url": "https://codeforces.com/contest/1332/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1332_E",
      "name": "Height All the Same",
      "url": "https://codeforces.com/contest/1332/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1332_F",
      "name": "Independent Set",
      "url": "https://codeforces.com/contest/1332/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_1333_C",
      "name": "Eugene and an array",
      "url": "https://codeforces.com/contest/1333/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "prefix_sum",
        "dp",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1333_D",
      "name": "Challenges in school №41",
      "url": "https://codeforces.com/contest/1333/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1333_E",
      "name": "Road to 1600",
      "url": "https://codeforces.com/contest/1333/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1333_F",
      "name": "Kate and imperfection",
      "url": "https://codeforces.com/contest/1333/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "greedy",
        "sieve"
      ]
    },
    {
      "code": "CF_1334_D",
      "name": "Minimum Euler Cycle",
      "url": "https://codeforces.com/contest/1334/problem/D",
      "judge": "Codeforces",
      "tags": [
        "euler_tour",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1334_E",
      "name": "Divisor Paths",
      "url": "https://codeforces.com/contest/1334/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "combination",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_1334_F",
      "name": "Strange Function",
      "url": "https://codeforces.com/contest/1334/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_1335_E1",
      "name": "Three Blocks Palindrome (easy version)",
      "url": "https://codeforces.com/contest/1335/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "binary_search",
        "brute_force",
        "2_pointers",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1335_F",
      "name": "Robots on a Grid",
      "url": "https://codeforces.com/contest/1335/problem/F",
      "judge": "Codeforces",
      "tags": [
        "graph",
        "cycle"
      ]
    },
    {
      "code": "CF_1336_A",
      "name": "Linova and Kingdom",
      "url": "https://codeforces.com/contest/1336/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_1336_B",
      "name": "Xenia and Colorful Gems",
      "url": "https://codeforces.com/contest/1336/problem/B",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "2_pointers",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1336_C",
      "name": "Kaavi and Magic Spell",
      "url": "https://codeforces.com/contest/1336/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-count"
      ]
    },
    {
      "code": "CF_1336_D",
      "name": "Yui and Mahjong Set",
      "url": "https://codeforces.com/contest/1336/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive",
        "interactive"
      ]
    },
    {
      "code": "CF_1336_E1",
      "name": "Chiori and Doll Picking (easy version)",
      "url": "https://codeforces.com/contest/1336/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "bitwise"
      ]
    },
    {
      "code": "CF_1337_C",
      "name": "Linova and Kingdom",
      "url": "https://codeforces.com/contest/1337/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1337_D",
      "name": "Xenia and Colorful Gems",
      "url": "https://codeforces.com/contest/1337/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1338_B",
      "name": "Edge Weight Assignment",
      "url": "https://codeforces.com/contest/1338/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "stl",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1338_C",
      "name": "Perfect Triples",
      "url": "https://codeforces.com/contest/1338/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dnc",
        "constructive",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_1338_D",
      "name": "Nested Rubber Bands",
      "url": "https://codeforces.com/contest/1338/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_1338_E",
      "name": "JYPnation",
      "url": "https://codeforces.com/contest/1338/problem/E",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1339_D",
      "name": "Edge Weight Assignment",
      "url": "https://codeforces.com/contest/1339/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "lca",
        "bitwise"
      ]
    },
    {
      "code": "CF_1339_E",
      "name": "Perfect Triples",
      "url": "https://codeforces.com/contest/1339/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_1340_C",
      "name": "Nastya and Unexpected Guest",
      "url": "https://codeforces.com/contest/1340/problem/C",
      "judge": "Codeforces",
      "tags": [
        "bfs01"
      ]
    },
    {
      "code": "CF_1340_D",
      "name": "Nastya and Time Machine",
      "url": "https://codeforces.com/contest/1340/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_1341_D",
      "name": "Nastya and Scoreboard",
      "url": "https://codeforces.com/contest/1341/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_digit",
        "greedy",
        "fenwick"
      ]
    },
    {
      "code": "CF_1342_C",
      "name": "Yet Another Counting Problem",
      "url": "https://codeforces.com/contest/1342/problem/C",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "brute_force",
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1342_E",
      "name": "Placing Rooks",
      "url": "https://codeforces.com/contest/1342/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1343_D",
      "name": "Constant Palindrome Sum",
      "url": "https://codeforces.com/contest/1343/problem/D",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "brute_force",
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_1343_E",
      "name": "Weights Distributing",
      "url": "https://codeforces.com/contest/1343/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "prefix_sum",
        "greedy",
        "graph",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_1343_F",
      "name": "Restore the Permutation by Sorted Segments",
      "url": "https://codeforces.com/contest/1343/problem/F",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_1344_C",
      "name": "Quantifier Question",
      "url": "https://codeforces.com/contest/1344/problem/C",
      "judge": "Codeforces",
      "tags": [
        "topo_sort"
      ]
    },
    {
      "code": "CF_1344_D",
      "name": "Résumé Review",
      "url": "https://codeforces.com/contest/1344/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1348_D",
      "name": "Phoenix and Science",
      "url": "https://codeforces.com/contest/1348/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_1348_E",
      "name": "Phoenix and Berries",
      "url": "https://codeforces.com/contest/1348/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1348_F",
      "name": "Phoenix and Memory",
      "url": "https://codeforces.com/contest/1348/problem/F",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_1349_C",
      "name": "Orac and Game of Life",
      "url": "https://codeforces.com/contest/1349/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "implementation"
      ]
    },
    {
      "code": "CF_1354_G",
      "name": "Find a Gift",
      "url": "https://codeforces.com/contest/1354/problem/G",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "interactive",
        "probability"
      ]
    },
    {
      "code": "CF_1370_F2",
      "name": "The Hidden Pair (Hard Version)",
      "url": "https://codeforces.com/contest/1370/problem/F2",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "constructive",
        "interactive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_137_E",
      "name": "Last Chance",
      "url": "https://codeforces.com/contest/137/problem/E",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "implementation"
      ]
    },
    {
      "code": "CF_1386_C",
      "name": "Joker",
      "url": "https://codeforces.com/problemset/problem/1386/C",
      "judge": "Codeforces",
      "tags": [
        "dsu_rollback",
        "dnc",
        "mo-general"
      ]
    },
    {
      "code": "CF_1392_F",
      "name": "Omkar and Landslide",
      "url": "https://codeforces.com/contest/1392/problem/F",
      "judge": "Codeforces",
      "tags": []
    },
    {
      "code": "CF_13_C",
      "name": "Sequence",
      "url": "https://codeforces.com/contest/13/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_13_D",
      "name": "Triangles",
      "url": "https://codeforces.com/contest/13/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "geometry"
      ]
    },
    {
      "code": "CF_13_E",
      "name": "Holes",
      "url": "https://codeforces.com/contest/13/problem/E",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets",
        "implementation",
        "dsu",
        "segment_tree"
      ]
    },
    {
      "code": "CF_140_F",
      "name": "New Year Snowflake",
      "url": "https://codeforces.com/contest/140/problem/F",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "casework"
      ]
    },
    {
      "code": "CF_1451_E1",
      "name": "Bitwise Queries (Easy Version)",
      "url": "https://codeforces.com/contest/1451/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "interactive",
        "bitwise",
        "constructive"
      ]
    },
    {
      "code": "CF_1451_E2",
      "name": "Bitwise Queries (Hard Version)",
      "url": "https://codeforces.com/contest/1451/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "interactive",
        "bitwise"
      ]
    },
    {
      "code": "CF_145_B",
      "name": "Lucky Number 2",
      "url": "https://codeforces.com/contest/145/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_145_C",
      "name": "Lucky Subsequence",
      "url": "https://codeforces.com/contest/145/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_146_E",
      "name": "Lucky Subsequence",
      "url": "https://codeforces.com/contest/146/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-count"
      ]
    },
    {
      "code": "CF_1473_E",
      "name": "Minimum Path",
      "url": "https://codeforces.com/contest/1473/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "CF_147_B",
      "name": "Smile House",
      "url": "https://codeforces.com/contest/147/problem/B",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "matrix_mul",
        "floyd"
      ]
    },
    {
      "code": "CF_148_E",
      "name": "Porcelain",
      "url": "https://codeforces.com/contest/148/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1497_D",
      "name": "Genius",
      "url": "https://codeforces.com/contest/1497/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_14_D",
      "name": "Two Paths",
      "url": "https://codeforces.com/contest/14/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_14_E",
      "name": "Camels",
      "url": "https://codeforces.com/contest/14/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_150_D",
      "name": "Mission Impassable",
      "url": "https://codeforces.com/contest/150/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_1516_E",
      "name": "Baby Ehab Plays with Permutations",
      "url": "https://codeforces.com/contest/1516/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1525_C",
      "name": "Robot Collisions",
      "url": "https://codeforces.com/contest/1525/problem/C",
      "judge": "Codeforces",
      "tags": [
        "implementation",
        "greedy"
      ]
    },
    {
      "code": "CF_1535_E",
      "name": "Gold Transfer",
      "url": "https://codeforces.com/contest/1535/problem/E",
      "judge": "Codeforces",
      "tags": [
        "graph",
        "sparse_table"
      ]
    },
    {
      "code": "CF_154_C",
      "name": "Double Profiles",
      "url": "https://codeforces.com/contest/154/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "CF_154_E",
      "name": "Martian Colony",
      "url": "https://codeforces.com/contest/154/problem/E",
      "judge": "Codeforces",
      "tags": [
        "convexhull"
      ]
    },
    {
      "code": "CF_156_C",
      "name": "Cipher",
      "url": "https://codeforces.com/contest/156/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "ad_hoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_156_D",
      "name": "Clues",
      "url": "https://codeforces.com/contest/156/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "graph"
      ]
    },
    {
      "code": "CF_1583_H",
      "name": "Omkar and Tours",
      "url": "https://codeforces.com/contest/1583/problem/H",
      "judge": "Codeforces",
      "tags": [
        "Centroid",
        "dsu",
        "binary_lifting"
      ]
    },
    {
      "code": "CF_158_A",
      "name": "Next Round",
      "url": "https://codeforces.com/contest/158/problem/A",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy"
      ]
    },
    {
      "code": "CF_1592_A",
      "name": "Gamer Hemose",
      "url": "https://codeforces.com/contest/1592/problem/A",
      "judge": "Codeforces",
      "tags": [
        "casework",
        "greedy",
        "brute_force"
      ]
    },
    {
      "code": "CF_1592_B",
      "name": "Hemose Shopping",
      "url": "https://codeforces.com/contest/1592/problem/B",
      "judge": "Codeforces",
      "tags": [
        "casework",
        "brute_force"
      ]
    },
    {
      "code": "CF_1592_C",
      "name": "Bakry and Partitioning",
      "url": "https://codeforces.com/contest/1592/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "casework",
        "bitwise"
      ]
    },
    {
      "code": "CF_1592_D",
      "name": "Hemose in ICPC ?",
      "url": "https://codeforces.com/contest/1592/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "tree_euler_tour",
        "binary_search",
        "interactive"
      ]
    },
    {
      "code": "CF_1592_E",
      "name": "Bored Bakry",
      "url": "https://codeforces.com/contest/1592/problem/E",
      "judge": "Codeforces",
      "tags": [
        "2_pointers",
        "bitwise",
        "greedy",
        "brute_force"
      ]
    },
    {
      "code": "CF_1598_A",
      "name": "Computer Game",
      "url": "https://codeforces.com/contest/1598/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "hard-implementation",
        "implementation"
      ]
    },
    {
      "code": "CF_1598_B",
      "name": "Groups",
      "url": "https://codeforces.com/contest/1598/problem/B",
      "judge": "Codeforces",
      "tags": [
        "bitset",
        "hard-implementation",
        "implementation"
      ]
    },
    {
      "code": "CF_1598_C",
      "name": "Delete Two Elements",
      "url": "https://codeforces.com/contest/1598/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "2_pointers",
        "implementation",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1598_D",
      "name": "Training Session",
      "url": "https://codeforces.com/contest/1598/problem/D",
      "judge": "Codeforces",
      "tags": [
        "implementation",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1598_E",
      "name": "Staircases",
      "url": "https://codeforces.com/contest/1598/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_1598_F",
      "name": "RBS",
      "url": "https://codeforces.com/contest/1598/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "binary_search"
      ]
    },
    {
      "code": "CF_1598_G",
      "name": "The Sum of Good Numbers",
      "url": "https://codeforces.com/contest/1598/problem/G",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "suffix_array",
        "probability"
      ]
    },
    {
      "code": "CF_1603_F",
      "name": "October 18, 2017",
      "url": "https://codeforces.com/contest/1603/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1605_A",
      "name": "A.M. Deviation",
      "url": "https://codeforces.com/contest/1605/problem/A",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1605_B",
      "name": "Reverse Sort",
      "url": "https://codeforces.com/contest/1605/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_1605_C",
      "name": "Dominant Character",
      "url": "https://codeforces.com/contest/1605/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1605_D",
      "name": "Treelabeling",
      "url": "https://codeforces.com/contest/1605/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive",
        "number_theory"
      ]
    },
    {
      "code": "CF_1605_E",
      "name": "Array Equalizer",
      "url": "https://codeforces.com/contest/1605/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "mobius",
        "multiplicative"
      ]
    },
    {
      "code": "CF_1609_E",
      "name": "William The Oblivious",
      "url": "https://codeforces.com/contest/1609/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_160_C",
      "name": "Find Pair",
      "url": "https://codeforces.com/contest/160/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1611_G",
      "name": "Robot and Candies",
      "url": "https://codeforces.com/contest/1611/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "matching",
        "greedy"
      ]
    },
    {
      "code": "CF_1612_G",
      "name": "Max Sum Array",
      "url": "https://codeforces.com/contest/1612/problem/G",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "combination",
        "greedy"
      ]
    },
    {
      "code": "CF_1618_F",
      "name": "Reverse",
      "url": "https://codeforces.com/contest/1618/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "bitwise",
        "brute_force"
      ]
    },
    {
      "code": "CF_1618_G",
      "name": "Trader Problem",
      "url": "https://codeforces.com/contest/1618/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_161_D",
      "name": "Distance in Tree",
      "url": "https://codeforces.com/contest/161/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "Centroid"
      ]
    },
    {
      "code": "CF_1634_D",
      "name": "Finding Zero",
      "url": "https://codeforces.com/problemset/problem/1634/D",
      "judge": "Codeforces",
      "tags": [
        "interactive",
        "math-adhoc",
        "constructive"
      ]
    },
    {
      "code": "CF_163_E",
      "name": "e-Government",
      "url": "https://codeforces.com/contest/163/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "segment_tree",
        "fenwick",
        "tree_euler_tour",
        "aho"
      ]
    },
    {
      "code": "CF_165_E",
      "name": "Compatible Numbers",
      "url": "https://codeforces.com/contest/165/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-sos"
      ]
    },
    {
      "code": "CF_166_B",
      "name": "Polygons",
      "url": "https://codeforces.com/contest/166/problem/B",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "CF_166_E",
      "name": "Tetrahedron",
      "url": "https://codeforces.com/contest/166/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "matrix_mul",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1670_F",
      "name": "Jee, You See?",
      "url": "https://codeforces.com/problemset/problem/1670/F",
      "judge": "Codeforces",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "CF_1679_E",
      "name": "Typical Party in Dorm",
      "url": "https://codeforces.com/contest/1679/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-sos",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1681_E",
      "name": "Labyrinth Adventures",
      "url": "https://codeforces.com/contest/1681/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_1709_F",
      "name": "Multiset of Strings",
      "url": "https://codeforces.com/contest/1709/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "fft"
      ]
    },
    {
      "code": "CF_1713_F",
      "name": "Lost Array",
      "url": "https://codeforces.com/contest/1713/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp-sos",
        "number_theory"
      ]
    },
    {
      "code": "CF_1716_F",
      "name": "Bags with Balls",
      "url": "https://codeforces.com/contest/1716/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "combination"
      ]
    },
    {
      "code": "CF_1720_D2",
      "name": "Xor-Subsequence (hard version)",
      "url": "https://codeforces.com/contest/1720/problem/D2",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "dp"
      ]
    },
    {
      "code": "CF_1720_E",
      "name": "Misha and Paintings",
      "url": "https://codeforces.com/contest/1720/problem/E",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "constructive"
      ]
    },
    {
      "code": "CF_1762_D",
      "name": "GCD Queries",
      "url": "https://codeforces.com/contest/1762/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "interactive",
        "number_theory"
      ]
    },
    {
      "code": "CF_1764_D",
      "name": "Doremy's Pegging Game",
      "url": "https://codeforces.com/contest/1764/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_1775_F",
      "name": "Laboratory on Pluto",
      "url": "https://codeforces.com/contest/1775/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "number_theory"
      ]
    },
    {
      "code": "CF_1780_E",
      "name": "Josuke and Complete Graph",
      "url": "https://codeforces.com/contest/1780/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_1788_F",
      "name": "XOR, Tree, and Queries",
      "url": "https://codeforces.com/contest/1788/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_1789_E",
      "name": "Serval and Music Game",
      "url": "https://codeforces.com/contest/1789/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "brute_force"
      ]
    },
    {
      "code": "CF_1799_G",
      "name": "Count Voting",
      "url": "https://codeforces.com/contest/1799/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_1806_E",
      "name": "Tree Master",
      "url": "https://codeforces.com/contest/1806/problem/E",
      "judge": "Codeforces",
      "tags": [
        "tree_euler_tour",
        "mo-general"
      ]
    },
    {
      "code": "CF_1809_G",
      "name": "Prediction",
      "url": "https://codeforces.com/problemset/problem/1809/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_183_C",
      "name": "Cyclic Coloring",
      "url": "https://codeforces.com/contest/183/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_185_D",
      "name": "Visit of the Great",
      "url": "https://codeforces.com/contest/185/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_187_D",
      "name": "BRT Contract",
      "url": "https://codeforces.com/contest/187/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "CF_1903_F",
      "name": "Babysitting",
      "url": "https://codeforces.com/contest/1903/problem/F",
      "judge": "Codeforces",
      "tags": [
        "2sat",
        "binary_search"
      ]
    },
    {
      "code": "CF_193_C",
      "name": "Hamming Distance",
      "url": "https://codeforces.com/problemset/problem/193/C",
      "judge": "Codeforces",
      "tags": [
        "gauss"
      ]
    },
    {
      "code": "CF_195_E",
      "name": "Building Forest",
      "url": "https://codeforces.com/problemset/problem/195/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu",
        "segment_tree",
        "fenwick"
      ]
    },
    {
      "code": "CF_1965_B",
      "name": "Missing Subsequence Sum",
      "url": "https://codeforces.com/problemset/problem/1965/B",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "dp-sos"
      ]
    },
    {
      "code": "CF_196_E",
      "name": "Opening Portals",
      "url": "https://codeforces.com/contest/196/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "mst",
        "dsu"
      ]
    },
    {
      "code": "CF_199_B",
      "name": "Special Olympics",
      "url": "https://codeforces.com/contest/199/problem/B",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "casework"
      ]
    },
    {
      "code": "CF_19_B",
      "name": "Checkout Assistant",
      "url": "https://codeforces.com/contest/19/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_1_B",
      "name": "Spreadsheet",
      "url": "https://codeforces.com/contest/1/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_208_E",
      "name": "Blood Cousins",
      "url": "https://codeforces.com/contest/208/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "dp_on_tree",
        "lca"
      ]
    },
    {
      "code": "CF_20_A",
      "name": "BerOS file system",
      "url": "https://codeforces.com/contest/20/problem/A",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_20_B",
      "name": "Equation",
      "url": "https://codeforces.com/contest/20/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_20_C",
      "name": "Dijkstra?",
      "url": "https://codeforces.com/contest/20/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "CF_2134_D",
      "name": "Sliding Tree",
      "url": "https://codeforces.com/contest/2134/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_213_C",
      "name": "Relay Race",
      "url": "https://codeforces.com/contest/213/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_21_A",
      "name": "Jabber ID",
      "url": "https://codeforces.com/contest/21/problem/A",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_21_B",
      "name": "Intersection",
      "url": "https://codeforces.com/problemset/problem/21/B",
      "judge": "Codeforces",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "CF_21_C",
      "name": "Stripe 2",
      "url": "https://codeforces.com/contest/21/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_220_E",
      "name": "Little Elephant and Inversions",
      "url": "https://codeforces.com/contest/220/problem/E",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "2_pointers"
      ]
    },
    {
      "code": "CF_221_D",
      "name": "Little Elephant and Array",
      "url": "https://codeforces.com/contest/221/problem/D",
      "judge": "Codeforces",
      "tags": [
        "mo-general"
      ]
    },
    {
      "code": "CF_223_C",
      "name": "Partial Sums",
      "url": "https://codeforces.com/contest/223/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_226_D",
      "name": "The table",
      "url": "https://codeforces.com/contest/226/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_228_E",
      "name": "The Road to Berland is Paved With Good Intentions",
      "url": "https://codeforces.com/contest/228/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "2sat"
      ]
    },
    {
      "code": "CF_229_B",
      "name": "Planets",
      "url": "https://codeforces.com/contest/229/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "CF_229_C",
      "name": "Triangles",
      "url": "https://codeforces.com/contest/229/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_238_C",
      "name": "World Eater Brothers",
      "url": "https://codeforces.com/contest/238/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_23_D",
      "name": "Tetragon",
      "url": "https://codeforces.com/contest/23/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "implementation"
      ]
    },
    {
      "code": "CF_241_B",
      "name": "Friends",
      "url": "https://codeforces.com/contest/241/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "trie",
        "greedy",
        "bitwise"
      ]
    },
    {
      "code": "CF_242_C",
      "name": "King's Path",
      "url": "https://codeforces.com/contest/242/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "bfs01"
      ]
    },
    {
      "code": "CF_242_E",
      "name": "XOR on Segment",
      "url": "https://codeforces.com/contest/242/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_246_E",
      "name": "Blood Cousins Return",
      "url": "https://codeforces.com/contest/246/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "dsu"
      ]
    },
    {
      "code": "CF_248_C",
      "name": "Robo-Footballer",
      "url": "https://codeforces.com/contest/248/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "binary_search"
      ]
    },
    {
      "code": "CF_254_E",
      "name": "Dormitory",
      "url": "https://codeforces.com/contest/254/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_255_E",
      "name": "Furlo and Rublo and Game",
      "url": "https://codeforces.com/contest/255/problem/E",
      "judge": "Codeforces",
      "tags": [
        "Grundy",
        "nim"
      ]
    },
    {
      "code": "CF_25_D",
      "name": "Roads not only in Berland",
      "url": "https://codeforces.com/contest/25/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_264_C",
      "name": "Choosing Balls",
      "url": "https://codeforces.com/contest/264/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy-more"
      ]
    },
    {
      "code": "CF_266_D",
      "name": "BerDonalds",
      "url": "https://codeforces.com/contest/266/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "floyd"
      ]
    },
    {
      "code": "CF_269_B",
      "name": "Greenhouse Effect",
      "url": "https://codeforces.com/contest/269/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_26_C",
      "name": "Parquet",
      "url": "https://codeforces.com/contest/26/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_271_D",
      "name": "Good Substrings",
      "url": "https://codeforces.com/contest/271/problem/D",
      "judge": "Codeforces",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "CF_276_D",
      "name": "Little Girl and Maximum XOR",
      "url": "https://codeforces.com/contest/276/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "greedy",
        "branch-bound",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_27_D",
      "name": "Ring Road 2",
      "url": "https://codeforces.com/contest/27/problem/D",
      "judge": "Codeforces",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "CF_27_E",
      "name": "Number With The Given Amount Of Divisors",
      "url": "https://codeforces.com/contest/27/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_280_B",
      "name": "Maximum Xor Secondary",
      "url": "https://codeforces.com/contest/280/problem/B",
      "judge": "Codeforces",
      "tags": [
        "mono_queue",
        "2_pointers"
      ]
    },
    {
      "code": "CF_280_C",
      "name": "Game on Tree",
      "url": "https://codeforces.com/contest/280/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "probability"
      ]
    },
    {
      "code": "CF_282_E",
      "name": "Sausage Maximization",
      "url": "https://codeforces.com/contest/282/problem/E",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "bitwise"
      ]
    },
    {
      "code": "CF_283_D",
      "name": "Cows and Cool Sequences",
      "url": "https://codeforces.com/contest/283/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_286_B",
      "name": "Shifting",
      "url": "https://codeforces.com/contest/286/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_287_B",
      "name": "Pipeline",
      "url": "https://codeforces.com/contest/287/problem/B",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_288_C",
      "name": "Polo the Penguin and XOR operation",
      "url": "https://codeforces.com/contest/288/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_292_E",
      "name": "Copying Data",
      "url": "https://codeforces.com/contest/292/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_293_D",
      "name": "Ksusha and Square",
      "url": "https://codeforces.com/contest/293/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sweep_line",
        "2_pointers",
        "probability"
      ]
    },
    {
      "code": "CF_295_B",
      "name": "Greg and Graph",
      "url": "https://codeforces.com/contest/295/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "floyd",
        "implementation"
      ]
    },
    {
      "code": "CF_295_C",
      "name": "Greg and Friends",
      "url": "https://codeforces.com/contest/295/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "dp-dag"
      ]
    },
    {
      "code": "CF_295_D",
      "name": "Greg and Caves",
      "url": "https://codeforces.com/contest/295/problem/D",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_296_B",
      "name": "Yaroslav and Two Strings",
      "url": "https://codeforces.com/contest/296/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_297_C",
      "name": "Splitting the Uniqueness",
      "url": "https://codeforces.com/contest/297/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_297_D",
      "name": "Color the Carpet",
      "url": "https://codeforces.com/contest/297/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_29_E",
      "name": "Quarrel",
      "url": "https://codeforces.com/contest/29/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra"
      ]
    },
    {
      "code": "CF_2_B",
      "name": "The least round way",
      "url": "https://codeforces.com/contest/2/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory"
      ]
    },
    {
      "code": "CF_2_C",
      "name": "Commentator problem",
      "url": "https://codeforces.com/contest/2/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "random"
      ]
    },
    {
      "code": "CF_300_E",
      "name": "Empire Strikes Back",
      "url": "https://codeforces.com/contest/300/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "sieve"
      ]
    },
    {
      "code": "CF_301_A",
      "name": "Yaroslav and Sequence",
      "url": "https://codeforces.com/contest/301/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_301_D",
      "name": "Yaroslav and Divisors",
      "url": "https://codeforces.com/contest/301/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "number_theory",
        "2_pointers",
        "fenwick"
      ]
    },
    {
      "code": "CF_303_C",
      "name": "Minimum Modular",
      "url": "https://codeforces.com/contest/303/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "number_theory"
      ]
    },
    {
      "code": "CF_311_B",
      "name": "Cats Transport",
      "url": "https://codeforces.com/contest/311/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "CF_311_C",
      "name": "Fetch the Treasure",
      "url": "https://codeforces.com/contest/311/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "stl"
      ]
    },
    {
      "code": "CF_311_D",
      "name": "Interval Cubing",
      "url": "https://codeforces.com/contest/311/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_314_C",
      "name": "Sereja and Subsequences",
      "url": "https://codeforces.com/contest/314/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "CF_317_C",
      "name": "Balance",
      "url": "https://codeforces.com/contest/317/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_317_D",
      "name": "Game with Powers",
      "url": "https://codeforces.com/contest/317/problem/D",
      "judge": "Codeforces",
      "tags": [
        "Grundy",
        "number_theory",
        "static-data"
      ]
    },
    {
      "code": "CF_319_C",
      "name": "Kalila and Dimna in the Logging Industry",
      "url": "https://codeforces.com/contest/319/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-convexhull",
        "greedy",
        "lichao-tree"
      ]
    },
    {
      "code": "CF_31_E",
      "name": "TV Game",
      "url": "https://codeforces.com/contest/31/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_321_B",
      "name": "Ciel and Duel",
      "url": "https://codeforces.com/contest/321/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_321_C",
      "name": "Ciel the Commander",
      "url": "https://codeforces.com/contest/321/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "Centroid"
      ]
    },
    {
      "code": "CF_321_E",
      "name": "Ciel and Gondolas",
      "url": "https://codeforces.com/contest/321/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-dnc"
      ]
    },
    {
      "code": "CF_322_E",
      "name": "Ciel the Commander",
      "url": "https://codeforces.com/contest/322/problem/E",
      "judge": "Codeforces",
      "tags": [
        "Centroid",
        "constructive"
      ]
    },
    {
      "code": "CF_329_C",
      "name": "Graph Reconstruction",
      "url": "https://codeforces.com/contest/329/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "random"
      ]
    },
    {
      "code": "CF_337_D",
      "name": "Book of Evil",
      "url": "https://codeforces.com/contest/337/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_337_E",
      "name": "Divisor Tree",
      "url": "https://codeforces.com/contest/337/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "CF_338_D",
      "name": "GCD Table",
      "url": "https://codeforces.com/contest/338/problem/D",
      "judge": "Codeforces",
      "tags": [
        "extgcd",
        "chinese-remainder"
      ]
    },
    {
      "code": "CF_339_D",
      "name": "Xenia and Bit Operations",
      "url": "https://codeforces.com/contest/339/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "fenwick",
        "bitwise"
      ]
    },
    {
      "code": "CF_33_C",
      "name": "Wonderful Randomized Sum",
      "url": "https://codeforces.com/contest/33/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_33_D",
      "name": "Knights",
      "url": "https://codeforces.com/contest/33/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "geometry",
        "graph"
      ]
    },
    {
      "code": "CF_340_B",
      "name": "Maximal Area Quadrilateral",
      "url": "https://codeforces.com/contest/340/problem/B",
      "judge": "Codeforces",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "CF_340_E",
      "name": "Iahub and Permutations",
      "url": "https://codeforces.com/contest/340/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count",
        "sieve"
      ]
    },
    {
      "code": "CF_342_E",
      "name": "Xenia and Tree",
      "url": "https://codeforces.com/contest/342/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "lca",
        "Centroid",
        "sqrt-time"
      ]
    },
    {
      "code": "CF_343_D",
      "name": "Water Tree",
      "url": "https://codeforces.com/contest/343/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "segment_tree",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_346_B",
      "name": "Lucky Common Subsequence",
      "url": "https://codeforces.com/contest/346/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "kmp"
      ]
    },
    {
      "code": "CF_348_B",
      "name": "Apple Tree",
      "url": "https://codeforces.com/contest/348/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "binary_search",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_348_C",
      "name": "Subset Sums",
      "url": "https://codeforces.com/contest/348/problem/C",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets",
        "sqrt-2way",
        "sqrt-babygiant"
      ]
    },
    {
      "code": "CF_349_B",
      "name": "Color the Fence",
      "url": "https://codeforces.com/contest/349/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_350_D",
      "name": "Looking for Owls",
      "url": "https://codeforces.com/contest/350/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hash",
        "binary_search",
        "geometry"
      ]
    },
    {
      "code": "CF_351_D",
      "name": "Jeff and Removing Periods",
      "url": "https://codeforces.com/contest/351/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_354_B",
      "name": "Game with Strings",
      "url": "https://codeforces.com/problemset/problem/354/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_bitmask",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_356_E",
      "name": "Xenia and String Problem",
      "url": "https://codeforces.com/contest/356/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "dp"
      ]
    },
    {
      "code": "CF_358_D",
      "name": "Dima and Hares",
      "url": "https://codeforces.com/contest/358/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_359_D",
      "name": "Pair of Numbers",
      "url": "https://codeforces.com/contest/359/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "sparse_table",
        "binary_search",
        "2_pointers",
        "number_theory"
      ]
    },
    {
      "code": "CF_35_D",
      "name": "Animals",
      "url": "https://codeforces.com/contest/35/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_360_B",
      "name": "Levko and Array",
      "url": "https://codeforces.com/contest/360/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_360_C",
      "name": "Levko and Strings",
      "url": "https://codeforces.com/contest/360/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-count"
      ]
    },
    {
      "code": "CF_361_E",
      "name": "Levko and Strings",
      "url": "https://codeforces.com/contest/361/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_364_D",
      "name": "Ghd",
      "url": "https://codeforces.com/contest/364/problem/D",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "inclusion-exclusion",
        "probability",
        "random"
      ]
    },
    {
      "code": "CF_366_D",
      "name": "Dima and Trap Graph",
      "url": "https://codeforces.com/contest/366/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "binary_search"
      ]
    },
    {
      "code": "CF_367_D",
      "name": "Sereja and Sets",
      "url": "https://codeforces.com/contest/367/problem/D",
      "judge": "Codeforces",
      "tags": [
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_367_E",
      "name": "Sereja and Intervals",
      "url": "https://codeforces.com/contest/367/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "dp-openclose"
      ]
    },
    {
      "code": "CF_375_B",
      "name": "Maximum Submatrix 2",
      "url": "https://codeforces.com/contest/375/problem/B",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dp"
      ]
    },
    {
      "code": "CF_375_D",
      "name": "Tree and Queries",
      "url": "https://codeforces.com/contest/375/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "small-to-large",
        "mo-general"
      ]
    },
    {
      "code": "CF_376_D",
      "name": "Maximum Submatrix 2",
      "url": "https://codeforces.com/contest/376/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_377_D",
      "name": "Developing Game",
      "url": "https://codeforces.com/contest/377/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_377_E",
      "name": "Cookie Clicker",
      "url": "https://codeforces.com/contest/377/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "CF_379_F",
      "name": "New Year Tree",
      "url": "https://codeforces.com/contest/379/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "segment_tree",
        "reversal"
      ]
    },
    {
      "code": "CF_37_E",
      "name": "Trial for Chief",
      "url": "https://codeforces.com/contest/37/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "ad_hoc",
        "greedy",
        "dsu"
      ]
    },
    {
      "code": "CF_380_C",
      "name": "Sereja and Brackets",
      "url": "https://codeforces.com/contest/380/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "offline-query"
      ]
    },
    {
      "code": "CF_382_B",
      "name": "Number Busters",
      "url": "https://codeforces.com/contest/382/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "binary_search"
      ]
    },
    {
      "code": "CF_383_D",
      "name": "Antimatter",
      "url": "https://codeforces.com/contest/383/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_383_E",
      "name": "Vowels",
      "url": "https://codeforces.com/contest/383/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-sos",
        "bitwise"
      ]
    },
    {
      "code": "CF_388_D",
      "name": "Fox and Perfect Sets",
      "url": "https://codeforces.com/contest/388/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_38_E",
      "name": "Let's Go Rolling!",
      "url": "https://codeforces.com/contest/38/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_39_C",
      "name": "Moon Craters",
      "url": "https://codeforces.com/contest/39/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_3_C",
      "name": "Tic-tac-toe",
      "url": "https://codeforces.com/contest/3/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_3_D",
      "name": "Least Cost Bracket Sequence",
      "url": "https://codeforces.com/problemset/problem/3/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_401_D",
      "name": "Roman and Numbers",
      "url": "https://codeforces.com/contest/401/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_402_D",
      "name": "Upgrading Array",
      "url": "https://codeforces.com/contest/402/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory"
      ]
    },
    {
      "code": "CF_403_C",
      "name": "Strictly Positive Matrix",
      "url": "https://codeforces.com/contest/403/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "strongly_connected"
      ]
    },
    {
      "code": "CF_403_E",
      "name": "Two Rooted Trees",
      "url": "https://codeforces.com/contest/403/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hld"
      ]
    },
    {
      "code": "CF_405_D",
      "name": "Toy Sum",
      "url": "https://codeforces.com/contest/405/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_405_E",
      "name": "Graph Cutting",
      "url": "https://codeforces.com/contest/405/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph"
      ]
    },
    {
      "code": "CF_407_D",
      "name": "Largest Submatrix 3",
      "url": "https://codeforces.com/contest/407/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_408_D",
      "name": "Long Path",
      "url": "https://codeforces.com/contest/408/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_413_D",
      "name": "2048",
      "url": "https://codeforces.com/problemset/problem/413/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_416_E",
      "name": "President's Path",
      "url": "https://codeforces.com/contest/416/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "floyd"
      ]
    },
    {
      "code": "CF_418_C",
      "name": "Square Table",
      "url": "https://codeforces.com/contest/418/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_418_D",
      "name": "Big Problems for Organizers",
      "url": "https://codeforces.com/contest/418/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca",
        "Centroid"
      ]
    },
    {
      "code": "CF_41_A",
      "name": "Translation",
      "url": "https://codeforces.com/contest/41/problem/A",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_41_D",
      "name": "Pawn",
      "url": "https://codeforces.com/contest/41/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_420_C",
      "name": "Bug in Code",
      "url": "https://codeforces.com/contest/420/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "implementation"
      ]
    },
    {
      "code": "CF_420_D",
      "name": "Cup Trick",
      "url": "https://codeforces.com/contest/420/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "fenwick"
      ]
    },
    {
      "code": "CF_424_D",
      "name": "Biathlon Track",
      "url": "https://codeforces.com/contest/424/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_425_D",
      "name": "Sereja and Squares",
      "url": "https://codeforces.com/contest/425/problem/D",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "binary_search",
        "brute_force",
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_427_E",
      "name": "Police Patrol",
      "url": "https://codeforces.com/contest/427/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_429_D",
      "name": "Tricky Function",
      "url": "https://codeforces.com/contest/429/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "brute_force",
        "dnc"
      ]
    },
    {
      "code": "CF_431_D",
      "name": "Random Task",
      "url": "https://codeforces.com/contest/431/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "binary_search"
      ]
    },
    {
      "code": "CF_432_D",
      "name": "Prefixes and Suffixes",
      "url": "https://codeforces.com/contest/432/problem/D",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "2_pointers",
        "z_func"
      ]
    },
    {
      "code": "CF_433_C",
      "name": "Ryouko's Memory Note",
      "url": "https://codeforces.com/contest/433/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_434_C",
      "name": "Tachibana Kanade's Tofu",
      "url": "https://codeforces.com/contest/434/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "aho"
      ]
    },
    {
      "code": "CF_436_F",
      "name": "Banners",
      "url": "https://codeforces.com/contest/436/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-convexhull",
        "convexhull",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_437_D",
      "name": "The Child and Zoo",
      "url": "https://codeforces.com/contest/437/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_438_D",
      "name": "The Child and Sequence",
      "url": "https://codeforces.com/contest/438/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "segtree_beats"
      ]
    },
    {
      "code": "CF_43_D",
      "name": "Journey",
      "url": "https://codeforces.com/contest/43/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_43_E",
      "name": "Race",
      "url": "https://codeforces.com/contest/43/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "2_pointers",
        "implementation"
      ]
    },
    {
      "code": "CF_440_D",
      "name": "Berland Federalization",
      "url": "https://codeforces.com/contest/440/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dp-tree-knapsack"
      ]
    },
    {
      "code": "CF_442_B",
      "name": "Andrey and Problem",
      "url": "https://codeforces.com/contest/442/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc",
        "probability"
      ]
    },
    {
      "code": "CF_442_C",
      "name": "Artem and Array",
      "url": "https://codeforces.com/contest/442/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_442_D",
      "name": "Adam and Tree",
      "url": "https://codeforces.com/contest/442/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_444_C",
      "name": "DZY Loves Colors",
      "url": "https://codeforces.com/contest/444/problem/C",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets",
        "mo-general"
      ]
    },
    {
      "code": "CF_446_C",
      "name": "DZY Loves Fibonacci Numbers",
      "url": "https://codeforces.com/contest/446/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_448_D",
      "name": "Multiplication Table",
      "url": "https://codeforces.com/contest/448/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "CF_449_B",
      "name": "Jzzhu and Cities",
      "url": "https://codeforces.com/contest/449/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "graph",
        "greedy"
      ]
    },
    {
      "code": "CF_449_C",
      "name": "Jzzhu and Apples",
      "url": "https://codeforces.com/contest/449/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "constructive",
        "probability"
      ]
    },
    {
      "code": "CF_44_D",
      "name": "Hyperdrive",
      "url": "https://codeforces.com/contest/44/problem/D",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_44_H",
      "name": "Phone Number",
      "url": "https://codeforces.com/contest/44/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_451_D",
      "name": "Count Good Substrings",
      "url": "https://codeforces.com/contest/451/problem/D",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_451_E",
      "name": "Devu and Flowers",
      "url": "https://codeforces.com/contest/451/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "combination",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_452_C",
      "name": "Magic Trick",
      "url": "https://codeforces.com/contest/452/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_452_E",
      "name": "Three strings",
      "url": "https://codeforces.com/contest/452/problem/E",
      "judge": "Codeforces",
      "tags": [
        "suffix_array",
        "dsu"
      ]
    },
    {
      "code": "CF_453_B",
      "name": "Little Pony and Harmony Chest",
      "url": "https://codeforces.com/contest/453/problem/B",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "dp_bitmask",
        "number_theory",
        "greedy",
        "bitwise"
      ]
    },
    {
      "code": "CF_454_D",
      "name": "Little Pony and Harmony Chest",
      "url": "https://codeforces.com/contest/454/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "number_theory",
        "greedy",
        "bitwise",
        "sieve",
        "implementation"
      ]
    },
    {
      "code": "CF_455_C",
      "name": "Civilization",
      "url": "https://codeforces.com/contest/455/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "dsu"
      ]
    },
    {
      "code": "CF_455_D",
      "name": "Serega and Fun",
      "url": "https://codeforces.com/contest/455/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sqrt-buckets",
        "sqrt-time"
      ]
    },
    {
      "code": "CF_455_E",
      "name": "Function",
      "url": "https://codeforces.com/contest/455/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp-convexhull",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_457_B",
      "name": "Distributed Join",
      "url": "https://codeforces.com/contest/457/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_459_D",
      "name": "Pashmak and Parmida's problem",
      "url": "https://codeforces.com/contest/459/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dnc",
        "fenwick",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_460_C",
      "name": "Present",
      "url": "https://codeforces.com/contest/460/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_460_D",
      "name": "Little Victor and Set",
      "url": "https://codeforces.com/contest/460/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_460_E",
      "name": "Roland and Rose",
      "url": "https://codeforces.com/contest/460/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "convexhull"
      ]
    },
    {
      "code": "CF_461_B",
      "name": "Appleman and Tree",
      "url": "https://codeforces.com/contest/461/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_463_D",
      "name": "Gargari and Permutations",
      "url": "https://codeforces.com/contest/463/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "topo_sort"
      ]
    },
    {
      "code": "CF_464_E",
      "name": "The Classic Problem",
      "url": "https://codeforces.com/contest/464/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "hash",
        "segtree_persistent"
      ]
    },
    {
      "code": "CF_466_C",
      "name": "Number of Ways",
      "url": "https://codeforces.com/contest/466/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "2_pointers",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_466_D",
      "name": "Increase Sequence",
      "url": "https://codeforces.com/contest/466/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "math-adhoc",
        "casework",
        "implementation",
        "dp-openclose"
      ]
    },
    {
      "code": "CF_467_C",
      "name": "George and Job",
      "url": "https://codeforces.com/contest/467/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_468_B",
      "name": "Two Sets",
      "url": "https://codeforces.com/contest/468/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "2sat"
      ]
    },
    {
      "code": "CF_46_E",
      "name": "Comb",
      "url": "https://codeforces.com/contest/46/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "number_theory",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_474_C",
      "name": "Captain Marmot",
      "url": "https://codeforces.com/contest/474/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "brute_force",
        "casework"
      ]
    },
    {
      "code": "CF_474_D",
      "name": "Flowers",
      "url": "https://codeforces.com/contest/474/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_474_E",
      "name": "Pillars",
      "url": "https://codeforces.com/contest/474/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "binary_search",
        "fenwick",
        "implementation"
      ]
    },
    {
      "code": "CF_475_E",
      "name": "Strongly Connected City 2",
      "url": "https://codeforces.com/contest/475/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "greedy",
        "biconnected",
        "strongly_connected"
      ]
    },
    {
      "code": "CF_478_C",
      "name": "Table Decorations",
      "url": "https://codeforces.com/contest/478/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_479_D",
      "name": "Long Jumps",
      "url": "https://codeforces.com/contest/479/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "CF_484_A",
      "name": "Bits",
      "url": "https://codeforces.com/contest/484/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "branch-bound",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_484_B",
      "name": "Maximum Value",
      "url": "https://codeforces.com/contest/484/problem/B",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_484_D",
      "name": "Kindergarten",
      "url": "https://codeforces.com/contest/484/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "mono_queue"
      ]
    },
    {
      "code": "CF_484_E",
      "name": "Sign on Fence",
      "url": "https://codeforces.com/contest/484/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "2_pointers",
        "segtree_persistent",
        "bin-search-parallel"
      ]
    },
    {
      "code": "CF_487_C",
      "name": "Prefix Product Sequence",
      "url": "https://codeforces.com/contest/487/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive"
      ]
    },
    {
      "code": "CF_487_D",
      "name": "Conveyor Belts",
      "url": "https://codeforces.com/contest/487/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_487_E",
      "name": "Tourists",
      "url": "https://codeforces.com/contest/487/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "block_cut_tree"
      ]
    },
    {
      "code": "CF_488_E",
      "name": "Prefix Product Sequence",
      "url": "https://codeforces.com/contest/488/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive"
      ]
    },
    {
      "code": "CF_489_F",
      "name": "Special Matrices",
      "url": "https://codeforces.com/contest/489/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp-count"
      ]
    },
    {
      "code": "CF_490_C",
      "name": "Hacking Cypher",
      "url": "https://codeforces.com/contest/490/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "brute_force",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_490_E",
      "name": "Restoring Increasing Sequence",
      "url": "https://codeforces.com/contest/490/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy"
      ]
    },
    {
      "code": "CF_492_E",
      "name": "Vanya and Field",
      "url": "https://codeforces.com/contest/492/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_494_B",
      "name": "Obsessive String",
      "url": "https://codeforces.com/contest/494/problem/B",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "dp"
      ]
    },
    {
      "code": "CF_49_D",
      "name": "Game",
      "url": "https://codeforces.com/contest/49/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "brute_force",
        "greedy",
        "dp-count",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_4_D",
      "name": "Mysterious Present",
      "url": "https://codeforces.com/contest/4/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "constructive"
      ]
    },
    {
      "code": "CF_501_D",
      "name": "Misha and Permutations Summation",
      "url": "https://codeforces.com/contest/501/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "CF_504_D",
      "name": "Misha and XOR",
      "url": "https://codeforces.com/contest/504/problem/D",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "bitset",
        "bitwise"
      ]
    },
    {
      "code": "CF_505_C",
      "name": "Mr. Kitayuta, the Treasure Hunter",
      "url": "https://codeforces.com/contest/505/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_506_C",
      "name": "Mr. Kitayuta vs. Bamboos",
      "url": "https://codeforces.com/contest/506/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "reversal"
      ]
    },
    {
      "code": "CF_506_D",
      "name": "Mr. Kitayuta's Colorful Graph",
      "url": "https://codeforces.com/contest/506/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dsu",
        "sqrt-2way"
      ]
    },
    {
      "code": "CF_508_D",
      "name": "Tanya and Password",
      "url": "https://codeforces.com/contest/508/problem/D",
      "judge": "Codeforces",
      "tags": [
        "euler_tour"
      ]
    },
    {
      "code": "CF_508_E",
      "name": "Arthur and Brackets",
      "url": "https://codeforces.com/contest/508/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_509_E",
      "name": "Pretty Song",
      "url": "https://codeforces.com/contest/509/problem/E",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_510_E",
      "name": "Fox And Dinner",
      "url": "https://codeforces.com/contest/510/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "stl"
      ]
    },
    {
      "code": "CF_513_E1",
      "name": "Subarray Cuts",
      "url": "https://codeforces.com/contest/513/problem/E1",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "dp"
      ]
    },
    {
      "code": "CF_513_E2",
      "name": "Subarray Cuts",
      "url": "https://codeforces.com/contest/513/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_513_G2",
      "name": "Inversions problem",
      "url": "https://codeforces.com/contest/513/problem/G2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "probability"
      ]
    },
    {
      "code": "CF_513_G3",
      "name": "Inversions problem",
      "url": "https://codeforces.com/contest/513/problem/G3",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_514_C",
      "name": "Watto and Mechanism",
      "url": "https://codeforces.com/contest/514/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "binary_search",
        "brute_force"
      ]
    },
    {
      "code": "CF_514_D",
      "name": "R2D2 and Droid Army",
      "url": "https://codeforces.com/contest/514/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "rmq"
      ]
    },
    {
      "code": "CF_515_D",
      "name": "Drazil and Tiles",
      "url": "https://codeforces.com/contest/515/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_516_C",
      "name": "Drazil and Park",
      "url": "https://codeforces.com/contest/516/problem/C",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum",
        "rmq"
      ]
    },
    {
      "code": "CF_516_D",
      "name": "Drazil and Morning Exercise",
      "url": "https://codeforces.com/contest/516/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "dsu"
      ]
    },
    {
      "code": "CF_518_D",
      "name": "Ilya and Escalator",
      "url": "https://codeforces.com/contest/518/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "probability"
      ]
    },
    {
      "code": "CF_518_E",
      "name": "Arthur and Questions",
      "url": "https://codeforces.com/contest/518/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_519_D",
      "name": "A and B and Interesting Substrings",
      "url": "https://codeforces.com/contest/519/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_519_E",
      "name": "A and B and Lecture Rooms",
      "url": "https://codeforces.com/problemset/problem/519/E",
      "judge": "Codeforces",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "CF_521_C",
      "name": "Pluses everywhere",
      "url": "https://codeforces.com/contest/521/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_521_E",
      "name": "Cycling City",
      "url": "https://codeforces.com/contest/521/problem/E",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "biconnected",
        "cactus_graph"
      ]
    },
    {
      "code": "CF_524_C",
      "name": "The Art of Dealing with ATM",
      "url": "https://codeforces.com/contest/524/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "CF_524_E",
      "name": "Rooks and Rectangles",
      "url": "https://codeforces.com/contest/524/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_524_F",
      "name": "And Yet Another Bracket Sequence",
      "url": "https://codeforces.com/contest/524/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "CF_525_D",
      "name": "Arthur and Walls",
      "url": "https://codeforces.com/contest/525/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_526_E",
      "name": "Transmitting Levels",
      "url": "https://codeforces.com/contest/526/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_527_E",
      "name": "Data Center Drama",
      "url": "https://codeforces.com/contest/527/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_528_D",
      "name": "Fuzzy Search",
      "url": "https://codeforces.com/contest/528/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_529_C",
      "name": "Rooks and Rectangles",
      "url": "https://codeforces.com/contest/529/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sweep_line"
      ]
    },
    {
      "code": "CF_529_D",
      "name": "Social Network",
      "url": "https://codeforces.com/contest/529/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_529_E",
      "name": "The Art of Dealing with ATM",
      "url": "https://codeforces.com/contest/529/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force"
      ]
    },
    {
      "code": "CF_52_C",
      "name": "Circular RMQ",
      "url": "https://codeforces.com/contest/52/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "rmq"
      ]
    },
    {
      "code": "CF_533_B",
      "name": "Work Group",
      "url": "https://codeforces.com/contest/533/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_534_D",
      "name": "Handshakes",
      "url": "https://codeforces.com/contest/534/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_538_F",
      "name": "A Heap of Heaps",
      "url": "https://codeforces.com/contest/538/problem/F",
      "judge": "Codeforces",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "CF_542_D",
      "name": "Superhero's Job",
      "url": "https://codeforces.com/contest/542/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_542_E",
      "name": "Playing on Graph",
      "url": "https://codeforces.com/contest/542/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_543_A",
      "name": "Writing Code",
      "url": "https://codeforces.com/contest/543/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_543_C",
      "name": "Remembering Strings",
      "url": "https://codeforces.com/contest/543/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_544_C",
      "name": "Writing Code",
      "url": "https://codeforces.com/contest/544/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_545_E",
      "name": "Paths and Trees",
      "url": "https://codeforces.com/contest/545/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "greedy",
        "greedy-more"
      ]
    },
    {
      "code": "CF_546_D",
      "name": "Soldier and Number Game",
      "url": "https://codeforces.com/contest/546/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "sieve"
      ]
    },
    {
      "code": "CF_546_E",
      "name": "Soldier and Traveling",
      "url": "https://codeforces.com/contest/546/problem/E",
      "judge": "Codeforces",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "CF_547_B",
      "name": "Mike and Feet",
      "url": "https://codeforces.com/contest/547/problem/B",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "mono_queue",
        "dsu"
      ]
    },
    {
      "code": "CF_547_C",
      "name": "Mike and Foam",
      "url": "https://codeforces.com/contest/547/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "inclusion-exclusion",
        "mobius",
        "sieve"
      ]
    },
    {
      "code": "CF_547_D",
      "name": "Mike and Fish",
      "url": "https://codeforces.com/contest/547/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "euler_tour",
        "constructive"
      ]
    },
    {
      "code": "CF_547_E",
      "name": "Mike and Friends",
      "url": "https://codeforces.com/contest/547/problem/E",
      "judge": "Codeforces",
      "tags": [
        "suffix_array",
        "rmq",
        "fenwick"
      ]
    },
    {
      "code": "CF_549_C",
      "name": "The Game Of Parity",
      "url": "https://codeforces.com/contest/549/problem/C",
      "judge": "Codeforces",
      "tags": [
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_549_F",
      "name": "Yura and Developers",
      "url": "https://codeforces.com/contest/549/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dnc"
      ]
    },
    {
      "code": "CF_54_E",
      "name": "Vacuum Сleaner",
      "url": "https://codeforces.com/contest/54/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "2_pointers"
      ]
    },
    {
      "code": "CF_550_D",
      "name": "Regular Bridge",
      "url": "https://codeforces.com/contest/550/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_551_E",
      "name": "GukiZ and GukiZiana",
      "url": "https://codeforces.com/contest/551/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_552_C",
      "name": "Vanya and Scales",
      "url": "https://codeforces.com/contest/552/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_552_D",
      "name": "Vanya and Triangles",
      "url": "https://codeforces.com/contest/552/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "geometry",
        "brute_force",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_553_C",
      "name": "Love Triangles",
      "url": "https://codeforces.com/contest/553/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph"
      ]
    },
    {
      "code": "CF_553_D",
      "name": "Nudist Beach",
      "url": "https://codeforces.com/contest/553/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dsu"
      ]
    },
    {
      "code": "CF_555_E",
      "name": "Case of Computer Network",
      "url": "https://codeforces.com/contest/555/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "hld",
        "lca",
        "biconnected",
        "offline-query"
      ]
    },
    {
      "code": "CF_558_E",
      "name": "A Simple Task",
      "url": "https://codeforces.com/contest/558/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_559_C",
      "name": "Gerald and Giant Chess",
      "url": "https://codeforces.com/contest/559/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count",
        "dp-swap-label"
      ]
    },
    {
      "code": "CF_55_E",
      "name": "Very simple problem",
      "url": "https://codeforces.com/contest/55/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "geometry",
        "2_pointers",
        "combination"
      ]
    },
    {
      "code": "CF_566_B",
      "name": "Replicating Processes",
      "url": "https://codeforces.com/contest/566/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "reversal"
      ]
    },
    {
      "code": "CF_566_D",
      "name": "Restructuring Company",
      "url": "https://codeforces.com/contest/566/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dsu"
      ]
    },
    {
      "code": "CF_567_C",
      "name": "Geometric Progression",
      "url": "https://codeforces.com/contest/567/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "binary_search",
        "implementation"
      ]
    },
    {
      "code": "CF_567_D",
      "name": "One-Dimensional Battle Ships",
      "url": "https://codeforces.com/contest/567/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "sweep_line"
      ]
    },
    {
      "code": "CF_567_E",
      "name": "President and Roads",
      "url": "https://codeforces.com/contest/567/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "hash"
      ]
    },
    {
      "code": "CF_567_F",
      "name": "Mausoleum",
      "url": "https://codeforces.com/contest/567/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_568_E",
      "name": "Longest Increasing Subsequence",
      "url": "https://codeforces.com/contest/568/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_56_D",
      "name": "Changing a String",
      "url": "https://codeforces.com/contest/56/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "implementation"
      ]
    },
    {
      "code": "CF_570_D",
      "name": "Tree Requests",
      "url": "https://codeforces.com/contest/570/problem/D",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "dp_on_tree",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_570_E",
      "name": "Pig and Palindromes",
      "url": "https://codeforces.com/contest/570/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp-count"
      ]
    },
    {
      "code": "CF_571_B",
      "name": "Minimization",
      "url": "https://codeforces.com/contest/571/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_571_C",
      "name": "CNF 2",
      "url": "https://codeforces.com/contest/571/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_575_I",
      "name": "Robots protection",
      "url": "https://codeforces.com/contest/575/problem/I",
      "judge": "Codeforces",
      "tags": [
        "fenwick_2d"
      ]
    },
    {
      "code": "CF_577_E",
      "name": "Points on Plane",
      "url": "https://codeforces.com/contest/577/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_578_C",
      "name": "Weakness and Poorness",
      "url": "https://codeforces.com/contest/578/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "ternary-search"
      ]
    },
    {
      "code": "CF_580_D",
      "name": "Kefa and Dishes",
      "url": "https://codeforces.com/contest/580/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_581_D",
      "name": "Three Logos",
      "url": "https://codeforces.com/contest/581/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_581_E",
      "name": "Kojiro and Furrari",
      "url": "https://codeforces.com/contest/581/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_585_B",
      "name": "Phillip and Trains",
      "url": "https://codeforces.com/contest/585/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "reversal"
      ]
    },
    {
      "code": "CF_585_D",
      "name": "Lizard Era: Beginning",
      "url": "https://codeforces.com/contest/585/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "meet-in-the-middle"
      ]
    },
    {
      "code": "CF_585_E",
      "name": "Present for Vitalik the Philatelist",
      "url": "https://codeforces.com/contest/585/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "bitwise",
        "math-adhoc",
        "inclusion-exclusion",
        "mobius",
        "sieve"
      ]
    },
    {
      "code": "CF_587_C",
      "name": "Duff in the Army",
      "url": "https://codeforces.com/contest/587/problem/C",
      "judge": "Codeforces",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "CF_587_D",
      "name": "Duff in Mafia",
      "url": "https://codeforces.com/contest/587/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "2sat"
      ]
    },
    {
      "code": "CF_590_C",
      "name": "Three States",
      "url": "https://codeforces.com/contest/590/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_590_E",
      "name": "Birthday",
      "url": "https://codeforces.com/problemset/problem/590/E",
      "judge": "Codeforces",
      "tags": [
        "matching",
        "aho"
      ]
    },
    {
      "code": "CF_592_D",
      "name": "Super M",
      "url": "https://codeforces.com/contest/592/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_594_D",
      "name": "REQ",
      "url": "https://codeforces.com/contest/594/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sweep_line",
        "fenwick",
        "sieve"
      ]
    },
    {
      "code": "CF_595_C",
      "name": "Warrior and Archer",
      "url": "https://codeforces.com/contest/595/problem/C",
      "judge": "Codeforces",
      "tags": [
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_598_C",
      "name": "Nearest vectors",
      "url": "https://codeforces.com/contest/598/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "implementation"
      ]
    },
    {
      "code": "CF_598_D",
      "name": "Igor In the Museum",
      "url": "https://codeforces.com/contest/598/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "implementation"
      ]
    },
    {
      "code": "CF_598_E",
      "name": "Chocolate Bar",
      "url": "https://codeforces.com/contest/598/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force"
      ]
    },
    {
      "code": "CF_598_F",
      "name": "Cut Length",
      "url": "https://codeforces.com/contest/598/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hard-implementation",
        "geometry"
      ]
    },
    {
      "code": "CF_5_C",
      "name": "Longest Regular Bracket Sequence",
      "url": "https://codeforces.com/contest/5/problem/C",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "ad_hoc",
        "constructive",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_600_C",
      "name": "Make Palindrome",
      "url": "https://codeforces.com/contest/600/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "greedy"
      ]
    },
    {
      "code": "CF_600_D",
      "name": "Area of Two Circles' Intersection",
      "url": "https://codeforces.com/contest/600/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "CF_600_E",
      "name": "Lomsat gelral",
      "url": "https://codeforces.com/contest/600/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "dsu"
      ]
    },
    {
      "code": "CF_600_F",
      "name": "Edge coloring of bipartite graph",
      "url": "https://codeforces.com/contest/600/problem/F",
      "judge": "Codeforces",
      "tags": [
        "matching",
        "ad_hoc",
        "matching-hall"
      ]
    },
    {
      "code": "CF_601_B",
      "name": "Lipshitz Sequence",
      "url": "https://codeforces.com/contest/601/problem/B",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_601_C",
      "name": "Kleofáš and the n-thlon",
      "url": "https://codeforces.com/contest/601/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "probability"
      ]
    },
    {
      "code": "CF_601_D",
      "name": "Acyclic Organic Compounds",
      "url": "https://codeforces.com/contest/601/problem/D",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "dp_on_tree",
        "dsu",
        "small-to-large"
      ]
    },
    {
      "code": "CF_603_C",
      "name": "Lieges of Legendre",
      "url": "https://codeforces.com/contest/603/problem/C",
      "judge": "Codeforces",
      "tags": [
        "Grundy",
        "nim"
      ]
    },
    {
      "code": "CF_604_D",
      "name": "Moodular Arithmetic",
      "url": "https://codeforces.com/contest/604/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "dsu",
        "casework"
      ]
    },
    {
      "code": "CF_605_C",
      "name": "Freelancer's Dreams",
      "url": "https://codeforces.com/contest/605/problem/C",
      "judge": "Codeforces",
      "tags": [
        "convexhull"
      ]
    },
    {
      "code": "CF_607_B",
      "name": "Zuma",
      "url": "https://codeforces.com/contest/607/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_607_C",
      "name": "Marbles",
      "url": "https://codeforces.com/contest/607/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "kmp",
        "z_func"
      ]
    },
    {
      "code": "CF_607_D",
      "name": "Power Tree",
      "url": "https://codeforces.com/contest/607/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_609_C",
      "name": "Load Balancing",
      "url": "https://codeforces.com/contest/609/problem/C",
      "judge": "Codeforces",
      "tags": [
        "implementation",
        "math-adhoc",
        "greedy"
      ]
    },
    {
      "code": "CF_609_D",
      "name": "Gadgets for dollars and pounds",
      "url": "https://codeforces.com/contest/609/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_609_E",
      "name": "Minimum spanning tree for each edge",
      "url": "https://codeforces.com/contest/609/problem/E",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "lca",
        "dsu"
      ]
    },
    {
      "code": "CF_609_F",
      "name": "Frogs and mosquitoes",
      "url": "https://codeforces.com/contest/609/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_60_D",
      "name": "Savior",
      "url": "https://codeforces.com/contest/60/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "dsu",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_610_E",
      "name": "Alphabet Permutations",
      "url": "https://codeforces.com/contest/610/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "CF_611_D",
      "name": "New Year and Ancient Prophecy",
      "url": "https://codeforces.com/contest/611/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_611_E",
      "name": "New Year and Three Musketeers",
      "url": "https://codeforces.com/contest/611/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "casework"
      ]
    },
    {
      "code": "CF_612_C",
      "name": "Replace To Make Regular Bracket Sequence",
      "url": "https://codeforces.com/contest/612/problem/C",
      "judge": "Codeforces",
      "tags": [
        "implementation",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_612_D",
      "name": "The Union of k-Segments",
      "url": "https://codeforces.com/contest/612/problem/D",
      "judge": "Codeforces",
      "tags": [
        "implementation",
        "greedy",
        "sweep_line"
      ]
    },
    {
      "code": "CF_612_E",
      "name": "Square Root of Permutation",
      "url": "https://codeforces.com/contest/612/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_612_F",
      "name": "Simba on the Circle",
      "url": "https://codeforces.com/contest/612/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_613_D",
      "name": "Kingdom and its Cities",
      "url": "https://codeforces.com/contest/613/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "dp_on_tree",
        "lca"
      ]
    },
    {
      "code": "CF_613_E",
      "name": "Puzzle Lover",
      "url": "https://codeforces.com/contest/613/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "dp",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_615_D",
      "name": "Multipliers",
      "url": "https://codeforces.com/contest/615/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "multiplicative"
      ]
    },
    {
      "code": "CF_615_E",
      "name": "Hexagons",
      "url": "https://codeforces.com/contest/615/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_616_C",
      "name": "The Labyrinth",
      "url": "https://codeforces.com/contest/616/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_616_D",
      "name": "Longest k-Good Segment",
      "url": "https://codeforces.com/contest/616/problem/D",
      "judge": "Codeforces",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "CF_616_E",
      "name": "Sum of Remainders",
      "url": "https://codeforces.com/contest/616/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "implementation"
      ]
    },
    {
      "code": "CF_616_F",
      "name": "Expensive Strings",
      "url": "https://codeforces.com/contest/616/problem/F",
      "judge": "Codeforces",
      "tags": [
        "suffix_array"
      ]
    },
    {
      "code": "CF_617_E",
      "name": "XOR and Favorite Number",
      "url": "https://codeforces.com/contest/617/problem/E",
      "judge": "Codeforces",
      "tags": [
        "mo-general"
      ]
    },
    {
      "code": "CF_618_E",
      "name": "Robot Arm",
      "url": "https://codeforces.com/contest/618/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "geometry"
      ]
    },
    {
      "code": "CF_61_E",
      "name": "Enemy is weak",
      "url": "https://codeforces.com/contest/61/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "dp",
        "fenwick",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_620_C",
      "name": "Pearls in a Row",
      "url": "https://codeforces.com/contest/620/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_620_D",
      "name": "Professor GukiZ and Two Arrays",
      "url": "https://codeforces.com/contest/620/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "2_pointers"
      ]
    },
    {
      "code": "CF_620_E",
      "name": "New Year Tree",
      "url": "https://codeforces.com/contest/620/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp_bitmask",
        "bitset",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_620_F",
      "name": "Xors on Segments",
      "url": "https://codeforces.com/contest/620/problem/F",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "mo-general"
      ]
    },
    {
      "code": "CF_621_E",
      "name": "Wet Shark and Blocks",
      "url": "https://codeforces.com/problemset/problem/621/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_622_C",
      "name": "Not Equal on a Segment",
      "url": "https://codeforces.com/contest/622/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "CF_622_D",
      "name": "Optimal Number Permutation",
      "url": "https://codeforces.com/contest/622/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_622_F",
      "name": "The Sum of the k-th Powers",
      "url": "https://codeforces.com/contest/622/problem/F",
      "judge": "Codeforces",
      "tags": [
        "lagrange-inter"
      ]
    },
    {
      "code": "CF_623_B",
      "name": "Array GCD",
      "url": "https://codeforces.com/contest/623/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "greedy"
      ]
    },
    {
      "code": "CF_623_D",
      "name": "Birthday",
      "url": "https://codeforces.com/contest/623/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "probability"
      ]
    },
    {
      "code": "CF_625_D",
      "name": "Finals in arithmetic",
      "url": "https://codeforces.com/contest/625/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_digit"
      ]
    },
    {
      "code": "CF_626_E",
      "name": "Simple Skewness",
      "url": "https://codeforces.com/contest/626/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy-exchange",
        "math-adhoc",
        "ternary-search"
      ]
    },
    {
      "code": "CF_626_F",
      "name": "Group Projects",
      "url": "https://codeforces.com/contest/626/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-openclose"
      ]
    },
    {
      "code": "CF_627_A",
      "name": "XOR Equation",
      "url": "https://codeforces.com/contest/627/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "dp-count",
        "branch-bound",
        "bitwise"
      ]
    },
    {
      "code": "CF_628_C",
      "name": "Bear and String Distance",
      "url": "https://codeforces.com/contest/628/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_628_D",
      "name": "Magic Numbers",
      "url": "https://codeforces.com/contest/628/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_digit",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_629_E",
      "name": "Famil Door and Roads",
      "url": "https://codeforces.com/contest/629/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "lca"
      ]
    },
    {
      "code": "CF_630_I",
      "name": "Parking Lot",
      "url": "https://codeforces.com/contest/630/problem/I",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_630_Q",
      "name": "Pyramids",
      "url": "https://codeforces.com/contest/630/problem/Q",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_631_E",
      "name": "Product Sum",
      "url": "https://codeforces.com/contest/631/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "CF_632_C",
      "name": "The Smallest String Concatenation",
      "url": "https://codeforces.com/contest/632/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_632_D",
      "name": "Longest Subsequence",
      "url": "https://codeforces.com/contest/632/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "brute_force"
      ]
    },
    {
      "code": "CF_632_E",
      "name": "Thief in a Shop",
      "url": "https://codeforces.com/contest/632/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dnc",
        "fft"
      ]
    },
    {
      "code": "CF_632_F",
      "name": "Magic Matrix",
      "url": "https://codeforces.com/contest/632/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "mst",
        "dsu"
      ]
    },
    {
      "code": "CF_633_C",
      "name": "Spy Syndrome 2",
      "url": "https://codeforces.com/contest/633/problem/C",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "trie",
        "dp",
        "implementation"
      ]
    },
    {
      "code": "CF_633_D",
      "name": "Fibonacci-ish",
      "url": "https://codeforces.com/contest/633/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "brute_force",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_633_E",
      "name": "Startup Funding",
      "url": "https://codeforces.com/contest/633/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "binary_lifting",
        "sparse_table"
      ]
    },
    {
      "code": "CF_633_F",
      "name": "The Chocolate Spree",
      "url": "https://codeforces.com/contest/633/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_634_D",
      "name": "Package Delivery",
      "url": "https://codeforces.com/contest/634/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_634_E",
      "name": "Preorder Test",
      "url": "https://codeforces.com/contest/634/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_635_C",
      "name": "XOR Equation",
      "url": "https://codeforces.com/contest/635/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask",
        "dp-count",
        "branch-bound",
        "bitwise"
      ]
    },
    {
      "code": "CF_639_D",
      "name": "Bear and Contribution",
      "url": "https://codeforces.com/problemset/problem/639/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "number_theory",
        "math-adhoc",
        "greedy"
      ]
    },
    {
      "code": "CF_63_E",
      "name": "Sweets Game",
      "url": "https://codeforces.com/problemset/problem/63/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_643_C",
      "name": "Levels and Regions",
      "url": "https://codeforces.com/contest/643/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp-dnc",
        "probability"
      ]
    },
    {
      "code": "CF_650_D",
      "name": "Zip-line",
      "url": "https://codeforces.com/contest/650/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_652_C",
      "name": "Foe Pairs",
      "url": "https://codeforces.com/contest/652/problem/C",
      "judge": "Codeforces",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "CF_652_D",
      "name": "Nested Segments",
      "url": "https://codeforces.com/contest/652/problem/D",
      "judge": "Codeforces",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "CF_653_D",
      "name": "Delivery Bears",
      "url": "https://codeforces.com/contest/653/problem/D",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "binary_search"
      ]
    },
    {
      "code": "CF_653_E",
      "name": "Bear and Forgotten Tree 2",
      "url": "https://codeforces.com/contest/653/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "2_pointers",
        "graph",
        "dsu"
      ]
    },
    {
      "code": "CF_653_F",
      "name": "Paper task",
      "url": "https://codeforces.com/contest/653/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "suffix_array",
        "binary_search"
      ]
    },
    {
      "code": "CF_653_G",
      "name": "Move by Prime",
      "url": "https://codeforces.com/contest/653/problem/G",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_659_E",
      "name": "New Reform",
      "url": "https://codeforces.com/contest/659/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_663_C",
      "name": "Graph Coloring",
      "url": "https://codeforces.com/contest/663/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "2sat",
        "graph"
      ]
    },
    {
      "code": "CF_665_E",
      "name": "Beautiful Subarrays",
      "url": "https://codeforces.com/contest/665/problem/E",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "greedy",
        "bitwise"
      ]
    },
    {
      "code": "CF_666_B",
      "name": "World Tour",
      "url": "https://codeforces.com/contest/666/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "graph"
      ]
    },
    {
      "code": "CF_671_A",
      "name": "Recycling Bottles",
      "url": "https://codeforces.com/contest/671/problem/A",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "geometry",
        "greedy",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_675_E",
      "name": "Trains and Statistic",
      "url": "https://codeforces.com/contest/675/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_676_E",
      "name": "The Last Fight Between Human and AI",
      "url": "https://codeforces.com/contest/676/problem/E",
      "judge": "Codeforces",
      "tags": [
        "game_theory_adhoc",
        "math-adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_678_E",
      "name": "Another Sith Tournament",
      "url": "https://codeforces.com/contest/678/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "probability"
      ]
    },
    {
      "code": "CF_678_F",
      "name": "Lena and Queries",
      "url": "https://codeforces.com/contest/678/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp-convexhull",
        "2_pointers",
        "sqrt-buckets",
        "offline-query"
      ]
    },
    {
      "code": "CF_682_D",
      "name": "Alyona and Strings",
      "url": "https://codeforces.com/contest/682/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_682_E",
      "name": "Alyona and Triangles",
      "url": "https://codeforces.com/contest/682/problem/E",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "convexhull",
        "2_pointers"
      ]
    },
    {
      "code": "CF_685_A",
      "name": "Robbers' watch",
      "url": "https://codeforces.com/contest/685/problem/A",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_685_B",
      "name": "Kay and Snowflake",
      "url": "https://codeforces.com/contest/685/problem/B",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_685_D",
      "name": "Kay and Eternity",
      "url": "https://codeforces.com/contest/685/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "sweep_line"
      ]
    },
    {
      "code": "CF_687_B",
      "name": "Remainders Game",
      "url": "https://codeforces.com/contest/687/problem/B",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "sieve"
      ]
    },
    {
      "code": "CF_687_C",
      "name": "The Values You Can Make",
      "url": "https://codeforces.com/contest/687/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "bitset",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_688_E",
      "name": "The Values You Can Make",
      "url": "https://codeforces.com/contest/688/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_689_C",
      "name": "Mike and Chocolate Thieves",
      "url": "https://codeforces.com/contest/689/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_689_E",
      "name": "Mike and Geometry Problem",
      "url": "https://codeforces.com/contest/689/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "combination"
      ]
    },
    {
      "code": "CF_690_C3",
      "name": "Brain Network (hard)",
      "url": "https://codeforces.com/contest/690/problem/C3",
      "judge": "Codeforces",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "CF_691_D",
      "name": "Swaps in Permutation",
      "url": "https://codeforces.com/contest/691/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_696_D",
      "name": "Legen...",
      "url": "https://codeforces.com/contest/696/problem/D",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "aho"
      ]
    },
    {
      "code": "CF_696_E",
      "name": "...Wait for it...",
      "url": "https://codeforces.com/contest/696/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hld",
        "lca"
      ]
    },
    {
      "code": "CF_698_C",
      "name": "LRU",
      "url": "https://codeforces.com/contest/698/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp-sos",
        "math-adhoc",
        "inclusion-exclusion",
        "probability"
      ]
    },
    {
      "code": "CF_702_F",
      "name": "T-Shirts",
      "url": "https://codeforces.com/contest/702/problem/F",
      "judge": "Codeforces",
      "tags": [
        "bbst",
        "small-to-large"
      ]
    },
    {
      "code": "CF_703_E",
      "name": "Mishka and Divisors",
      "url": "https://codeforces.com/contest/703/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory"
      ]
    },
    {
      "code": "CF_706_D",
      "name": "Vasiliy's Multiset",
      "url": "https://codeforces.com/contest/706/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "trie",
        "greedy",
        "bitwise",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_707_D",
      "name": "Persistent Bookcase",
      "url": "https://codeforces.com/contest/707/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "segment_tree"
      ]
    },
    {
      "code": "CF_70_D",
      "name": "Professor's task",
      "url": "https://codeforces.com/contest/70/problem/D",
      "judge": "Codeforces",
      "tags": [
        "lichao-tree"
      ]
    },
    {
      "code": "CF_710_D",
      "name": "Two Arithmetic Progressions",
      "url": "https://codeforces.com/contest/710/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_710_F",
      "name": "String Set Queries",
      "url": "https://codeforces.com/contest/710/problem/F",
      "judge": "Codeforces",
      "tags": [
        "aho",
        "small-to-large"
      ]
    },
    {
      "code": "CF_711_C",
      "name": "Coloring Trees",
      "url": "https://codeforces.com/contest/711/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_711_E",
      "name": "ZS and The Birthday Paradox",
      "url": "https://codeforces.com/contest/711/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "probability"
      ]
    },
    {
      "code": "CF_713_C",
      "name": "Sonya and Problem Wihtout a Legend",
      "url": "https://codeforces.com/contest/713/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-slope"
      ]
    },
    {
      "code": "CF_715_B",
      "name": "Complete The Graph",
      "url": "https://codeforces.com/contest/715/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "CF_715_C",
      "name": "Digit Tree",
      "url": "https://codeforces.com/contest/715/problem/C",
      "judge": "Codeforces",
      "tags": [
        "Centroid",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_716_E",
      "name": "Digit Tree",
      "url": "https://codeforces.com/contest/716/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "Centroid"
      ]
    },
    {
      "code": "CF_717_E",
      "name": "Paint it really, really dark gray",
      "url": "https://codeforces.com/contest/717/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_717_G",
      "name": "Underfail",
      "url": "https://codeforces.com/contest/717/problem/G",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_718_C",
      "name": "Sasha and Array",
      "url": "https://codeforces.com/contest/718/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_720_A",
      "name": "Closing ceremony",
      "url": "https://codeforces.com/contest/720/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_720_B",
      "name": "Cactusophobia",
      "url": "https://codeforces.com/contest/720/problem/B",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "cycle"
      ]
    },
    {
      "code": "CF_721_D",
      "name": "Maxim and Array",
      "url": "https://codeforces.com/contest/721/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "number_theory",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_722_D",
      "name": "Generating Sets",
      "url": "https://codeforces.com/contest/722/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_722_E",
      "name": "Research Rover",
      "url": "https://codeforces.com/contest/722/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_723_E",
      "name": "One-Way Reform",
      "url": "https://codeforces.com/contest/723/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "euler_tour",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_727_D",
      "name": "T-shirts Distribution",
      "url": "https://codeforces.com/contest/727/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "casework"
      ]
    },
    {
      "code": "CF_727_F",
      "name": "Polycarp's problems",
      "url": "https://codeforces.com/contest/727/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_729_D",
      "name": "Sea Battle",
      "url": "https://codeforces.com/contest/729/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_729_E",
      "name": "Subordinates",
      "url": "https://codeforces.com/contest/729/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_730_J",
      "name": "Bottles",
      "url": "https://codeforces.com/contest/730/problem/J",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_731_F",
      "name": "Video Cards",
      "url": "https://codeforces.com/contest/731/problem/F",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_732_F",
      "name": "Tourist Reform",
      "url": "https://codeforces.com/contest/732/problem/F",
      "judge": "Codeforces",
      "tags": [
        "cycle",
        "biconnected"
      ]
    },
    {
      "code": "CF_733_D",
      "name": "Kostya the Sculptor",
      "url": "https://codeforces.com/contest/733/problem/D",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_734_D",
      "name": "Anton and Chess",
      "url": "https://codeforces.com/contest/734/problem/D",
      "judge": "Codeforces",
      "tags": [
        "implementation"
      ]
    },
    {
      "code": "CF_734_E",
      "name": "Anton and Tree",
      "url": "https://codeforces.com/contest/734/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_734_F",
      "name": "Anton and School",
      "url": "https://codeforces.com/contest/734/problem/F",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_735_D",
      "name": "Taxes",
      "url": "https://codeforces.com/contest/735/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_736_C",
      "name": "Ostap and Tree",
      "url": "https://codeforces.com/contest/736/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_737_C",
      "name": "Subordinates",
      "url": "https://codeforces.com/contest/737/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_737_D",
      "name": "Financiers Game",
      "url": "https://codeforces.com/contest/737/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_738_D",
      "name": "Sea Battle",
      "url": "https://codeforces.com/contest/738/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_739_B",
      "name": "Alyona and a tree",
      "url": "https://codeforces.com/contest/739/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "binary_search"
      ]
    },
    {
      "code": "CF_739_C",
      "name": "Alyona and towers",
      "url": "https://codeforces.com/contest/739/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_739_E",
      "name": "Gosha is hunting",
      "url": "https://codeforces.com/contest/739/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dp-alien"
      ]
    },
    {
      "code": "CF_73_C",
      "name": "LionAge II",
      "url": "https://codeforces.com/contest/73/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_741_D",
      "name": "Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths",
      "url": "https://codeforces.com/contest/741/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dsu",
        "small-to-large"
      ]
    },
    {
      "code": "CF_742_D",
      "name": "Arpa's weak amphitheater and Mehrdad's valuable Hoses",
      "url": "https://codeforces.com/contest/742/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dsu"
      ]
    },
    {
      "code": "CF_743_D",
      "name": "Chloe and pleasant prizes",
      "url": "https://codeforces.com/contest/743/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_743_E",
      "name": "Vladik and cards",
      "url": "https://codeforces.com/contest/743/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "binary_search",
        "bitwise"
      ]
    },
    {
      "code": "CF_744_C",
      "name": "Hongcow Buys a Deck of Cards",
      "url": "https://codeforces.com/contest/744/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_746_F",
      "name": "Music in Car",
      "url": "https://codeforces.com/contest/746/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "2_pointers"
      ]
    },
    {
      "code": "CF_747_D",
      "name": "Winter Is Coming",
      "url": "https://codeforces.com/contest/747/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_747_F",
      "name": "Igor and Interesting Numbers",
      "url": "https://codeforces.com/contest/747/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_748_D",
      "name": "Santa Claus and a Palindrome",
      "url": "https://codeforces.com/contest/748/problem/D",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_748_E",
      "name": "Santa Claus and Tangerines",
      "url": "https://codeforces.com/contest/748/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_749_D",
      "name": "Leaving Auction",
      "url": "https://codeforces.com/contest/749/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "CF_750_E",
      "name": "New Year and Old Subsequence",
      "url": "https://codeforces.com/contest/750/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_755_D",
      "name": "PolandBall and Polygon",
      "url": "https://codeforces.com/contest/755/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_756_C",
      "name": "Nikita and stack",
      "url": "https://codeforces.com/contest/756/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_756_D",
      "name": "Bacterial Melee",
      "url": "https://codeforces.com/contest/756/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_757_D",
      "name": "Felicity's Big Secret Revealed",
      "url": "https://codeforces.com/contest/757/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "bitwise"
      ]
    },
    {
      "code": "CF_757_E",
      "name": "Bash Plays with Functions",
      "url": "https://codeforces.com/contest/757/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "multiplicative",
        "sieve"
      ]
    },
    {
      "code": "CF_757_F",
      "name": "Team Rocket Rises Again",
      "url": "https://codeforces.com/contest/757/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "segment_tree",
        "lca"
      ]
    },
    {
      "code": "CF_758_C",
      "name": "Unfair Poll",
      "url": "https://codeforces.com/contest/758/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "constructive",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_758_D",
      "name": "Ability To Convert",
      "url": "https://codeforces.com/contest/758/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_759_C",
      "name": "Nikita and stack",
      "url": "https://codeforces.com/contest/759/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "segtree_walk"
      ]
    },
    {
      "code": "CF_760_D",
      "name": "Travel Card",
      "url": "https://codeforces.com/contest/760/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_761_D",
      "name": "Dasha and Very Difficult Problem",
      "url": "https://codeforces.com/contest/761/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "CF_761_E",
      "name": "Dasha and Puzzle",
      "url": "https://codeforces.com/contest/761/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_761_F",
      "name": "Dasha and Photos",
      "url": "https://codeforces.com/contest/761/problem/F",
      "judge": "Codeforces",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "CF_762_C",
      "name": "Two strings",
      "url": "https://codeforces.com/contest/762/problem/C",
      "judge": "Codeforces",
      "tags": [
        "2_pointers",
        "implementation"
      ]
    },
    {
      "code": "CF_762_D",
      "name": "Maximum path",
      "url": "https://codeforces.com/contest/762/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_bitmask",
        "casework"
      ]
    },
    {
      "code": "CF_763_B",
      "name": "Timofey and rectangles",
      "url": "https://codeforces.com/contest/763/problem/B",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_763_C",
      "name": "Timofey and remoduling",
      "url": "https://codeforces.com/contest/763/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "constructive"
      ]
    },
    {
      "code": "CF_764_D",
      "name": "Timofey and rectangles",
      "url": "https://codeforces.com/contest/764/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "constructive"
      ]
    },
    {
      "code": "CF_765_D",
      "name": "Artsem and Saunders",
      "url": "https://codeforces.com/contest/765/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_765_E",
      "name": "Tree Folding",
      "url": "https://codeforces.com/contest/765/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_765_F",
      "name": "Souvenirs",
      "url": "https://codeforces.com/contest/765/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_766_C",
      "name": "Mahmoud and a Message",
      "url": "https://codeforces.com/contest/766/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_766_E",
      "name": "Mahmoud and a xor trip",
      "url": "https://codeforces.com/contest/766/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp_on_tree",
        "lca",
        "Centroid"
      ]
    },
    {
      "code": "CF_767_B",
      "name": "The Queue",
      "url": "https://codeforces.com/contest/767/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "greedy-more",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_767_C",
      "name": "Garland",
      "url": "https://codeforces.com/contest/767/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "CF_767_D",
      "name": "Cartons of milk",
      "url": "https://codeforces.com/contest/767/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_767_E",
      "name": "Change-free",
      "url": "https://codeforces.com/contest/767/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_768_D",
      "name": "Jon and Orbs",
      "url": "https://codeforces.com/contest/768/problem/D",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count",
        "probability"
      ]
    },
    {
      "code": "CF_768_E",
      "name": "Game of Stones",
      "url": "https://codeforces.com/contest/768/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "Grundy"
      ]
    },
    {
      "code": "CF_768_F",
      "name": "Barrels and boxes",
      "url": "https://codeforces.com/contest/768/problem/F",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_771_D",
      "name": "Bear and Company",
      "url": "https://codeforces.com/contest/771/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_772_C",
      "name": "Vulnerable Kerbals",
      "url": "https://codeforces.com/contest/772/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "constructive",
        "extgcd"
      ]
    },
    {
      "code": "CF_773_D",
      "name": "Perishable Roads",
      "url": "https://codeforces.com/contest/773/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "CF_776_D",
      "name": "The Door Problem",
      "url": "https://codeforces.com/contest/776/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "2sat"
      ]
    },
    {
      "code": "CF_777_D",
      "name": "Cloud of Hashtags",
      "url": "https://codeforces.com/contest/777/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_777_E",
      "name": "Hanoi Factory",
      "url": "https://codeforces.com/contest/777/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp-dag",
        "fenwick",
        "topo_sort"
      ]
    },
    {
      "code": "CF_778_B",
      "name": "Bitwise Formula",
      "url": "https://codeforces.com/contest/778/problem/B",
      "judge": "Codeforces",
      "tags": [
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_778_D",
      "name": "Parquet Re-laying",
      "url": "https://codeforces.com/contest/778/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_77_E",
      "name": "Martian Food",
      "url": "https://codeforces.com/contest/77/problem/E",
      "judge": "Codeforces",
      "tags": [
        "inversive-geometry"
      ]
    },
    {
      "code": "CF_780_D",
      "name": "Innokenty and a Football League",
      "url": "https://codeforces.com/contest/780/problem/D",
      "judge": "Codeforces",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "CF_781_D",
      "name": "Axel and Marston in Bitland",
      "url": "https://codeforces.com/contest/781/problem/D",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "bitset"
      ]
    },
    {
      "code": "CF_785_E",
      "name": "Anton and Permutation",
      "url": "https://codeforces.com/contest/785/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_786_B",
      "name": "Legacy",
      "url": "https://codeforces.com/contest/786/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "segment_tree"
      ]
    },
    {
      "code": "CF_786_C",
      "name": "Till I Collapse",
      "url": "https://codeforces.com/contest/786/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "segtree_persistent"
      ]
    },
    {
      "code": "CF_787_D",
      "name": "Legacy",
      "url": "https://codeforces.com/contest/787/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "segment_tree"
      ]
    },
    {
      "code": "CF_788_C",
      "name": "The Great Mixing",
      "url": "https://codeforces.com/contest/788/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra"
      ]
    },
    {
      "code": "CF_78_E",
      "name": "Evacuation",
      "url": "https://codeforces.com/contest/78/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "flow"
      ]
    },
    {
      "code": "CF_792_C",
      "name": "Divide by Three",
      "url": "https://codeforces.com/contest/792/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "casework"
      ]
    },
    {
      "code": "CF_792_D",
      "name": "Paths in a Complete Binary Tree",
      "url": "https://codeforces.com/contest/792/problem/D",
      "judge": "Codeforces",
      "tags": [
        "bitwise"
      ]
    },
    {
      "code": "CF_792_F",
      "name": "Mages and Monsters",
      "url": "https://codeforces.com/contest/792/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "convexhull"
      ]
    },
    {
      "code": "CF_793_C",
      "name": "Mice problem",
      "url": "https://codeforces.com/contest/793/problem/C",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "casework"
      ]
    },
    {
      "code": "CF_794_E",
      "name": "Choosing Carrot",
      "url": "https://codeforces.com/contest/794/problem/E",
      "judge": "Codeforces",
      "tags": [
        "minimax",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "CF_794_F",
      "name": "Leha and security system",
      "url": "https://codeforces.com/contest/794/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_796_D",
      "name": "Police Stations",
      "url": "https://codeforces.com/contest/796/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_796_E",
      "name": "Exam Cheating",
      "url": "https://codeforces.com/contest/796/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_798_C",
      "name": "Mike and gcd problem",
      "url": "https://codeforces.com/contest/798/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_798_D",
      "name": "Mike and distribution",
      "url": "https://codeforces.com/contest/798/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_799_D",
      "name": "Field expansion",
      "url": "https://codeforces.com/contest/799/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_800_C",
      "name": "Vulnerable Kerbals",
      "url": "https://codeforces.com/contest/800/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "extgcd"
      ]
    },
    {
      "code": "CF_800_D",
      "name": "Varying Kibibits",
      "url": "https://codeforces.com/contest/800/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp-sos"
      ]
    },
    {
      "code": "CF_801_E",
      "name": "Vulnerable Kerbals",
      "url": "https://codeforces.com/contest/801/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-dag"
      ]
    },
    {
      "code": "CF_802_N",
      "name": "April Fools' Problem (medium)",
      "url": "https://codeforces.com/contest/802/problem/N",
      "judge": "Codeforces",
      "tags": [
        "dp-alien"
      ]
    },
    {
      "code": "CF_802_O",
      "name": "April Fools' Problem (hard)",
      "url": "https://codeforces.com/contest/802/problem/O",
      "judge": "Codeforces",
      "tags": [
        "dp-alien"
      ]
    },
    {
      "code": "CF_803_C",
      "name": "Maximal GCD",
      "url": "https://codeforces.com/contest/803/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_803_E",
      "name": "Roma and Poker",
      "url": "https://codeforces.com/contest/803/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "constructive"
      ]
    },
    {
      "code": "CF_803_F",
      "name": "Coprime Subsequences",
      "url": "https://codeforces.com/contest/803/problem/F",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "inclusion-exclusion",
        "mobius"
      ]
    },
    {
      "code": "CF_804_C",
      "name": "Ice cream coloring",
      "url": "https://codeforces.com/contest/804/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "casework"
      ]
    },
    {
      "code": "CF_804_D",
      "name": "Expected diameter of a tree",
      "url": "https://codeforces.com/contest/804/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "small-to-large",
        "probability"
      ]
    },
    {
      "code": "CF_807_C",
      "name": "Success Rate",
      "url": "https://codeforces.com/contest/807/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_808_D",
      "name": "Array Division",
      "url": "https://codeforces.com/contest/808/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "brute_force"
      ]
    },
    {
      "code": "CF_808_G",
      "name": "Anthem of Berland",
      "url": "https://codeforces.com/contest/808/problem/G",
      "judge": "Codeforces",
      "tags": [
        "kmp"
      ]
    },
    {
      "code": "CF_809_C",
      "name": "Find a car",
      "url": "https://codeforces.com/contest/809/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "combination",
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_811_D",
      "name": "Vladik and Favorite Game",
      "url": "https://codeforces.com/contest/811/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive",
        "interactive",
        "implementation"
      ]
    },
    {
      "code": "CF_811_E",
      "name": "Vladik and Entertaining Flags",
      "url": "https://codeforces.com/contest/811/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dsu",
        "dnc"
      ]
    },
    {
      "code": "CF_812_D",
      "name": "Sagheer and Kindergarten",
      "url": "https://codeforces.com/contest/812/problem/D",
      "judge": "Codeforces",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "CF_812_E",
      "name": "Sagheer and Apple Tree",
      "url": "https://codeforces.com/contest/812/problem/E",
      "judge": "Codeforces",
      "tags": [
        "nim"
      ]
    },
    {
      "code": "CF_813_F",
      "name": "Bipartite Checking",
      "url": "https://codeforces.com/problemset/problem/813/F",
      "judge": "Codeforces",
      "tags": [
        "dsu",
        "dsu_rollback",
        "dnc"
      ]
    },
    {
      "code": "CF_814_D",
      "name": "An overnight dance in discotheque",
      "url": "https://codeforces.com/contest/814/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "geometry",
        "dp_on_tree",
        "greedy"
      ]
    },
    {
      "code": "CF_814_E",
      "name": "An unavoidable detour for home",
      "url": "https://codeforces.com/contest/814/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_815_B",
      "name": "Karen and Test",
      "url": "https://codeforces.com/contest/815/problem/B",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "implementation"
      ]
    },
    {
      "code": "CF_815_C",
      "name": "Karen and Supermarket",
      "url": "https://codeforces.com/contest/815/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dp-tree-knapsack"
      ]
    },
    {
      "code": "CF_815_D",
      "name": "Karen and Cards",
      "url": "https://codeforces.com/contest/815/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sweep_line",
        "segtree_walk"
      ]
    },
    {
      "code": "CF_816_E",
      "name": "Karen and Supermarket",
      "url": "https://codeforces.com/contest/816/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "dp-tree-knapsack"
      ]
    },
    {
      "code": "CF_817_F",
      "name": "MEX Queries",
      "url": "https://codeforces.com/contest/817/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "segtree_walk"
      ]
    },
    {
      "code": "CF_818_G",
      "name": "Four Melodies",
      "url": "https://codeforces.com/contest/818/problem/G",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_819_B",
      "name": "Mister B and PR Shifts",
      "url": "https://codeforces.com/contest/819/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_821_D",
      "name": "Okabe and City",
      "url": "https://codeforces.com/contest/821/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra",
        "dp",
        "graph",
        "implementation"
      ]
    },
    {
      "code": "CF_821_E",
      "name": "Okabe and El Psy Kongroo",
      "url": "https://codeforces.com/contest/821/problem/E",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "brute_force",
        "implementation"
      ]
    },
    {
      "code": "CF_825_E",
      "name": "Minimal Labels",
      "url": "https://codeforces.com/contest/825/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "graph"
      ]
    },
    {
      "code": "CF_825_F",
      "name": "String Compression",
      "url": "https://codeforces.com/contest/825/problem/F",
      "judge": "Codeforces",
      "tags": [
        "z_func"
      ]
    },
    {
      "code": "CF_825_G",
      "name": "Tree Queries",
      "url": "https://codeforces.com/contest/825/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_827_A",
      "name": "String Reconstruction",
      "url": "https://codeforces.com/contest/827/problem/A",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive"
      ]
    },
    {
      "code": "CF_827_C",
      "name": "DNA Evolution",
      "url": "https://codeforces.com/contest/827/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_827_D",
      "name": "Best Edge Weight",
      "url": "https://codeforces.com/contest/827/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "mst",
        "lca",
        "fenwick",
        "binary_lifting",
        "dsu"
      ]
    },
    {
      "code": "CF_827_E",
      "name": "Rusty String",
      "url": "https://codeforces.com/contest/827/problem/E",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_82_C",
      "name": "General Mobilization",
      "url": "https://codeforces.com/problemset/problem/82/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "stl"
      ]
    },
    {
      "code": "CF_82_D",
      "name": "Two out of Three",
      "url": "https://codeforces.com/contest/82/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_831_E",
      "name": "Cards Sorting",
      "url": "https://codeforces.com/contest/831/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_832_C",
      "name": "Strange Radiation",
      "url": "https://codeforces.com/contest/832/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_833_A",
      "name": "The Meaningless Game",
      "url": "https://codeforces.com/contest/833/problem/A",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_833_B",
      "name": "The Bakery",
      "url": "https://codeforces.com/contest/833/problem/B",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_833_C",
      "name": "Ever-Hungry Krakozyabra",
      "url": "https://codeforces.com/contest/833/problem/C",
      "judge": "Codeforces",
      "tags": [
        "branch-bound",
        "implementation"
      ]
    },
    {
      "code": "CF_834_C",
      "name": "The Meaningless Game",
      "url": "https://codeforces.com/contest/834/problem/C",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_835_E",
      "name": "The penguin's game",
      "url": "https://codeforces.com/contest/835/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "constructive",
        "bitwise",
        "interactive"
      ]
    },
    {
      "code": "CF_837_F",
      "name": "Prefix Sums",
      "url": "https://codeforces.com/contest/837/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "matrix_mul"
      ]
    },
    {
      "code": "CF_837_G",
      "name": "Functions On The Segments",
      "url": "https://codeforces.com/contest/837/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segtree_persistent"
      ]
    },
    {
      "code": "CF_838_B",
      "name": "Diverging Directions",
      "url": "https://codeforces.com/contest/838/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "tree_euler_tour",
        "segment_tree"
      ]
    },
    {
      "code": "CF_839_D",
      "name": "Winter is here",
      "url": "https://codeforces.com/contest/839/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "combination",
        "math-adhoc",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_839_E",
      "name": "Mother of Dragons",
      "url": "https://codeforces.com/contest/839/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "clique",
        "meet-in-the-middle",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_840_B",
      "name": "Leha and another game about graph",
      "url": "https://codeforces.com/contest/840/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "mst",
        "dp",
        "constructive"
      ]
    },
    {
      "code": "CF_840_C",
      "name": "On the Bench",
      "url": "https://codeforces.com/contest/840/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_840_D",
      "name": "Destiny",
      "url": "https://codeforces.com/contest/840/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "mo-general",
        "probability",
        "random"
      ]
    },
    {
      "code": "CF_840_E",
      "name": "In a Trap",
      "url": "https://codeforces.com/contest/840/problem/E",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "sqrt-buckets",
        "bitwise"
      ]
    },
    {
      "code": "CF_842_D",
      "name": "Vitya and Strange Lesson",
      "url": "https://codeforces.com/contest/842/problem/D",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "bitwise"
      ]
    },
    {
      "code": "CF_843_D",
      "name": "Dynamic Shortest Path",
      "url": "https://codeforces.com/contest/843/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_845_G",
      "name": "Shortest Path Problem?",
      "url": "https://codeforces.com/contest/845/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "bitwise"
      ]
    },
    {
      "code": "CF_846_E",
      "name": "Chemistry in Berland",
      "url": "https://codeforces.com/contest/846/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_847_C",
      "name": "Sum of Nestings",
      "url": "https://codeforces.com/contest/847/problem/C",
      "judge": "Codeforces",
      "tags": [
        "constructive"
      ]
    },
    {
      "code": "CF_847_J",
      "name": "Students Initiation",
      "url": "https://codeforces.com/contest/847/problem/J",
      "judge": "Codeforces",
      "tags": [
        "flow",
        "binary_search"
      ]
    },
    {
      "code": "CF_847_L",
      "name": "Berland SU Computer Network",
      "url": "https://codeforces.com/contest/847/problem/L",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_848_C",
      "name": "Goodbye Souvenir",
      "url": "https://codeforces.com/contest/848/problem/C",
      "judge": "Codeforces",
      "tags": [
        "fenwick_2d",
        "segtree_2d"
      ]
    },
    {
      "code": "CF_850_D",
      "name": "Tournament Construction",
      "url": "https://codeforces.com/contest/850/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_digit",
        "combination"
      ]
    },
    {
      "code": "CF_851_E",
      "name": "Arpa and a game with Mojtaba",
      "url": "https://codeforces.com/contest/851/problem/E",
      "judge": "Codeforces",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "CF_852_B",
      "name": "Neural Network country",
      "url": "https://codeforces.com/contest/852/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "matrix_mul",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_853_C",
      "name": "Boredom",
      "url": "https://codeforces.com/contest/853/problem/C",
      "judge": "Codeforces",
      "tags": [
        "fenwick",
        "offline-query"
      ]
    },
    {
      "code": "CF_855_D",
      "name": "Rowena Ravenclaw's Diadem",
      "url": "https://codeforces.com/contest/855/problem/D",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "rmq"
      ]
    },
    {
      "code": "CF_855_E",
      "name": "Salazar Slytherin's Locket",
      "url": "https://codeforces.com/contest/855/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_digit",
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_856_B",
      "name": "Similar Words",
      "url": "https://codeforces.com/contest/856/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "kmp"
      ]
    },
    {
      "code": "CF_856_C",
      "name": "Eleventh Birthday",
      "url": "https://codeforces.com/contest/856/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "CF_856_D",
      "name": "Masha and Cactus",
      "url": "https://codeforces.com/contest/856/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "lca",
        "fenwick"
      ]
    },
    {
      "code": "CF_858_E",
      "name": "Tests Renumeration",
      "url": "https://codeforces.com/contest/858/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_858_F",
      "name": "Wizard's Tour",
      "url": "https://codeforces.com/contest/858/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_859_F",
      "name": "Ordering T-Shirts",
      "url": "https://codeforces.com/contest/859/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_860_C",
      "name": "Tests Renumeration",
      "url": "https://codeforces.com/contest/860/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_860_D",
      "name": "Wizard's Tour",
      "url": "https://codeforces.com/contest/860/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "strongly_connected"
      ]
    },
    {
      "code": "CF_862_D",
      "name": "Mahmoud and Ehab and the binary string",
      "url": "https://codeforces.com/contest/862/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "dp-dnc",
        "interactive"
      ]
    },
    {
      "code": "CF_862_E",
      "name": "Mahmoud and Ehab and the function",
      "url": "https://codeforces.com/contest/862/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "CF_864_E",
      "name": "Fire",
      "url": "https://codeforces.com/contest/864/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_864_F",
      "name": "Cities Excursions",
      "url": "https://codeforces.com/contest/864/problem/F",
      "judge": "Codeforces",
      "tags": [
        "sweep_line"
      ]
    },
    {
      "code": "CF_865_D",
      "name": "Buy Low Sell High",
      "url": "https://codeforces.com/contest/865/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "greedy-more"
      ]
    },
    {
      "code": "CF_866_D",
      "name": "Buy Low Sell High",
      "url": "https://codeforces.com/contest/866/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy"
      ]
    },
    {
      "code": "CF_868_F",
      "name": "Yet Another Minimization Problem",
      "url": "https://codeforces.com/contest/868/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp-dnc"
      ]
    },
    {
      "code": "CF_869_E",
      "name": "The Untended Antiquity",
      "url": "https://codeforces.com/contest/869/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "fenwick_2d",
        "segtree_2d"
      ]
    },
    {
      "code": "CF_86_D",
      "name": "Powerful array",
      "url": "https://codeforces.com/contest/86/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "mo-general"
      ]
    },
    {
      "code": "CF_871_D",
      "name": "Paths",
      "url": "https://codeforces.com/contest/871/problem/D",
      "judge": "Codeforces",
      "tags": [
        "sieve"
      ]
    },
    {
      "code": "CF_873_F",
      "name": "Forbidden Indices",
      "url": "https://codeforces.com/contest/873/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "suffix_array",
        "dsu"
      ]
    },
    {
      "code": "CF_875_C",
      "name": "National Property",
      "url": "https://codeforces.com/contest/875/problem/C",
      "judge": "Codeforces",
      "tags": [
        "2sat",
        "dp",
        "dp-dag"
      ]
    },
    {
      "code": "CF_875_D",
      "name": "High Cry",
      "url": "https://codeforces.com/contest/875/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sparse_table",
        "bitwise"
      ]
    },
    {
      "code": "CF_875_F",
      "name": "Royal Questions",
      "url": "https://codeforces.com/contest/875/problem/F",
      "judge": "Codeforces",
      "tags": [
        "matching",
        "greedy",
        "dsu"
      ]
    },
    {
      "code": "CF_877_D",
      "name": "Olya and Energy Drinks",
      "url": "https://codeforces.com/contest/877/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "bfs01",
        "casework"
      ]
    },
    {
      "code": "CF_877_F",
      "name": "Ann and Books",
      "url": "https://codeforces.com/contest/877/problem/F",
      "judge": "Codeforces",
      "tags": [
        "mo-general"
      ]
    },
    {
      "code": "CF_87_D",
      "name": "Beautiful Road",
      "url": "https://codeforces.com/contest/87/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "CF_87_E",
      "name": "Mogohu-Rea Idol",
      "url": "https://codeforces.com/contest/87/problem/E",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "CF_883_I",
      "name": "Photo Processing",
      "url": "https://codeforces.com/contest/883/problem/I",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "2_pointers"
      ]
    },
    {
      "code": "CF_883_J",
      "name": "Renovation",
      "url": "https://codeforces.com/contest/883/problem/J",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy-more"
      ]
    },
    {
      "code": "CF_884_E",
      "name": "Binary Matrix",
      "url": "https://codeforces.com/contest/884/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "CF_884_F",
      "name": "Anti-Palindromize",
      "url": "https://codeforces.com/contest/884/problem/F",
      "judge": "Codeforces",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "CF_886_E",
      "name": "Maximum Element",
      "url": "https://codeforces.com/contest/886/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_888_F",
      "name": "Connecting Vertices",
      "url": "https://codeforces.com/contest/888/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_888_G",
      "name": "Xor-MST",
      "url": "https://codeforces.com/contest/888/problem/G",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "boruvka",
        "bitwise",
        "dnc"
      ]
    },
    {
      "code": "CF_889_E",
      "name": "Mod Mod Mod",
      "url": "https://codeforces.com/contest/889/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "dp-slope"
      ]
    },
    {
      "code": "CF_891_C",
      "name": "Envy",
      "url": "https://codeforces.com/contest/891/problem/C",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dsu",
        "dsu_rollback"
      ]
    },
    {
      "code": "CF_892_E",
      "name": "Envy",
      "url": "https://codeforces.com/contest/892/problem/E",
      "judge": "Codeforces",
      "tags": [
        "mst",
        "dsu",
        "offline-query"
      ]
    },
    {
      "code": "CF_893_E",
      "name": "Counting Arrays",
      "url": "https://codeforces.com/contest/893/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_894_B",
      "name": "Ralph And His Magic Field",
      "url": "https://codeforces.com/contest/894/problem/B",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "number_theory",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_894_E",
      "name": "Ralph and Mushrooms",
      "url": "https://codeforces.com/contest/894/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "strongly_connected"
      ]
    },
    {
      "code": "CF_895_C",
      "name": "Square Subsets",
      "url": "https://codeforces.com/contest/895/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "combination"
      ]
    },
    {
      "code": "CF_895_E",
      "name": "Eyes Closed",
      "url": "https://codeforces.com/contest/895/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "probability"
      ]
    },
    {
      "code": "CF_898_D",
      "name": "Alarm Clock",
      "url": "https://codeforces.com/contest/898/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_899_F",
      "name": "Letters Removing",
      "url": "https://codeforces.com/contest/899/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "binary_search",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_8_C",
      "name": "Looking for Order",
      "url": "https://codeforces.com/contest/8/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_bitmask",
        "bitwise",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_900_C",
      "name": "Remove Extra One",
      "url": "https://codeforces.com/contest/900/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_900_D",
      "name": "Unusual Sequences",
      "url": "https://codeforces.com/contest/900/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "number_theory",
        "math-adhoc",
        "mobius"
      ]
    },
    {
      "code": "CF_901_D",
      "name": "Weighting a Tree",
      "url": "https://codeforces.com/contest/901/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_903_D",
      "name": "Almost Difference",
      "url": "https://codeforces.com/contest/903/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_903_F",
      "name": "Clear The Matrix",
      "url": "https://codeforces.com/contest/903/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_906_D",
      "name": "Power Tower",
      "url": "https://codeforces.com/contest/906/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "CF_907_D",
      "name": "Seating of Students",
      "url": "https://codeforces.com/contest/907/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "random"
      ]
    },
    {
      "code": "CF_908_E",
      "name": "New Year and Entity Enumeration",
      "url": "https://codeforces.com/contest/908/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_908_F",
      "name": "New Year and Rainbow Roads",
      "url": "https://codeforces.com/contest/908/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "segtree_persistent",
        "graph"
      ]
    },
    {
      "code": "CF_908_G",
      "name": "New Year and Original Order",
      "url": "https://codeforces.com/contest/908/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "dp_digit"
      ]
    },
    {
      "code": "CF_910_C",
      "name": "Minimum Sum",
      "url": "https://codeforces.com/contest/910/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_911_E",
      "name": "Stack Sorting",
      "url": "https://codeforces.com/contest/911/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_911_F",
      "name": "Tree Destruction",
      "url": "https://codeforces.com/contest/911/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "lca"
      ]
    },
    {
      "code": "CF_911_G",
      "name": "Mass Change Queries",
      "url": "https://codeforces.com/contest/911/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dsu",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_913_D",
      "name": "Too Easy Problems",
      "url": "https://codeforces.com/contest/913/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "binary_search",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_913_E",
      "name": "Logical Expression",
      "url": "https://codeforces.com/contest/913/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "CF_913_F",
      "name": "Strongly Connected Tournament",
      "url": "https://codeforces.com/contest/913/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination",
        "dp-count",
        "math-adhoc",
        "probability"
      ]
    },
    {
      "code": "CF_914_D",
      "name": "Bash and a Tough Math Puzzle",
      "url": "https://codeforces.com/contest/914/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "number_theory",
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_914_E",
      "name": "Palindromes in a Tree",
      "url": "https://codeforces.com/contest/914/problem/E",
      "judge": "Codeforces",
      "tags": [
        "Centroid",
        "bitwise"
      ]
    },
    {
      "code": "CF_914_F",
      "name": "Substrings in a String",
      "url": "https://codeforces.com/contest/914/problem/F",
      "judge": "Codeforces",
      "tags": [
        "bitset",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_914_G",
      "name": "Sum the Fibonacci",
      "url": "https://codeforces.com/contest/914/problem/G",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_915_C",
      "name": "Permute Digits",
      "url": "https://codeforces.com/contest/915/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_915_D",
      "name": "Almost Acyclic Graph",
      "url": "https://codeforces.com/contest/915/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_915_E",
      "name": "Physical Education Lessons",
      "url": "https://codeforces.com/contest/915/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_915_F",
      "name": "Imbalance Value of a Tree",
      "url": "https://codeforces.com/contest/915/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "Centroid",
        "dsu"
      ]
    },
    {
      "code": "CF_915_G",
      "name": "Coprime Arrays",
      "url": "https://codeforces.com/contest/915/problem/G",
      "judge": "Codeforces",
      "tags": [
        "mobius"
      ]
    },
    {
      "code": "CF_916_E",
      "name": "Jamie and Tree",
      "url": "https://codeforces.com/contest/916/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "lca",
        "tree_euler_tour"
      ]
    },
    {
      "code": "CF_917_B",
      "name": "MADMAX",
      "url": "https://codeforces.com/contest/917/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "greedy",
        "nim",
        "implementation"
      ]
    },
    {
      "code": "CF_919_D",
      "name": "Substring",
      "url": "https://codeforces.com/contest/919/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_91_E",
      "name": "Igloo Skyscraper",
      "url": "https://codeforces.com/contest/91/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "convexhull"
      ]
    },
    {
      "code": "CF_920_D",
      "name": "Tanks",
      "url": "https://codeforces.com/contest/920/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "constructive"
      ]
    },
    {
      "code": "CF_920_E",
      "name": "Connected Components?",
      "url": "https://codeforces.com/contest/920/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "stl",
        "dsu"
      ]
    },
    {
      "code": "CF_920_F",
      "name": "SUM and REPLACE",
      "url": "https://codeforces.com/contest/920/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "fenwick",
        "dsu",
        "sieve"
      ]
    },
    {
      "code": "CF_920_G",
      "name": "List Of Integers",
      "url": "https://codeforces.com/contest/920/problem/G",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "inclusion-exclusion",
        "sieve"
      ]
    },
    {
      "code": "CF_922_D",
      "name": "Robot Vacuum Cleaner",
      "url": "https://codeforces.com/contest/922/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy-exchange"
      ]
    },
    {
      "code": "CF_922_E",
      "name": "Birds",
      "url": "https://codeforces.com/contest/922/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_922_F",
      "name": "Divisibility",
      "url": "https://codeforces.com/contest/922/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "constructive"
      ]
    },
    {
      "code": "CF_923_C",
      "name": "Perfect Security",
      "url": "https://codeforces.com/contest/923/problem/C",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "greedy",
        "bitwise",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_923_E",
      "name": "Perpetual Subtraction",
      "url": "https://codeforces.com/problemset/problem/923/E",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "fft"
      ]
    },
    {
      "code": "CF_924_C",
      "name": "Riverside Curio",
      "url": "https://codeforces.com/contest/924/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_924_D",
      "name": "Contact ATC",
      "url": "https://codeforces.com/contest/924/problem/D",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_925_D",
      "name": "Aztec Catacombs",
      "url": "https://codeforces.com/contest/925/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "constructive"
      ]
    },
    {
      "code": "CF_930_C",
      "name": "Teodor is not a liar!",
      "url": "https://codeforces.com/contest/930/problem/C",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "CF_930_D",
      "name": "Game with Tokens",
      "url": "https://codeforces.com/contest/930/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "sweep_line"
      ]
    },
    {
      "code": "CF_930_E",
      "name": "Coins Exhibition",
      "url": "https://codeforces.com/contest/930/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "dp",
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_931_C",
      "name": "Laboratory Work",
      "url": "https://codeforces.com/contest/931/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_931_D",
      "name": "Peculiar apple-tree",
      "url": "https://codeforces.com/contest/931/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "ad_hoc",
        "greedy",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_931_E",
      "name": "Game with String",
      "url": "https://codeforces.com/contest/931/problem/E",
      "judge": "Codeforces",
      "tags": [
        "probability"
      ]
    },
    {
      "code": "CF_931_F",
      "name": "Teodor is not a liar!",
      "url": "https://codeforces.com/contest/931/problem/F",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_932_D",
      "name": "Tree",
      "url": "https://codeforces.com/contest/932/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "binary_lifting"
      ]
    },
    {
      "code": "CF_932_E",
      "name": "Team Work",
      "url": "https://codeforces.com/contest/932/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp-count",
        "lagrange-inter"
      ]
    },
    {
      "code": "CF_932_F",
      "name": "Escape Through Leaf",
      "url": "https://codeforces.com/contest/932/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp-convexhull",
        "dp_on_tree",
        "convexhull",
        "lichao-tree",
        "small-to-large"
      ]
    },
    {
      "code": "CF_932_G",
      "name": "Palindrome Partition",
      "url": "https://codeforces.com/contest/932/problem/G",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "palin-tree"
      ]
    },
    {
      "code": "CF_935_E",
      "name": "Fafa and Ancient Mathematics",
      "url": "https://codeforces.com/contest/935/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "CF_935_F",
      "name": "Fafa and Array",
      "url": "https://codeforces.com/contest/935/problem/F",
      "judge": "Codeforces",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "CF_936_B",
      "name": "Sleepy Game",
      "url": "https://codeforces.com/contest/936/problem/B",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp",
        "cycle",
        "constructive"
      ]
    },
    {
      "code": "CF_936_C",
      "name": "Lock Puzzle",
      "url": "https://codeforces.com/contest/936/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive"
      ]
    },
    {
      "code": "CF_937_E",
      "name": "Lock Puzzle",
      "url": "https://codeforces.com/contest/937/problem/E",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "CF_938_C",
      "name": "Constructing Tests",
      "url": "https://codeforces.com/contest/938/problem/C",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_938_E",
      "name": "Max History",
      "url": "https://codeforces.com/contest/938/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_938_F",
      "name": "Erasing Substrings",
      "url": "https://codeforces.com/contest/938/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "greedy"
      ]
    },
    {
      "code": "CF_939_D",
      "name": "Love Rescue",
      "url": "https://codeforces.com/contest/939/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "dsu",
        "implementation"
      ]
    },
    {
      "code": "CF_93_B",
      "name": "End of Exams",
      "url": "https://codeforces.com/contest/93/problem/B",
      "judge": "Codeforces",
      "tags": [
        "math-adhoc"
      ]
    },
    {
      "code": "CF_940_D",
      "name": "Alena And The Heater",
      "url": "https://codeforces.com/contest/940/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "kmp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_940_F",
      "name": "Machine Learning",
      "url": "https://codeforces.com/contest/940/problem/F",
      "judge": "Codeforces",
      "tags": [
        "mo-general",
        "mo-update"
      ]
    },
    {
      "code": "CF_946_D",
      "name": "Timetable",
      "url": "https://codeforces.com/contest/946/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_946_F",
      "name": "Fibonacci String Subsequences",
      "url": "https://codeforces.com/contest/946/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "CF_946_G",
      "name": "Almost Increasing Array",
      "url": "https://codeforces.com/contest/946/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "CF_947_C",
      "name": "Perfect Security",
      "url": "https://codeforces.com/contest/947/problem/C",
      "judge": "Codeforces",
      "tags": [
        "trie"
      ]
    },
    {
      "code": "CF_947_D",
      "name": "Picking Strings",
      "url": "https://codeforces.com/contest/947/problem/D",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "casework"
      ]
    },
    {
      "code": "CF_948_B",
      "name": "Primal Sport",
      "url": "https://codeforces.com/contest/948/problem/B",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "sieve",
        "casework"
      ]
    },
    {
      "code": "CF_949_B",
      "name": "A Leapfrog in the Array",
      "url": "https://codeforces.com/contest/949/problem/B",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_949_C",
      "name": "Data Center Maintenance",
      "url": "https://codeforces.com/contest/949/problem/C",
      "judge": "Codeforces",
      "tags": [
        "strongly_connected",
        "dsu"
      ]
    },
    {
      "code": "CF_949_D",
      "name": "Curfew",
      "url": "https://codeforces.com/contest/949/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_949_E",
      "name": "Binary Cards",
      "url": "https://codeforces.com/contest/949/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "backtrack",
        "bitwise"
      ]
    },
    {
      "code": "CF_952_B",
      "name": "A Map of the Cat",
      "url": "https://codeforces.com/contest/952/problem/B",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "brute_force",
        "interactive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_952_D",
      "name": "I'm Feeling Lucky!",
      "url": "https://codeforces.com/contest/952/problem/D",
      "judge": "Codeforces",
      "tags": [
        "probability",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_952_E",
      "name": "Cheese Board",
      "url": "https://codeforces.com/contest/952/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "number_theory",
        "math-adhoc",
        "casework"
      ]
    },
    {
      "code": "CF_952_G",
      "name": "Puzzling Language",
      "url": "https://codeforces.com/contest/952/problem/G",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_953_H",
      "name": "Endless Roses Most Beautiful",
      "url": "https://codeforces.com/contest/953/problem/H",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_954_C",
      "name": "Matrix Walk",
      "url": "https://codeforces.com/contest/954/problem/C",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "constructive",
        "math-adhoc",
        "casework",
        "hard-implementation",
        "implementation"
      ]
    },
    {
      "code": "CF_954_D",
      "name": "Fight Against Traffic",
      "url": "https://codeforces.com/contest/954/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dijkstra",
        "graph",
        "floyd",
        "implementation"
      ]
    },
    {
      "code": "CF_954_F",
      "name": "Runner's Problem",
      "url": "https://codeforces.com/contest/954/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "matrix_mul",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_954_G",
      "name": "Castle Defense",
      "url": "https://codeforces.com/contest/954/problem/G",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_954_H",
      "name": "Path Counting",
      "url": "https://codeforces.com/contest/954/problem/H",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "dp-count"
      ]
    },
    {
      "code": "CF_955_C",
      "name": "Sad powers",
      "url": "https://codeforces.com/contest/955/problem/C",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "number_theory",
        "static-data"
      ]
    },
    {
      "code": "CF_955_F",
      "name": "Heaps",
      "url": "https://codeforces.com/contest/955/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp-swap-label"
      ]
    },
    {
      "code": "CF_958_A2",
      "name": "Death Stars (medium)",
      "url": "https://codeforces.com/contest/958/problem/A2",
      "judge": "Codeforces",
      "tags": [
        "hash",
        "implementation"
      ]
    },
    {
      "code": "CF_958_B2",
      "name": "Maximum Control (medium)",
      "url": "https://codeforces.com/contest/958/problem/B2",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "stl",
        "segment_tree",
        "greedy",
        "greedy-exchange",
        "implementation"
      ]
    },
    {
      "code": "CF_958_C3",
      "name": "Encryption (hard)",
      "url": "https://codeforces.com/contest/958/problem/C3",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "CF_958_E2",
      "name": "Guard Duty (medium)",
      "url": "https://codeforces.com/contest/958/problem/E2",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_958_E3",
      "name": "Guard Duty (hard)",
      "url": "https://codeforces.com/contest/958/problem/E3",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "dnc"
      ]
    },
    {
      "code": "CF_958_F3",
      "name": "Lightsabers (hard)",
      "url": "https://codeforces.com/contest/958/problem/F3",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_959_E",
      "name": "Mahmoud and Ehab and the xor-MST",
      "url": "https://codeforces.com/contest/959/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_bitmask",
        "bitwise",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_959_F",
      "name": "Mahmoud and Ehab and yet another xor task",
      "url": "https://codeforces.com/contest/959/problem/F",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "bitwise",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_960_C",
      "name": "Subsequence Counting",
      "url": "https://codeforces.com/contest/960/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "ad_hoc",
        "constructive",
        "bitwise",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_960_D",
      "name": "Full Binary Tree Queries",
      "url": "https://codeforces.com/contest/960/problem/D",
      "judge": "Codeforces",
      "tags": [
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_960_E",
      "name": "Alternating Tree",
      "url": "https://codeforces.com/contest/960/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "Centroid"
      ]
    },
    {
      "code": "CF_960_F",
      "name": "Pathwalks",
      "url": "https://codeforces.com/contest/960/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "binary_search",
        "fenwick",
        "graph",
        "implementation"
      ]
    },
    {
      "code": "CF_961_D",
      "name": "Pair Of Lines",
      "url": "https://codeforces.com/contest/961/problem/D",
      "judge": "Codeforces",
      "tags": [
        "geometry",
        "greedy",
        "casework"
      ]
    },
    {
      "code": "CF_961_E",
      "name": "Tufurama",
      "url": "https://codeforces.com/contest/961/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "CF_961_F",
      "name": "k-substrings",
      "url": "https://codeforces.com/contest/961/problem/F",
      "judge": "Codeforces",
      "tags": [
        "manacher"
      ]
    },
    {
      "code": "CF_962_D",
      "name": "Merge Equals",
      "url": "https://codeforces.com/contest/962/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "brute_force",
        "implementation"
      ]
    },
    {
      "code": "CF_962_E",
      "name": "Byteland, Berland and Disputed Cities",
      "url": "https://codeforces.com/contest/962/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "graph"
      ]
    },
    {
      "code": "CF_962_F",
      "name": "Simple Cycles Edges",
      "url": "https://codeforces.com/contest/962/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "cycle",
        "tree_euler_tour",
        "dsu"
      ]
    },
    {
      "code": "CF_963_A",
      "name": "Alternating Sum",
      "url": "https://codeforces.com/contest/963/problem/A",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_963_B",
      "name": "Destruction of a Tree",
      "url": "https://codeforces.com/contest/963/problem/B",
      "judge": "Codeforces",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "CF_963_D",
      "name": "Frequency of String",
      "url": "https://codeforces.com/contest/963/problem/D",
      "judge": "Codeforces",
      "tags": [
        "aho"
      ]
    },
    {
      "code": "CF_963_E",
      "name": "Circles of Waiting",
      "url": "https://codeforces.com/contest/963/problem/E",
      "judge": "Codeforces",
      "tags": [
        "gauss",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_965_C",
      "name": "Greedy Arkady",
      "url": "https://codeforces.com/contest/965/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_965_D",
      "name": "Single-use Stones",
      "url": "https://codeforces.com/contest/965/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "CF_966_C",
      "name": "Big Secret",
      "url": "https://codeforces.com/contest/966/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy"
      ]
    },
    {
      "code": "CF_966_E",
      "name": "May Holidays",
      "url": "https://codeforces.com/contest/966/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_967_E",
      "name": "Big Secret",
      "url": "https://codeforces.com/contest/967/problem/E",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "bitwise"
      ]
    },
    {
      "code": "CF_975_D",
      "name": "Ghosts",
      "url": "https://codeforces.com/contest/975/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "geometry",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_976_E",
      "name": "Well played!",
      "url": "https://codeforces.com/contest/976/problem/E",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_976_F",
      "name": "Minimal k-covering",
      "url": "https://codeforces.com/contest/976/problem/F",
      "judge": "Codeforces",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "CF_977_F",
      "name": "Consecutive Subsequence",
      "url": "https://codeforces.com/contest/977/problem/F",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "segment_tree",
        "dp",
        "binary_search",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_978_G",
      "name": "Petya's Exams",
      "url": "https://codeforces.com/contest/978/problem/G",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_979_B",
      "name": "Treasure Hunt",
      "url": "https://codeforces.com/contest/979/problem/B",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_979_D",
      "name": "Kuro and GCD and XOR and SUM",
      "url": "https://codeforces.com/contest/979/problem/D",
      "judge": "Codeforces",
      "tags": [
        "trie",
        "dsu"
      ]
    },
    {
      "code": "CF_980_C",
      "name": "Posterized",
      "url": "https://codeforces.com/contest/980/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_980_D",
      "name": "Perfect Groups",
      "url": "https://codeforces.com/contest/980/problem/D",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_980_E",
      "name": "The Number Games",
      "url": "https://codeforces.com/contest/980/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "greedy"
      ]
    },
    {
      "code": "CF_981_D",
      "name": "Bookshelves",
      "url": "https://codeforces.com/contest/981/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "bitwise",
        "implementation"
      ]
    },
    {
      "code": "CF_981_E",
      "name": "Addition on Segments",
      "url": "https://codeforces.com/contest/981/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "CF_981_F",
      "name": "Round Marriage",
      "url": "https://codeforces.com/contest/981/problem/F",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "greedy"
      ]
    },
    {
      "code": "CF_981_G",
      "name": "Magic multisets",
      "url": "https://codeforces.com/contest/981/problem/G",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "hard-implementation"
      ]
    },
    {
      "code": "CF_982_D",
      "name": "Shark",
      "url": "https://codeforces.com/contest/982/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dsu",
        "small-to-large",
        "constructive",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_982_E",
      "name": "Billiard",
      "url": "https://codeforces.com/contest/982/problem/E",
      "judge": "Codeforces",
      "tags": [
        "extgcd"
      ]
    },
    {
      "code": "CF_983_E",
      "name": "NN country",
      "url": "https://codeforces.com/contest/983/problem/E",
      "judge": "Codeforces",
      "tags": [
        "lca",
        "binary_lifting"
      ]
    },
    {
      "code": "CF_984_C",
      "name": "Finite or not?",
      "url": "https://codeforces.com/contest/984/problem/C",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_984_D",
      "name": "XOR-pyramid",
      "url": "https://codeforces.com/contest/984/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "bitwise",
        "math-adhoc",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_985_E",
      "name": "Pencils and Boxes",
      "url": "https://codeforces.com/contest/985/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy",
        "2_pointers"
      ]
    },
    {
      "code": "CF_985_F",
      "name": "Isomorphic Strings",
      "url": "https://codeforces.com/contest/985/problem/F",
      "judge": "Codeforces",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "CF_986_C",
      "name": "AND Graph",
      "url": "https://codeforces.com/contest/986/problem/C",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs",
        "dp-sos",
        "dsu"
      ]
    },
    {
      "code": "CF_986_E",
      "name": "Prince's Problem",
      "url": "https://codeforces.com/contest/986/problem/E",
      "judge": "Codeforces",
      "tags": [
        "hld",
        "lca",
        "fenwick",
        "sieve",
        "offline-query"
      ]
    },
    {
      "code": "CF_986_F",
      "name": "Oppa Funcan Style Remastered",
      "url": "https://codeforces.com/contest/986/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dijkstra",
        "math-adhoc",
        "extgcd"
      ]
    },
    {
      "code": "CF_987_D",
      "name": "Fair",
      "url": "https://codeforces.com/contest/987/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "dp",
        "graph",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_987_E",
      "name": "Petr and Permutations",
      "url": "https://codeforces.com/contest/987/problem/E",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_987_F",
      "name": "AND Graph",
      "url": "https://codeforces.com/contest/987/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "CF_988_D",
      "name": "Points and Powers of Two",
      "url": "https://codeforces.com/contest/988/problem/D",
      "judge": "Codeforces",
      "tags": [
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_988_E",
      "name": "Divisibility by 25",
      "url": "https://codeforces.com/contest/988/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_988_F",
      "name": "Rain and Umbrellas",
      "url": "https://codeforces.com/contest/988/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_989_D",
      "name": "A Shade of Moonlight",
      "url": "https://codeforces.com/contest/989/problem/D",
      "judge": "Codeforces",
      "tags": [
        "binary_search",
        "2_pointers",
        "math-adhoc"
      ]
    },
    {
      "code": "CF_989_E",
      "name": "A Trance of Nightfall",
      "url": "https://codeforces.com/contest/989/problem/E",
      "judge": "Codeforces",
      "tags": [
        "matrix_mul",
        "geometry"
      ]
    },
    {
      "code": "CF_990_D",
      "name": "Graph And Its Complement",
      "url": "https://codeforces.com/contest/990/problem/D",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "greedy",
        "graph",
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_990_E",
      "name": "Post Lamps",
      "url": "https://codeforces.com/contest/990/problem/E",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy"
      ]
    },
    {
      "code": "CF_990_G",
      "name": "GCD Counting",
      "url": "https://codeforces.com/contest/990/problem/G",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "Centroid",
        "dsu",
        "inclusion-exclusion",
        "mobius"
      ]
    },
    {
      "code": "CF_991_D",
      "name": "Bishwock",
      "url": "https://codeforces.com/contest/991/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_991_E",
      "name": "Bus Number",
      "url": "https://codeforces.com/contest/991/problem/E",
      "judge": "Codeforces",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "CF_992_D",
      "name": "Nastya and a Game",
      "url": "https://codeforces.com/contest/992/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search",
        "greedy",
        "implementation"
      ]
    },
    {
      "code": "CF_992_E",
      "name": "Nastya and King-Shamans",
      "url": "https://codeforces.com/contest/992/problem/E",
      "judge": "Codeforces",
      "tags": [
        "segment_tree",
        "binary_search",
        "fenwick",
        "sqrt-buckets"
      ]
    },
    {
      "code": "CF_993_B",
      "name": "Open Communication",
      "url": "https://codeforces.com/contest/993/problem/B",
      "judge": "Codeforces",
      "tags": [
        "casework"
      ]
    },
    {
      "code": "CF_993_D",
      "name": "Compute Power",
      "url": "https://codeforces.com/contest/993/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "binary_search"
      ]
    },
    {
      "code": "CF_993_E",
      "name": "Nikita and Order Statistics",
      "url": "https://codeforces.com/contest/993/problem/E",
      "judge": "Codeforces",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "CF_995_A",
      "name": "Tesla",
      "url": "https://codeforces.com/contest/995/problem/A",
      "judge": "Codeforces",
      "tags": [
        "constructive",
        "implementation"
      ]
    },
    {
      "code": "CF_995_D",
      "name": "Game",
      "url": "https://codeforces.com/contest/995/problem/D",
      "judge": "Codeforces",
      "tags": [
        "probability"
      ]
    },
    {
      "code": "CF_995_E",
      "name": "Number Clicker",
      "url": "https://codeforces.com/contest/995/problem/E",
      "judge": "Codeforces",
      "tags": [
        "number_theory",
        "random"
      ]
    },
    {
      "code": "CF_995_F",
      "name": "Cowmpany Cowmpensation",
      "url": "https://codeforces.com/contest/995/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp_on_tree",
        "combination",
        "lagrange-inter"
      ]
    },
    {
      "code": "CF_996_C",
      "name": "Tesla",
      "url": "https://codeforces.com/contest/996/problem/C",
      "judge": "Codeforces",
      "tags": [
        "ad_hoc",
        "constructive"
      ]
    },
    {
      "code": "CF_996_D",
      "name": "Suit and Tie",
      "url": "https://codeforces.com/contest/996/problem/D",
      "judge": "Codeforces",
      "tags": [
        "brute_force",
        "greedy",
        "math-adhoc",
        "implementation"
      ]
    },
    {
      "code": "CF_996_E",
      "name": "Leaving the Bar",
      "url": "https://codeforces.com/contest/996/problem/E",
      "judge": "Codeforces",
      "tags": [
        "random"
      ]
    },
    {
      "code": "CF_997_C",
      "name": "Sky Full of Stars",
      "url": "https://codeforces.com/contest/997/problem/C",
      "judge": "Codeforces",
      "tags": [
        "combination",
        "math-adhoc",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "CF_999_D",
      "name": "Equalize the Remainders",
      "url": "https://codeforces.com/contest/999/problem/D",
      "judge": "Codeforces",
      "tags": [
        "stl",
        "greedy",
        "casework",
        "implementation"
      ]
    },
    {
      "code": "CF_999_E",
      "name": "Reachability from the Capital",
      "url": "https://codeforces.com/contest/999/problem/E",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "greedy",
        "graph",
        "implementation"
      ]
    },
    {
      "code": "CF_999_F",
      "name": "Cards and Joy",
      "url": "https://codeforces.com/contest/999/problem/F",
      "judge": "Codeforces",
      "tags": [
        "dp",
        "ad_hoc",
        "implementation"
      ]
    },
    {
      "code": "CF_9_D",
      "name": "How many trees?",
      "url": "https://codeforces.com/contest/9/problem/D",
      "judge": "Codeforces",
      "tags": [
        "dp-dnc"
      ]
    },
    {
      "code": "VNOJ_ads",
      "name": "Quảng cáo",
      "url": "https://oj.vnoi.info/problem/ads",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_airctrl",
      "name": "Kiểm soát không lưu",
      "url": "https://oj.vnoi.info/problem/airctrl",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_aladdin",
      "name": "Aladdin",
      "url": "https://oj.vnoi.info/problem/aladdin",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc",
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_alake",
      "name": "Hồ nhân tạo",
      "url": "https://oj.vnoi.info/problem/alake",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_alert",
      "name": "Báo động đỏ",
      "url": "https://oj.vnoi.info/problem/alert",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_area",
      "name": "Diện tích hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/area",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_areatri",
      "name": "Tam giác",
      "url": "https://oj.vnoi.info/problem/areatri",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_assign1",
      "name": "Phân công hoàn thành sớm nhất",
      "url": "https://oj.vnoi.info/problem/assign1",
      "judge": "VNOJ",
      "tags": [
        "flow",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_assign4",
      "name": "Lại một bài phân việc",
      "url": "https://oj.vnoi.info/problem/assign4",
      "judge": "VNOJ",
      "tags": [
        "flow",
        "matching"
      ]
    },
    {
      "code": "VNOJ_atcoder_dp_c",
      "name": "Atcoder Educational DP Contest C - Vacation",
      "url": "https://oj.vnoi.info/problem/atcoder_dp_c",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_atcoder_dp_d",
      "name": "Atcoder Educational DP Contest D - Knapsack 1",
      "url": "https://oj.vnoi.info/problem/atcoder_dp_d",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_atcoder_dp_e",
      "name": "Atcoder Educational DP Contest E - Knapsack 2",
      "url": "https://oj.vnoi.info/problem/atcoder_dp_e",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_atcoder_dp_z",
      "name": "Atcoder Educational DP Contest Z - Frog 3",
      "url": "https://oj.vnoi.info/problem/atcoder_dp_z",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "dp-convexhull"
      ]
    },
    {
      "code": "VNOJ_baabo",
      "name": "The Bovine Accordion and Banjo Orchestra",
      "url": "https://oj.vnoi.info/problem/baabo",
      "judge": "VNOJ",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "VNOJ_baove",
      "name": "Bảo vệ",
      "url": "https://oj.vnoi.info/problem/baove",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_baric",
      "name": "Bò Ba-ri",
      "url": "https://oj.vnoi.info/problem/baric",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_baricavn",
      "name": "BARICA",
      "url": "https://oj.vnoi.info/problem/baricavn",
      "judge": "VNOJ",
      "tags": [
        "compress"
      ]
    },
    {
      "code": "VNOJ_bedao_g01_kprime",
      "name": "Bedao Grand Contest 01 - KPRIME",
      "url": "https://oj.vnoi.info/problem/bedao_g01_kprime",
      "judge": "VNOJ",
      "tags": [
        "sieve",
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_bedao_g02_muldiv",
      "name": "Bedao Grand Contest 02 - MULDIV",
      "url": "https://oj.vnoi.info/problem/bedao_g02_muldiv",
      "judge": "VNOJ",
      "tags": [
        "sieve"
      ]
    },
    {
      "code": "VNOJ_bedao_g03_bonpair",
      "name": "Bedao Grand Contest 03 - BONPAIR",
      "url": "https://oj.vnoi.info/problem/bedao_g03_bonpair",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_bedao_g03_three",
      "name": "Bedao Grand Contest 03 - THREE",
      "url": "https://oj.vnoi.info/problem/bedao_g03_three",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_bedao_g04_sudi",
      "name": "Bedao Grand Contest 04 - SUDI",
      "url": "https://oj.vnoi.info/problem/bedao_g04_sudi",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_bedao_g04_zeze",
      "name": "Bedao Grand Contest 04 - ZEZE",
      "url": "https://oj.vnoi.info/problem/bedao_g04_zeze",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_bedao_g06_lds",
      "name": "Bedao Grand Contest 06 - LDS",
      "url": "https://oj.vnoi.info/problem/bedao_g06_lds",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_bedao_g07_resort",
      "name": "Bedao Grand Contest 07 - RESORT",
      "url": "https://oj.vnoi.info/problem/bedao_g07_resort",
      "judge": "VNOJ",
      "tags": [
        "sieve",
        "greedy"
      ]
    },
    {
      "code": "VNOJ_bedao_g08_equal",
      "name": "Bedao Grand Contest 08 - EQUAL",
      "url": "https://oj.vnoi.info/problem/bedao_g08_equal",
      "judge": "VNOJ",
      "tags": [
        "number_theory",
        "dp",
        "sieve"
      ]
    },
    {
      "code": "VNOJ_bedao_m06_internet",
      "name": "Bedao Mini Contest 06 - INTERNET",
      "url": "https://oj.vnoi.info/problem/bedao_m06_internet",
      "judge": "VNOJ",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "VNOJ_bedao_m06_yugioh",
      "name": "Bedao Mini Contest 06 - YUGIOH",
      "url": "https://oj.vnoi.info/problem/bedao_m06_yugioh",
      "judge": "VNOJ",
      "tags": [
        "sieve"
      ]
    },
    {
      "code": "VNOJ_bedao_oi4_d",
      "name": "Bedao OI Contest 4 - Thi tuyển dụng",
      "url": "https://oj.vnoi.info/problem/bedao_oi4_d",
      "judge": "VNOJ",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "VNOJ_bedao_r02_tourist",
      "name": "Bedao Regular Contest 02 - TOURIST",
      "url": "https://oj.vnoi.info/problem/bedao_r02_tourist",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dp"
      ]
    },
    {
      "code": "VNOJ_bedao_t1_iwant",
      "name": "Bedao Testing Contest 01 - I WANT",
      "url": "https://oj.vnoi.info/problem/bedao_t1_iwant",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_bestspot",
      "name": "Vị trí tốt nhất",
      "url": "https://oj.vnoi.info/problem/bestspot",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_bignum",
      "name": "Xử lý số nguyên lớn",
      "url": "https://oj.vnoi.info/problem/bignum",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_binary",
      "name": "Số nhị phân có nghĩa",
      "url": "https://oj.vnoi.info/problem/binary",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_binary2",
      "name": "SPBINARY2",
      "url": "https://oj.vnoi.info/problem/binary2",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_binladen",
      "name": "VM 08 Bài 13 - Bin Laden",
      "url": "https://oj.vnoi.info/problem/binladen",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_bird",
      "name": "Bird or not bird",
      "url": "https://oj.vnoi.info/problem/bird",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_bland",
      "name": "VM 09 Bài 08 - Giá trị chiếc quạt mo",
      "url": "https://oj.vnoi.info/problem/bland",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_bnwnim",
      "name": "Black and White Nim",
      "url": "https://oj.vnoi.info/problem/bnwnim",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_bones",
      "name": "Xúc xắc bò",
      "url": "https://oj.vnoi.info/problem/bones",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_bongda",
      "name": "Lịch thi đấu bóng đá",
      "url": "https://oj.vnoi.info/problem/bongda",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_boss",
      "name": "Ai là sếp",
      "url": "https://oj.vnoi.info/problem/boss",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_boxes",
      "name": "Boxes",
      "url": "https://oj.vnoi.info/problem/boxes",
      "judge": "VNOJ",
      "tags": [
        "weighted_matching"
      ]
    },
    {
      "code": "VNOJ_bracket",
      "name": "Dãy ngoặc",
      "url": "https://oj.vnoi.info/problem/bracket",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_bubba1",
      "name": "VM 12 Bài 04 - Truyền thuyết Bubba",
      "url": "https://oj.vnoi.info/problem/bubba1",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_bubba2",
      "name": "VM 12 Bài 07 - Truyền thuyết Bubba 2",
      "url": "https://oj.vnoi.info/problem/bubba2",
      "judge": "VNOJ",
      "tags": [
        "aho"
      ]
    },
    {
      "code": "VNOJ_build28",
      "name": "Xây đường",
      "url": "https://oj.vnoi.info/problem/build28",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_bwgame",
      "name": "Trò chơi đen trắng",
      "url": "https://oj.vnoi.info/problem/bwgame",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_c11bc1",
      "name": "The country of heaven",
      "url": "https://oj.vnoi.info/problem/c11bc1",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_c11cave",
      "name": "Hang động",
      "url": "https://oj.vnoi.info/problem/c11cave",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_c11comp",
      "name": "Quản lí công ty 2",
      "url": "https://oj.vnoi.info/problem/c11comp",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_c11dk2",
      "name": "C11DK2",
      "url": "https://oj.vnoi.info/problem/c11dk2",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_c11fbr",
      "name": "Free Bracket",
      "url": "https://oj.vnoi.info/problem/c11fbr",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_c11pairs",
      "name": "Đếm cặp",
      "url": "https://oj.vnoi.info/problem/c11pairs",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_c11pnum",
      "name": "Số nguyên tố!",
      "url": "https://oj.vnoi.info/problem/c11pnum",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_c11seq",
      "name": "Dãy số",
      "url": "https://oj.vnoi.info/problem/c11seq",
      "judge": "VNOJ",
      "tags": [
        "binary_search",
        "compress"
      ]
    },
    {
      "code": "VNOJ_c11seven",
      "name": "Dãy số và số 7",
      "url": "https://oj.vnoi.info/problem/c11seven",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_c11str2",
      "name": "Tiền tố và hậu tố",
      "url": "https://oj.vnoi.info/problem/c11str2",
      "judge": "VNOJ",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "VNOJ_c11trcnt",
      "name": "Bắn máy bay",
      "url": "https://oj.vnoi.info/problem/c11trcnt",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_c11water",
      "name": "Đọng nước",
      "url": "https://oj.vnoi.info/problem/c11water",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_car",
      "name": "Lập lịch sửa chữa ô tô",
      "url": "https://oj.vnoi.info/problem/car",
      "judge": "VNOJ",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "VNOJ_carpet",
      "name": "Trải thảm đỏ",
      "url": "https://oj.vnoi.info/problem/carpet",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_castle",
      "name": "Xây dựng lâu đài",
      "url": "https://oj.vnoi.info/problem/castle",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_catalan",
      "name": "Dãy số Catalan",
      "url": "https://oj.vnoi.info/problem/catalan",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_catgo",
      "name": "Cắt gỗ",
      "url": "https://oj.vnoi.info/problem/catgo",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_cdmusic",
      "name": "Help Conan 5 !",
      "url": "https://oj.vnoi.info/problem/cdmusic",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_centre28",
      "name": "CENTRE",
      "url": "https://oj.vnoi.info/problem/centre28",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_cf_edu1c",
      "name": "Codeforces Educational 1C - Nearest Vectors",
      "url": "https://oj.vnoi.info/problem/cf_edu1c",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_cflag2",
      "name": "Người yêu của pirate",
      "url": "https://oj.vnoi.info/problem/cflag2",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_chain2",
      "name": "Chuỗi từ",
      "url": "https://oj.vnoi.info/problem/chain2",
      "judge": "VNOJ",
      "tags": [
        "trie"
      ]
    },
    {
      "code": "VNOJ_cheat",
      "name": "Chơi bi-a 1 lỗ",
      "url": "https://oj.vnoi.info/problem/cheat",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_cheer",
      "name": "Động viên đàn bò",
      "url": "https://oj.vnoi.info/problem/cheer",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_chess_",
      "name": "Cờ vua",
      "url": "https://oj.vnoi.info/problem/chess_",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_chntower",
      "name": "Tháp Hà Nội",
      "url": "https://oj.vnoi.info/problem/chntower",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_chuoihat",
      "name": "Chuỗi hạt",
      "url": "https://oj.vnoi.info/problem/chuoihat",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_clock",
      "name": "Chỉnh đồng hồ",
      "url": "https://oj.vnoi.info/problem/clock",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_coci1617_r5_poklon",
      "name": "COCI 2016/2017 - Contest 5 - Poklon",
      "url": "https://oj.vnoi.info/problem/coci1617_r5_poklon",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "mo-general",
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_coci1617_r6_sirni",
      "name": "COCI 2016/2017 - Contest 6 - Sirni",
      "url": "https://oj.vnoi.info/problem/coci1617_r6_sirni",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_coci1920_r4_nivelle",
      "name": "COCI 2019/2020 - Contest 4 - Nivelle",
      "url": "https://oj.vnoi.info/problem/coci1920_r4_nivelle",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_coci1920_r5_zapina",
      "name": "COCI 2019/2020 - Contest 5 - Zapina",
      "url": "https://oj.vnoi.info/problem/coci1920_r5_zapina",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_coci2021_r2_odasiljaci",
      "name": "COCI 2020/2021 - Contest 2 - Odasiljaci",
      "url": "https://oj.vnoi.info/problem/coci2021_r2_odasiljaci",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_coci2021_r6_index",
      "name": "COCI 2020/2021 - Contest 6 - Index",
      "url": "https://oj.vnoi.info/problem/coci2021_r6_index",
      "judge": "VNOJ",
      "tags": [
        "bin-search-parallel"
      ]
    },
    {
      "code": "VNOJ_coin34",
      "name": "34 đồng xu",
      "url": "https://oj.vnoi.info/problem/coin34",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_company3",
      "name": "Công ty",
      "url": "https://oj.vnoi.info/problem/company3",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_computer",
      "name": "VM 10 Bài 11 - Máy tính",
      "url": "https://oj.vnoi.info/problem/computer",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_conansp",
      "name": "Conan Needs Help Again (Help Conan 4)!",
      "url": "https://oj.vnoi.info/problem/conansp",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_cond",
      "name": "Quan hệ",
      "url": "https://oj.vnoi.info/problem/cond",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_connecte",
      "name": "Đường gấp khúc kỳ diệu",
      "url": "https://oj.vnoi.info/problem/connecte",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_cost",
      "name": "Lại 1 bài phân việc",
      "url": "https://oj.vnoi.info/problem/cost",
      "judge": "VNOJ",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "VNOJ_cowgirl",
      "name": "Cô gái chăn bò",
      "url": "https://oj.vnoi.info/problem/cowgirl",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_cp",
      "name": "Số chính phương",
      "url": "https://oj.vnoi.info/problem/cp",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_cppset",
      "name": "Tập hợp động",
      "url": "https://oj.vnoi.info/problem/cppset",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_cprime",
      "name": "Prime Number Theorem",
      "url": "https://oj.vnoi.info/problem/cprime",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_crate",
      "name": "Coder Rating",
      "url": "https://oj.vnoi.info/problem/crate",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_crec01",
      "name": "Đếm hình chữ nhật trên bảng 0-1",
      "url": "https://oj.vnoi.info/problem/crec01",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_crect",
      "name": "Đếm các hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/crect",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_cruell",
      "name": "Cô giáo dạy toán, phần I",
      "url": "https://oj.vnoi.info/problem/cruell",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_cruell2",
      "name": "Cô giáo dạy toán, phần II",
      "url": "https://oj.vnoi.info/problem/cruell2",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_ctnbulls",
      "name": "Bulls and Cows",
      "url": "https://oj.vnoi.info/problem/ctnbulls",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_ctncln",
      "name": "Chia nhóm",
      "url": "https://oj.vnoi.info/problem/ctncln",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_ctnown",
      "name": "Bội số chung nhỏ nhất",
      "url": "https://oj.vnoi.info/problem/ctnown",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_ctree",
      "name": "Tô màu nhỏ nhất",
      "url": "https://oj.vnoi.info/problem/ctree",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_cutseg",
      "name": "Rút gọn đoạn",
      "url": "https://oj.vnoi.info/problem/cutseg",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_cutseqs",
      "name": "Cắt dãy",
      "url": "https://oj.vnoi.info/problem/cutseqs",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp",
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_cway",
      "name": "VM 08 Bài 03 - Đếm đường đi trên đồ thị đầy đủ",
      "url": "https://oj.vnoi.info/problem/cway",
      "judge": "VNOJ",
      "tags": [
        "bignum",
        "combination"
      ]
    },
    {
      "code": "VNOJ_damage",
      "name": "Động đất",
      "url": "https://oj.vnoi.info/problem/damage",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_dbracket",
      "name": "Dãy ngoặc đúng phân biệt",
      "url": "https://oj.vnoi.info/problem/dbracket",
      "judge": "VNOJ",
      "tags": [
        "suffix_array"
      ]
    },
    {
      "code": "VNOJ_degree",
      "name": "Số lượng bậc",
      "url": "https://oj.vnoi.info/problem/degree",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_demso",
      "name": "Đếm số",
      "url": "https://oj.vnoi.info/problem/demso",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_dgold",
      "name": "Chia vàng",
      "url": "https://oj.vnoi.info/problem/dgold",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_dhbb2020_password",
      "name": "Duyên Hải 2020 - Lớp 11 - Bài 1 - Mật khẩu",
      "url": "https://oj.vnoi.info/problem/dhbb2020_password",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "combination"
      ]
    },
    {
      "code": "VNOJ_dhbb2020_serv",
      "name": "Duyên Hải 2020 - Lớp 10 - Bài 3 - Phục vụ",
      "url": "https://oj.vnoi.info/problem/dhbb2020_serv",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_dhcat",
      "name": "Đồng hồ cát",
      "url": "https://oj.vnoi.info/problem/dhcat",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_diamond",
      "name": "Quân Joker Rô",
      "url": "https://oj.vnoi.info/problem/diamond",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_digit",
      "name": "K-DIGITS",
      "url": "https://oj.vnoi.info/problem/digit",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_digit0",
      "name": "VM 08 Bài 12 - Số 0 tận cùng",
      "url": "https://oj.vnoi.info/problem/digit0",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_disney1",
      "name": "Công viên Disneyland (version 1)",
      "url": "https://oj.vnoi.info/problem/disney1",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_disney2",
      "name": "Công viên Disneyland (version 2)",
      "url": "https://oj.vnoi.info/problem/disney2",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_divrel",
      "name": "Divisibility Relation",
      "url": "https://oj.vnoi.info/problem/divrel",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_domino88",
      "name": "Bản đồ DOMINO",
      "url": "https://oj.vnoi.info/problem/domino88",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_dorucak",
      "name": "DORUCAK",
      "url": "https://oj.vnoi.info/problem/dorucak",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_dpeqn",
      "name": "Congruence Equation",
      "url": "https://oj.vnoi.info/problem/dpeqn",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_dquery",
      "name": "D-query",
      "url": "https://oj.vnoi.info/problem/dquery",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "mo-general"
      ]
    },
    {
      "code": "VNOJ_drashoot",
      "name": "Dragon Shooting",
      "url": "https://oj.vnoi.info/problem/drashoot",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_dtcstr",
      "name": "Chuỗi mắc xích",
      "url": "https://oj.vnoi.info/problem/dtcstr",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "suffix_array"
      ]
    },
    {
      "code": "VNOJ_dtdoi",
      "name": "Đổi tiền",
      "url": "https://oj.vnoi.info/problem/dtdoi",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_dtgame",
      "name": "Tiền bạc luôn là thứ quý giá",
      "url": "https://oj.vnoi.info/problem/dtgame",
      "judge": "VNOJ",
      "tags": [
        "dp_knuth"
      ]
    },
    {
      "code": "VNOJ_dtksub",
      "name": "Chuỗi con xuất hiện K lần",
      "url": "https://oj.vnoi.info/problem/dtksub",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_dttui1",
      "name": "Cái túi 1",
      "url": "https://oj.vnoi.info/problem/dttui1",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_dttui2",
      "name": "Cái túi 2",
      "url": "https://oj.vnoi.info/problem/dttui2",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_earthqk",
      "name": "Earthquakes",
      "url": "https://oj.vnoi.info/problem/earthqk",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_egg",
      "name": "Thả trứng , trò giải trí tuổi teen",
      "url": "https://oj.vnoi.info/problem/egg",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_elect",
      "name": "Thống nhất đất nước",
      "url": "https://oj.vnoi.info/problem/elect",
      "judge": "VNOJ",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "VNOJ_elevator",
      "name": "Thang máy vũ trụ",
      "url": "https://oj.vnoi.info/problem/elevator",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_enet",
      "name": "Mạng điện",
      "url": "https://oj.vnoi.info/problem/enet",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_eqstr",
      "name": "Biến đổi chuỗi",
      "url": "https://oj.vnoi.info/problem/eqstr",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_etf",
      "name": "Phi hàm Euler",
      "url": "https://oj.vnoi.info/problem/etf",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_fc001_kdigit",
      "name": "Free Contest 1 - KDIGIT",
      "url": "https://oj.vnoi.info/problem/fc001_kdigit",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_fc009_palinez",
      "name": "Free Contest 9 - PALINEZ",
      "url": "https://oj.vnoi.info/problem/fc009_palinez",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_fc016_shelf2",
      "name": "Free Contest 16 - SHELF2",
      "url": "https://oj.vnoi.info/problem/fc016_shelf2",
      "judge": "VNOJ",
      "tags": [
        "backtrack"
      ]
    },
    {
      "code": "VNOJ_fc025_balldrop",
      "name": "Free Contest 25 - BALLDROP",
      "url": "https://oj.vnoi.info/problem/fc025_balldrop",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_fc052_photo",
      "name": "Free Contest 52 - PHOTO",
      "url": "https://oj.vnoi.info/problem/fc052_photo",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_fc062_seqag",
      "name": "Free Contest 62 - SEQAG",
      "url": "https://oj.vnoi.info/problem/fc062_seqag",
      "judge": "VNOJ",
      "tags": [
        "dnc"
      ]
    },
    {
      "code": "VNOJ_fc067_dike",
      "name": "Free Contest 67 - DIKE",
      "url": "https://oj.vnoi.info/problem/fc067_dike",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fc073_dance",
      "name": "Free Contest 73 - DANCE",
      "url": "https://oj.vnoi.info/problem/fc073_dance",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_fc074_diamond",
      "name": "Free Contest 74 - DIAMOND",
      "url": "https://oj.vnoi.info/problem/fc074_diamond",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fc075_fprime",
      "name": "Free Contest 75 - FPRIME",
      "url": "https://oj.vnoi.info/problem/fc075_fprime",
      "judge": "VNOJ",
      "tags": [
        "sieve"
      ]
    },
    {
      "code": "VNOJ_fc089_connect",
      "name": "Free Contest 89 - CONNECT",
      "url": "https://oj.vnoi.info/problem/fc089_connect",
      "judge": "VNOJ",
      "tags": [
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_fc106_garden",
      "name": "Free Contest 106 - GARDEN",
      "url": "https://oj.vnoi.info/problem/fc106_garden",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fc106_trochoi",
      "name": "Free Contest 106 - TROCHOI",
      "url": "https://oj.vnoi.info/problem/fc106_trochoi",
      "judge": "VNOJ",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "VNOJ_fc107_maximum",
      "name": "Free Contest 107 - MAXIMUM",
      "url": "https://oj.vnoi.info/problem/fc107_maximum",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fc133_charcnt",
      "name": "Free Contest 133 - CHARCNT",
      "url": "https://oj.vnoi.info/problem/fc133_charcnt",
      "judge": "VNOJ",
      "tags": [
        "fenwick",
        "sqrt-buckets"
      ]
    },
    {
      "code": "VNOJ_fc136_dymnbin",
      "name": "Free Contest 136 - DYMNBIN",
      "url": "https://oj.vnoi.info/problem/fc136_dymnbin",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "hash"
      ]
    },
    {
      "code": "VNOJ_fc136_functions",
      "name": "Free Contest 136 - FUNCTIONS",
      "url": "https://oj.vnoi.info/problem/fc136_functions",
      "judge": "VNOJ",
      "tags": [
        "sqrt-buckets"
      ]
    },
    {
      "code": "VNOJ_fc136_knight",
      "name": "Free Contest 136 - KNIGHT",
      "url": "https://oj.vnoi.info/problem/fc136_knight",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_fc136_splitting",
      "name": "Free Contest 136 - SPLITTING",
      "url": "https://oj.vnoi.info/problem/fc136_splitting",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fc148_toyshopping",
      "name": "Free Contest 148 - TOYSHOPPING",
      "url": "https://oj.vnoi.info/problem/fc148_toyshopping",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_fc_fyt_day1_xorocc",
      "name": "Free Contest FYT Code Cup - Ngày 1 - XOROCC",
      "url": "https://oj.vnoi.info/problem/fc_fyt_day1_xorocc",
      "judge": "VNOJ",
      "tags": [
        "sqrt-buckets"
      ]
    },
    {
      "code": "VNOJ_fcb008_maxdiff",
      "name": "Beginner Free Contest 8 - MAXDIFF",
      "url": "https://oj.vnoi.info/problem/fcb008_maxdiff",
      "judge": "VNOJ",
      "tags": [
        "hard-implementation"
      ]
    },
    {
      "code": "VNOJ_fcb014_evensum",
      "name": "Beginner Free Contest 14 - EVENSUM",
      "url": "https://oj.vnoi.info/problem/fcb014_evensum",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_fcb015_char",
      "name": "Beginner Free Contest 15 - CHAR",
      "url": "https://oj.vnoi.info/problem/fcb015_char",
      "judge": "VNOJ",
      "tags": [
        "casework",
        "implementation"
      ]
    },
    {
      "code": "VNOJ_fcb029_prefix",
      "name": "Beginner Free Contest 29 - PREFIX",
      "url": "https://oj.vnoi.info/problem/fcb029_prefix",
      "judge": "VNOJ",
      "tags": [
        "casework",
        "hard-implementation"
      ]
    },
    {
      "code": "VNOJ_fcb032_multitable",
      "name": "Beginner Free Contest 32 - MULTITABLE",
      "url": "https://oj.vnoi.info/problem/fcb032_multitable",
      "judge": "VNOJ",
      "tags": [
        "casework"
      ]
    },
    {
      "code": "VNOJ_fcb034_socmed",
      "name": "Beginner Free Contest 34 - SOCMED",
      "url": "https://oj.vnoi.info/problem/fcb034_socmed",
      "judge": "VNOJ",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "VNOJ_fcc2018_segment",
      "name": "Free Contest Cup 2018 - SEGMENT",
      "url": "https://oj.vnoi.info/problem/fcc2018_segment",
      "judge": "VNOJ",
      "tags": [
        "binary_lifting",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_fcc2021_climbing",
      "name": "Free Contest Cup 2021 - CLIMBING",
      "url": "https://oj.vnoi.info/problem/fcc2021_climbing",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "mono_queue",
        "sparse_table"
      ]
    },
    {
      "code": "VNOJ_fct002_garden",
      "name": "Free Contest Testing Round 2 - GARDEN",
      "url": "https://oj.vnoi.info/problem/fct002_garden",
      "judge": "VNOJ",
      "tags": [
        "sqrt-2way"
      ]
    },
    {
      "code": "VNOJ_fct003_digitsum",
      "name": "Free Contest Testing Round 3 - DIGITSUM",
      "url": "https://oj.vnoi.info/problem/fct003_digitsum",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_fct003_route",
      "name": "Free Contest Testing Round 3 - ROUTE",
      "url": "https://oj.vnoi.info/problem/fct003_route",
      "judge": "VNOJ",
      "tags": [
        "bridge-and-articulation-points",
        "segment_tree",
        "hld"
      ]
    },
    {
      "code": "VNOJ_fct017_grcolor",
      "name": "Free Contest Testing Round 17 - GRCOLOR",
      "url": "https://oj.vnoi.info/problem/fct017_grcolor",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "VNOJ_fct025_dance",
      "name": "Free Contest Testing Round 25 - DANCE",
      "url": "https://oj.vnoi.info/problem/fct025_dance",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_fct025_library",
      "name": "Free Contest Testing Round 25 - LIBRARY",
      "url": "https://oj.vnoi.info/problem/fct025_library",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_fct031_strop",
      "name": "Free Contest Testing Round 31 - STROP",
      "url": "https://oj.vnoi.info/problem/fct031_strop",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc",
        "prefix_sum"
      ]
    },
    {
      "code": "VNOJ_fence",
      "name": "Hàng rào lớn nhất",
      "url": "https://oj.vnoi.info/problem/fence",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_fflow",
      "name": "Fast Maximum Flow",
      "url": "https://oj.vnoi.info/problem/fflow",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_findnum",
      "name": "Tìm số",
      "url": "https://oj.vnoi.info/problem/findnum",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_fire",
      "name": "Phòng cháy",
      "url": "https://oj.vnoi.info/problem/fire",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_firs",
      "name": "Hàng cây",
      "url": "https://oj.vnoi.info/problem/firs",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_flow1",
      "name": "Giao lưu",
      "url": "https://oj.vnoi.info/problem/flow1",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_flower",
      "name": "VM 08 Bài 25 - Bông hoa kỳ diệu",
      "url": "https://oj.vnoi.info/problem/flower",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_floyd",
      "name": "Floyd hoặc Dijkstra (Cơ bản)",
      "url": "https://oj.vnoi.info/problem/floyd",
      "judge": "VNOJ",
      "tags": [
        "floyd"
      ]
    },
    {
      "code": "VNOJ_fmatch",
      "name": "Fast Maximum Matching",
      "url": "https://oj.vnoi.info/problem/fmatch",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_focus",
      "name": "Chuyên gia ruồi",
      "url": "https://oj.vnoi.info/problem/focus",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "compress"
      ]
    },
    {
      "code": "VNOJ_fp",
      "name": "Finding password",
      "url": "https://oj.vnoi.info/problem/fp",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_fselect",
      "name": "Làm quen bạn mới",
      "url": "https://oj.vnoi.info/problem/fselect",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_fwater",
      "name": "Tưới nước đồng cỏ",
      "url": "https://oj.vnoi.info/problem/fwater",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_gold",
      "name": "Đảo giấu vàng",
      "url": "https://oj.vnoi.info/problem/gold",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_gondor",
      "name": "GONDOR",
      "url": "https://oj.vnoi.info/problem/gondor",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_gpmb",
      "name": "Giải phóng mặt bằng",
      "url": "https://oj.vnoi.info/problem/gpmb",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_gpt",
      "name": "Ước chung lớn nhất trong tam giác Pascal",
      "url": "https://oj.vnoi.info/problem/gpt",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_graph_",
      "name": "Tìm khớp và cầu (Cơ bản)",
      "url": "https://oj.vnoi.info/problem/graph_",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "bridge-and-articulation-points"
      ]
    },
    {
      "code": "VNOJ_group",
      "name": "Phân nhóm",
      "url": "https://oj.vnoi.info/problem/group",
      "judge": "VNOJ",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "VNOJ_gs",
      "name": "Going to school",
      "url": "https://oj.vnoi.info/problem/gs",
      "judge": "VNOJ",
      "tags": [
        "gauss"
      ]
    },
    {
      "code": "VNOJ_gss",
      "name": "Đoạn con có tổng lớn nhất",
      "url": "https://oj.vnoi.info/problem/gss",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_gwcoins",
      "name": "Trò chơi với những đồng xu",
      "url": "https://oj.vnoi.info/problem/gwcoins",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_ham12",
      "name": "VOI 12 Bài 1 - Khoảng cách Hamming",
      "url": "https://oj.vnoi.info/problem/ham12",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_haoi5000",
      "name": "HAOI 5000",
      "url": "https://oj.vnoi.info/problem/haoi5000",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_haoi6000",
      "name": "HAOI 6000",
      "url": "https://oj.vnoi.info/problem/haoi6000",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_harbinge",
      "name": "Harbingers",
      "url": "https://oj.vnoi.info/problem/harbinge",
      "judge": "VNOJ",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "VNOJ_hbtlca",
      "name": "dynamic LCA",
      "url": "https://oj.vnoi.info/problem/hbtlca",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_headqrt",
      "name": "Farthest Headquarters",
      "url": "https://oj.vnoi.info/problem/headqrt",
      "judge": "VNOJ",
      "tags": [
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "VNOJ_headtail",
      "name": "Tung đồng xu",
      "url": "https://oj.vnoi.info/problem/headtail",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_heap1",
      "name": "Một chút về Huffman Tree",
      "url": "https://oj.vnoi.info/problem/heap1",
      "judge": "VNOJ",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "VNOJ_helppm",
      "name": "VM 08 Bài 07 - Hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/helppm",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_hinhthoi",
      "name": "VM 08 Bài 24 - Hình thoi",
      "url": "https://oj.vnoi.info/problem/hinhthoi",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_hirehp",
      "name": "Cho thuê xe",
      "url": "https://oj.vnoi.info/problem/hirehp",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "dp"
      ]
    },
    {
      "code": "VNOJ_hiway",
      "name": "Hai đường đi",
      "url": "https://oj.vnoi.info/problem/hiway",
      "judge": "VNOJ",
      "tags": [
        "dijkstra",
        "flow"
      ]
    },
    {
      "code": "VNOJ_hiway2",
      "name": "Hai đường đi (version 2)",
      "url": "https://oj.vnoi.info/problem/hiway2",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_hnsubway",
      "name": "Hanoi Subway System Construction",
      "url": "https://oj.vnoi.info/problem/hnsubway",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_houses2",
      "name": "Houses",
      "url": "https://oj.vnoi.info/problem/houses2",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_hspc14k",
      "name": "Đếm",
      "url": "https://oj.vnoi.info/problem/hspc14k",
      "judge": "VNOJ",
      "tags": [
        "fenwick_2d"
      ]
    },
    {
      "code": "VNOJ_hugeknap",
      "name": "Cái túi (Hard version)",
      "url": "https://oj.vnoi.info/problem/hugeknap",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_icpc21_mb_j",
      "name": "ICPC 2021 miền Bắc - Bài J: Workers Roadmap",
      "url": "https://oj.vnoi.info/problem/icpc21_mb_j",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_icpc21_mn_i",
      "name": "ICPC 2021 miền Nam - Bài I: Inversion Number",
      "url": "https://oj.vnoi.info/problem/icpc21_mn_i",
      "judge": "VNOJ",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_icpc21_mt_i",
      "name": "ICPC 2021 miền Trung - I: Hanging Certificates of Merit",
      "url": "https://oj.vnoi.info/problem/icpc21_mt_i",
      "judge": "VNOJ",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "VNOJ_icpc21_national_i",
      "name": "ICPC 2021 vòng Quốc gia - Bài I: ICPC Problem Selection",
      "url": "https://oj.vnoi.info/problem/icpc21_national_i",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_icpc21_national_l",
      "name": "ICPC 2021 vòng Quốc gia - Bài L: Lucky Pair",
      "url": "https://oj.vnoi.info/problem/icpc21_national_l",
      "judge": "VNOJ",
      "tags": [
        "sieve"
      ]
    },
    {
      "code": "VNOJ_icpc22_mb_h",
      "name": "ICPC 2022 miền Bắc - H: MEDIAN",
      "url": "https://oj.vnoi.info/problem/icpc22_mb_h",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "fenwick",
        "pbds",
        "trie"
      ]
    },
    {
      "code": "VNOJ_icpc22_mt_a",
      "name": "ICPC 2022 miền Trung - A: Stones Game",
      "url": "https://oj.vnoi.info/problem/icpc22_mt_a",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_ilsbin",
      "name": "ILSBIN",
      "url": "https://oj.vnoi.info/problem/ilsbin",
      "judge": "VNOJ",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "VNOJ_incvn",
      "name": "INCSEQ VN",
      "url": "https://oj.vnoi.info/problem/incvn",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_informac",
      "name": "INFORMACIJE",
      "url": "https://oj.vnoi.info/problem/informac",
      "judge": "VNOJ",
      "tags": [
        "flow",
        "matching"
      ]
    },
    {
      "code": "VNOJ_inkprint",
      "name": "VM 10 Bài 13 - Mực in",
      "url": "https://oj.vnoi.info/problem/inkprint",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_integer7",
      "name": "VM 08 Bài 05 - Số nguyên",
      "url": "https://oj.vnoi.info/problem/integer7",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_ioi22_day1_fish",
      "name": "IOI 2022 - Ngày 1 - Bài 1 - Catfish Farm",
      "url": "https://oj.vnoi.info/problem/ioi22_day1_fish",
      "judge": "VNOJ",
      "tags": [
        "rmq",
        "dp"
      ]
    },
    {
      "code": "VNOJ_ioibin",
      "name": "Các thùng nước",
      "url": "https://oj.vnoi.info/problem/ioibin",
      "judge": "VNOJ",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "VNOJ_itree",
      "name": "Nhãn của cây",
      "url": "https://oj.vnoi.info/problem/itree",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_ivana",
      "name": "Trò chơi vòng số",
      "url": "https://oj.vnoi.info/problem/ivana",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_jacobi",
      "name": "Số học 1",
      "url": "https://oj.vnoi.info/problem/jacobi",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_jobset",
      "name": "VOI 14 Bài 6 - Chọn Công Việc",
      "url": "https://oj.vnoi.info/problem/jobset",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_kagain",
      "name": "Chiến trường Ô qua",
      "url": "https://oj.vnoi.info/problem/kagain",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_kandp",
      "name": "Mã và tốt",
      "url": "https://oj.vnoi.info/problem/kandp",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dijkstra",
        "greedy"
      ]
    },
    {
      "code": "VNOJ_kbuild",
      "name": "Sửa cầu",
      "url": "https://oj.vnoi.info/problem/kbuild",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_kcollect",
      "name": "Thu hoạch",
      "url": "https://oj.vnoi.info/problem/kcollect",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dp",
        "strongly_connected",
        "dp-dag"
      ]
    },
    {
      "code": "VNOJ_kdel",
      "name": "VM 08 Bài 04 - Xóa số",
      "url": "https://oj.vnoi.info/problem/kdel",
      "judge": "VNOJ",
      "tags": [
        "greedy"
      ]
    },
    {
      "code": "VNOJ_kdiff",
      "name": "Trồng hoa",
      "url": "https://oj.vnoi.info/problem/kdiff",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_khistory",
      "name": "Học sử",
      "url": "https://oj.vnoi.info/problem/khistory",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_kingdom",
      "name": "VM 08 Bài 26 - Đế chế hùng mạnh nhất",
      "url": "https://oj.vnoi.info/problem/kingdom",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_kingdoms",
      "name": "VM 10 Bài 14 - KINGDOMS",
      "url": "https://oj.vnoi.info/problem/kingdoms",
      "judge": "VNOJ",
      "tags": [
        "geometry",
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_kinv",
      "name": "Dãy nghịch thế độ dài K",
      "url": "https://oj.vnoi.info/problem/kinv",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_kl11b",
      "name": "Arnook Defensive Line",
      "url": "https://oj.vnoi.info/problem/kl11b",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_kmin",
      "name": "KMIN",
      "url": "https://oj.vnoi.info/problem/kmin",
      "judge": "VNOJ",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "VNOJ_kmix",
      "name": "Pha chế",
      "url": "https://oj.vnoi.info/problem/kmix",
      "judge": "VNOJ",
      "tags": [
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "VNOJ_knmano",
      "name": "VM 11 Bài 11 - Di chuyển mã",
      "url": "https://oj.vnoi.info/problem/knmano",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_kpass",
      "name": "Mật mã",
      "url": "https://oj.vnoi.info/problem/kpass",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_kplank",
      "name": "Bán dừa",
      "url": "https://oj.vnoi.info/problem/kplank",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_kquery",
      "name": "K-query",
      "url": "https://oj.vnoi.info/problem/kquery",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_kquery2",
      "name": "K-query II",
      "url": "https://oj.vnoi.info/problem/kquery2",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_krect",
      "name": "Counting K-Rectangle",
      "url": "https://oj.vnoi.info/problem/krect",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_ktour",
      "name": "Đi chơi",
      "url": "https://oj.vnoi.info/problem/ktour",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_ktreec",
      "name": "Bán hàng",
      "url": "https://oj.vnoi.info/problem/ktreec",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_kway",
      "name": "Trao đổi thông tin",
      "url": "https://oj.vnoi.info/problem/kway",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_labudovi",
      "name": "Hồ Thiên Nga",
      "url": "https://oj.vnoi.info/problem/labudovi",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_landk",
      "name": "Mua đất",
      "url": "https://oj.vnoi.info/problem/landk",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_latgach",
      "name": "Lát gạch",
      "url": "https://oj.vnoi.info/problem/latgach",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_latgach2",
      "name": "Lát gạch 2",
      "url": "https://oj.vnoi.info/problem/latgach2",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_latgach4",
      "name": "Lát gạch 4",
      "url": "https://oj.vnoi.info/problem/latgach4",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_lazycows",
      "name": "Lazy Cows",
      "url": "https://oj.vnoi.info/problem/lazycows",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_lem",
      "name": "RIVER",
      "url": "https://oj.vnoi.info/problem/lem",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_lem3",
      "name": "TRIP",
      "url": "https://oj.vnoi.info/problem/lem3",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_lem4",
      "name": "WHITE BLACK",
      "url": "https://oj.vnoi.info/problem/lem4",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_lem5",
      "name": "ARITHMETIC PROGRESSION",
      "url": "https://oj.vnoi.info/problem/lem5",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "compress"
      ]
    },
    {
      "code": "VNOJ_lem6",
      "name": "BIRTHDAY",
      "url": "https://oj.vnoi.info/problem/lem6",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_light",
      "name": "Hệ thống đèn",
      "url": "https://oj.vnoi.info/problem/light",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_liq",
      "name": "Dãy con tăng dài nhất (bản dễ)",
      "url": "https://oj.vnoi.info/problem/liq",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_lis",
      "name": "Dãy con tăng dài nhất (bản khó)",
      "url": "https://oj.vnoi.info/problem/lis",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_lis2vn",
      "name": "Another Longest Increasing Subsequence Problem",
      "url": "https://oj.vnoi.info/problem/lis2vn",
      "judge": "VNOJ",
      "tags": [
        "bbst",
        "dp"
      ]
    },
    {
      "code": "VNOJ_lites",
      "name": "Bật đèn",
      "url": "https://oj.vnoi.info/problem/lites",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_lott",
      "name": "Xổ số",
      "url": "https://oj.vnoi.info/problem/lott",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_lqdalh",
      "name": "Phản xạ",
      "url": "https://oj.vnoi.info/problem/lqdalh",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_lqdbus",
      "name": "Đến trường",
      "url": "https://oj.vnoi.info/problem/lqdbus",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_lqddiv",
      "name": "Phân tập",
      "url": "https://oj.vnoi.info/problem/lqddiv",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_lqdfarm",
      "name": "FARMER",
      "url": "https://oj.vnoi.info/problem/lqdfarm",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_lqdgonme",
      "name": "Dãy con chung dài nhất (new ver)",
      "url": "https://oj.vnoi.info/problem/lqdgonme",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_lqdhaunt",
      "name": "Nghĩa địa",
      "url": "https://oj.vnoi.info/problem/lqdhaunt",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_lqdnums",
      "name": "Trò chơi nén số (Reworked)",
      "url": "https://oj.vnoi.info/problem/lqdnums",
      "judge": "VNOJ",
      "tags": [
        "binary_search",
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_lqdqper",
      "name": "Truy vấn hoán vị",
      "url": "https://oj.vnoi.info/problem/lqdqper",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_lqdrace",
      "name": "Race (IOI 2011)",
      "url": "https://oj.vnoi.info/problem/lqdrace",
      "judge": "VNOJ",
      "tags": [
        "Centroid",
        "small-to-large"
      ]
    },
    {
      "code": "VNOJ_lqdrect",
      "name": "Đếm hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/lqdrect",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_lqdxeui",
      "name": "2 xe ủi",
      "url": "https://oj.vnoi.info/problem/lqdxeui",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_lsea",
      "name": "Vùng biển của Lulu",
      "url": "https://oj.vnoi.info/problem/lsea",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_lsfight",
      "name": "VM 08 Bài 11 - Quyết đấu",
      "url": "https://oj.vnoi.info/problem/lsfight",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_lubenica",
      "name": "Lubenica",
      "url": "https://oj.vnoi.info/problem/lubenica",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_luckynum",
      "name": "Lucky Numbers",
      "url": "https://oj.vnoi.info/problem/luckynum",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_m00pair",
      "name": "0 0 Pairs",
      "url": "https://oj.vnoi.info/problem/m00pair",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_m3tile",
      "name": "LATGACH3",
      "url": "https://oj.vnoi.info/problem/m3tile",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_machine",
      "name": "Lập lịch trên 3 máy",
      "url": "https://oj.vnoi.info/problem/machine",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_majmun",
      "name": "MAJMUN",
      "url": "https://oj.vnoi.info/problem/majmun",
      "judge": "VNOJ",
      "tags": [
        "prefix_sum",
        "dp"
      ]
    },
    {
      "code": "VNOJ_marble",
      "name": "VM 09 Bài 07 - Bắn bi",
      "url": "https://oj.vnoi.info/problem/marble",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_match1",
      "name": "Cặp ghép không trọng số",
      "url": "https://oj.vnoi.info/problem/match1",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_match2",
      "name": "Bộ ghép đầy đủ trọng số cực tiểu",
      "url": "https://oj.vnoi.info/problem/match2",
      "judge": "VNOJ",
      "tags": [
        "weighted_matching"
      ]
    },
    {
      "code": "VNOJ_matrix",
      "name": "Đếm ma trận",
      "url": "https://oj.vnoi.info/problem/matrix",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_maugiao",
      "name": "The problem for kid",
      "url": "https://oj.vnoi.info/problem/maugiao",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_maxcub",
      "name": "Khối lập phương lớn nhất",
      "url": "https://oj.vnoi.info/problem/maxcub",
      "judge": "VNOJ",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "VNOJ_mbeewalk",
      "name": "Bee Walk",
      "url": "https://oj.vnoi.info/problem/mbeewalk",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_mbipalin",
      "name": "Bipalindrome",
      "url": "https://oj.vnoi.info/problem/mbipalin",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_mbus",
      "name": "Xe buýt",
      "url": "https://oj.vnoi.info/problem/mbus",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_mchaos",
      "name": "Chaos Strings",
      "url": "https://oj.vnoi.info/problem/mchaos",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_mclean",
      "name": "Cleaning Robot",
      "url": "https://oj.vnoi.info/problem/mclean",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_mclonum",
      "name": "Closest Number",
      "url": "https://oj.vnoi.info/problem/mclonum",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_mcoins",
      "name": "Coins Game",
      "url": "https://oj.vnoi.info/problem/mcoins",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_mconvoi",
      "name": "Con Voi",
      "url": "https://oj.vnoi.info/problem/mconvoi",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_mcquery",
      "name": "MinCut Query",
      "url": "https://oj.vnoi.info/problem/mcquery",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_mdolls",
      "name": "Nested Dolls",
      "url": "https://oj.vnoi.info/problem/mdolls",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_mdostava",
      "name": "Pizza Delivery",
      "url": "https://oj.vnoi.info/problem/mdostava",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_median",
      "name": "Phần tử trung vị",
      "url": "https://oj.vnoi.info/problem/median",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "segtree_walk",
        "fenwick",
        "pbds",
        "trie"
      ]
    },
    {
      "code": "VNOJ_mele2",
      "name": "ELEVATOR II",
      "url": "https://oj.vnoi.info/problem/mele2",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_mele3",
      "name": "MELE3",
      "url": "https://oj.vnoi.info/problem/mele3",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_message",
      "name": "Truyền tin",
      "url": "https://oj.vnoi.info/problem/message",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_meterain",
      "name": "Mưa thiên thạch",
      "url": "https://oj.vnoi.info/problem/meterain",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_mfish",
      "name": "Catch Fish",
      "url": "https://oj.vnoi.info/problem/mfish",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_midas",
      "name": "Vua Midas thích vàng",
      "url": "https://oj.vnoi.info/problem/midas",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_military",
      "name": "Câu chuyện người lính",
      "url": "https://oj.vnoi.info/problem/military",
      "judge": "VNOJ",
      "tags": [
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "VNOJ_mincost",
      "name": "Luồng với chi phí nhỏ nhất",
      "url": "https://oj.vnoi.info/problem/mincost",
      "judge": "VNOJ",
      "tags": [
        "flow-mincost"
      ]
    },
    {
      "code": "VNOJ_mink",
      "name": "Huyền thoại Lục Vân Tiên",
      "url": "https://oj.vnoi.info/problem/mink",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_mixup2",
      "name": "Đàn bò hỗn loạn",
      "url": "https://oj.vnoi.info/problem/mixup2",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_mjourney",
      "name": "Journey with Pigs",
      "url": "https://oj.vnoi.info/problem/mjourney",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_mkuhar",
      "name": "Most Servings Meal",
      "url": "https://oj.vnoi.info/problem/mkuhar",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_mmatrix",
      "name": "SHIFT Operator on Matrix",
      "url": "https://oj.vnoi.info/problem/mmatrix",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_mminper",
      "name": "Minimum Permutation",
      "url": "https://oj.vnoi.info/problem/mminper",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_mmmgame",
      "name": "M & M Game",
      "url": "https://oj.vnoi.info/problem/mmmgame",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_mmod29",
      "name": "CALCULATE POW(2004,X) MOD 29",
      "url": "https://oj.vnoi.info/problem/mmod29",
      "judge": "VNOJ",
      "tags": [
        "dnc"
      ]
    },
    {
      "code": "VNOJ_move12",
      "name": "VOI 12 Bài 3 - Điều động",
      "url": "https://oj.vnoi.info/problem/move12",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_mpart",
      "name": "Chia nhóm",
      "url": "https://oj.vnoi.info/problem/mpart",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_mpigs",
      "name": "Bán lợn",
      "url": "https://oj.vnoi.info/problem/mpigs",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_mpilot",
      "name": "Pilots",
      "url": "https://oj.vnoi.info/problem/mpilot",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "greedy"
      ]
    },
    {
      "code": "VNOJ_mpyramid",
      "name": "IOI06 Pyramid - Tượng đài",
      "url": "https://oj.vnoi.info/problem/mpyramid",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_mrect1",
      "name": "Điểm trên cạnh hình chữ nhật - HRASTOVI",
      "url": "https://oj.vnoi.info/problem/mrect1",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_mreplbrc",
      "name": "Counting The Way of Bracket Replacement",
      "url": "https://oj.vnoi.info/problem/mreplbrc",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_mroads",
      "name": "Roads Repair",
      "url": "https://oj.vnoi.info/problem/mroads",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_mse06h",
      "name": "Japan",
      "url": "https://oj.vnoi.info/problem/mse06h",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_mse07b",
      "name": "Double Queue",
      "url": "https://oj.vnoi.info/problem/mse07b",
      "judge": "VNOJ",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "VNOJ_mskycode",
      "name": "Sky Code",
      "url": "https://oj.vnoi.info/problem/mskycode",
      "judge": "VNOJ",
      "tags": [
        "inclusion-exclusion",
        "sieve"
      ]
    },
    {
      "code": "VNOJ_mstick",
      "name": "Wooden Sticks",
      "url": "https://oj.vnoi.info/problem/mstick",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_mstring",
      "name": "String problem",
      "url": "https://oj.vnoi.info/problem/mstring",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_mtele",
      "name": "Tele Broadcast",
      "url": "https://oj.vnoi.info/problem/mtele",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_mtotalf",
      "name": "Total Flow",
      "url": "https://oj.vnoi.info/problem/mtotalf",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_mtree",
      "name": "Another Tree Problem",
      "url": "https://oj.vnoi.info/problem/mtree",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_mtreecol",
      "name": "Color a tree",
      "url": "https://oj.vnoi.info/problem/mtreecol",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_mtriarea",
      "name": "Maximum Triangle Area",
      "url": "https://oj.vnoi.info/problem/mtriarea",
      "judge": "VNOJ",
      "tags": [
        "geometry",
        "convexhull"
      ]
    },
    {
      "code": "VNOJ_mtwalk",
      "name": "Mountain Walking",
      "url": "https://oj.vnoi.info/problem/mtwalk",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_mul2com",
      "name": "Binary multiplication",
      "url": "https://oj.vnoi.info/problem/mul2com",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_mulone",
      "name": "Nhân 1",
      "url": "https://oj.vnoi.info/problem/mulone",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_mvector",
      "name": "Sum of Vectors",
      "url": "https://oj.vnoi.info/problem/mvector",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_ndccard",
      "name": "Các lá bài Blackjack",
      "url": "https://oj.vnoi.info/problem/ndccard",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_ndigit",
      "name": "VM 08 Bài 18 - Dãy chữ số kỳ diệu",
      "url": "https://oj.vnoi.info/problem/ndigit",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_netaccel",
      "name": "VM 10 Bài 12 - Tăng tốc mạng máy tính",
      "url": "https://oj.vnoi.info/problem/netaccel",
      "judge": "VNOJ",
      "tags": [
        "dijkstra",
        "stl"
      ]
    },
    {
      "code": "VNOJ_newj",
      "name": "Số học 2",
      "url": "https://oj.vnoi.info/problem/newj",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_nhp",
      "name": "VM 08 Bài 22 - Harry Potter và mê cung tử thần",
      "url": "https://oj.vnoi.info/problem/nhp",
      "judge": "VNOJ",
      "tags": [
        "weighted_matching"
      ]
    },
    {
      "code": "VNOJ_nhpaint",
      "name": "Naruto học máy tính",
      "url": "https://oj.vnoi.info/problem/nhpaint",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_nicequad",
      "name": "Tứ giác đẹp",
      "url": "https://oj.vnoi.info/problem/nicequad",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_nk05dsrt",
      "name": "Sa mạc",
      "url": "https://oj.vnoi.info/problem/nk05dsrt",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_nk05mnim",
      "name": "Bốc sỏi",
      "url": "https://oj.vnoi.info/problem/nk05mnim",
      "judge": "VNOJ",
      "tags": [
        "nim"
      ]
    },
    {
      "code": "VNOJ_nk05ordr",
      "name": "Trật tự",
      "url": "https://oj.vnoi.info/problem/nk05ordr",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_nk2mfs",
      "name": "Lập lịch trên hai máy",
      "url": "https://oj.vnoi.info/problem/nk2mfs",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_nka1",
      "name": "A1",
      "url": "https://oj.vnoi.info/problem/nka1",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkbm",
      "name": "Cặp ghép cực đại trên đồ thị hai phía",
      "url": "https://oj.vnoi.info/problem/nkbm",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_nkcable",
      "name": "Nối mạng",
      "url": "https://oj.vnoi.info/problem/nkcable",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkcity",
      "name": "Xây dựng thành phố",
      "url": "https://oj.vnoi.info/problem/nkcity",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_nkdec",
      "name": "Trang trí dàn đèn",
      "url": "https://oj.vnoi.info/problem/nkdec",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_nkflow",
      "name": "Luồng cực đại trên mạng",
      "url": "https://oj.vnoi.info/problem/nkflow",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_nkgolf",
      "name": "Sân golf",
      "url": "https://oj.vnoi.info/problem/nkgolf",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_nkguard",
      "name": "Bảo vệ nông trang",
      "url": "https://oj.vnoi.info/problem/nkguard",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_nkh",
      "name": "Tách Từ",
      "url": "https://oj.vnoi.info/problem/nkh",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkinv",
      "name": "Dãy nghịch thế",
      "url": "https://oj.vnoi.info/problem/nkinv",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_nkland",
      "name": "Mảnh đất tổ tiên",
      "url": "https://oj.vnoi.info/problem/nkland",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_nkleaves",
      "name": "Leaves",
      "url": "https://oj.vnoi.info/problem/nkleaves",
      "judge": "VNOJ",
      "tags": [
        "dp-convexhull"
      ]
    },
    {
      "code": "VNOJ_nklexic",
      "name": "Thứ tự từ điển",
      "url": "https://oj.vnoi.info/problem/nklexic",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_nklineup",
      "name": "Xếp hàng",
      "url": "https://oj.vnoi.info/problem/nklineup",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "sparse_table"
      ]
    },
    {
      "code": "VNOJ_nkluck",
      "name": "Dãy số may mắn",
      "url": "https://oj.vnoi.info/problem/nkluck",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_nkmaxseq",
      "name": "VOI 06 Bài 7 - Dãy con dài nhất",
      "url": "https://oj.vnoi.info/problem/nkmaxseq",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_nkminers",
      "name": "IOI07 Miners",
      "url": "https://oj.vnoi.info/problem/nkminers",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkmines",
      "name": "Trò chơi dò mìn",
      "url": "https://oj.vnoi.info/problem/nkmines",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_nkmobile",
      "name": "IOI01 Mobiles",
      "url": "https://oj.vnoi.info/problem/nkmobile",
      "judge": "VNOJ",
      "tags": [
        "fenwick_2d"
      ]
    },
    {
      "code": "VNOJ_nkmou",
      "name": "IOI05 Mountains",
      "url": "https://oj.vnoi.info/problem/nkmou",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "compress"
      ]
    },
    {
      "code": "VNOJ_nknet",
      "name": "Mạng truyền tin",
      "url": "https://oj.vnoi.info/problem/nknet",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_nkonearc",
      "name": "VOI 06 Bài 5 - Mạng máy tính",
      "url": "https://oj.vnoi.info/problem/nkonearc",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_nkpairs",
      "name": "IOI07 Pairs",
      "url": "https://oj.vnoi.info/problem/nkpairs",
      "judge": "VNOJ",
      "tags": [
        "fenwick_2d"
      ]
    },
    {
      "code": "VNOJ_nkpalin",
      "name": "Chuỗi đối xứng",
      "url": "https://oj.vnoi.info/problem/nkpalin",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkpano",
      "name": "Billboard painting",
      "url": "https://oj.vnoi.info/problem/nkpano",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkparity",
      "name": "Mạng chẵn lẻ",
      "url": "https://oj.vnoi.info/problem/nkparity",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_nkpath",
      "name": "VOI 06 Bài 6 - Đường đi trên lưới",
      "url": "https://oj.vnoi.info/problem/nkpath",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkpatrol",
      "name": "Robot tuần tra",
      "url": "https://oj.vnoi.info/problem/nkpatrol",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_nkpoli",
      "name": "Đa giác",
      "url": "https://oj.vnoi.info/problem/nkpoli",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_nkpolice",
      "name": "Police",
      "url": "https://oj.vnoi.info/problem/nkpolice",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_nkpoly",
      "name": "Chia đa giác",
      "url": "https://oj.vnoi.info/problem/nkpoly",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkracing",
      "name": "Vòng đua F1",
      "url": "https://oj.vnoi.info/problem/nkracing",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_nkrez",
      "name": "Hội trường",
      "url": "https://oj.vnoi.info/problem/nkrez",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkseq",
      "name": "Dãy số",
      "url": "https://oj.vnoi.info/problem/nkseq",
      "judge": "VNOJ",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "VNOJ_nkset",
      "name": "Dãy số",
      "url": "https://oj.vnoi.info/problem/nkset",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "bitset",
        "sqrt-buckets"
      ]
    },
    {
      "code": "VNOJ_nksev",
      "name": "Tách từ",
      "url": "https://oj.vnoi.info/problem/nksev",
      "judge": "VNOJ",
      "tags": [
        "trie"
      ]
    },
    {
      "code": "VNOJ_nksgame",
      "name": "VOI 08 Bài 1 - Trò chơi với dãy số",
      "url": "https://oj.vnoi.info/problem/nksgame",
      "judge": "VNOJ",
      "tags": [
        "binary_search",
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_nksp",
      "name": "Siêu đối xứng",
      "url": "https://oj.vnoi.info/problem/nksp",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nkspilja",
      "name": "Hang động",
      "url": "https://oj.vnoi.info/problem/nkspilja",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_nktardy",
      "name": "Lập lịch giảm thiểu trễ hạn",
      "url": "https://oj.vnoi.info/problem/nktardy",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_nkteam",
      "name": "Team Selection",
      "url": "https://oj.vnoi.info/problem/nkteam",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_nktick",
      "name": "Xếp hàng mua vé",
      "url": "https://oj.vnoi.info/problem/nktick",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_nktoss",
      "name": "Tung đồng xu",
      "url": "https://oj.vnoi.info/problem/nktoss",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_nktrafic",
      "name": "Monkey island",
      "url": "https://oj.vnoi.info/problem/nktrafic",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_nktree",
      "name": "Cây nhị phân tìm kiếm",
      "url": "https://oj.vnoi.info/problem/nktree",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_nktrio",
      "name": "Bộ ba cao thủ",
      "url": "https://oj.vnoi.info/problem/nktrio",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "bitset"
      ]
    },
    {
      "code": "VNOJ_note",
      "name": "Gấp tiền",
      "url": "https://oj.vnoi.info/problem/note",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_npr",
      "name": "Vần hoàn hảo",
      "url": "https://oj.vnoi.info/problem/npr",
      "judge": "VNOJ",
      "tags": [
        "trie"
      ]
    },
    {
      "code": "VNOJ_nsc",
      "name": "VM 09 Bài 05 - Nuga chia kẹo",
      "url": "https://oj.vnoi.info/problem/nsc",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_nsp",
      "name": "Hành Tinh Đá",
      "url": "https://oj.vnoi.info/problem/nsp",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_number",
      "name": "Biến đổi số",
      "url": "https://oj.vnoi.info/problem/number",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_olp_ct20_route",
      "name": "Olympic Sinh Viên 2020 - Chuyên tin - Đường đi",
      "url": "https://oj.vnoi.info/problem/olp_ct20_route",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_onbridge",
      "name": "Online Bridge Searching",
      "url": "https://oj.vnoi.info/problem/onbridge",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_optcut",
      "name": "Chặt cây",
      "url": "https://oj.vnoi.info/problem/optcut",
      "judge": "VNOJ",
      "tags": [
        "dp_knuth"
      ]
    },
    {
      "code": "VNOJ_orderset",
      "name": "Order statistic set",
      "url": "https://oj.vnoi.info/problem/orderset",
      "judge": "VNOJ",
      "tags": [
        "bbst",
        "segment_tree",
        "trie",
        "pbds",
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_own2",
      "name": "Bội số chung nhỏ nhất (Version 2)",
      "url": "https://oj.vnoi.info/problem/own2",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_pagain",
      "name": "Lại là số nguyên tố",
      "url": "https://oj.vnoi.info/problem/pagain",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_palinx",
      "name": "Xâu đối xứng",
      "url": "https://oj.vnoi.info/problem/palinx",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "trie"
      ]
    },
    {
      "code": "VNOJ_paliny",
      "name": "Palindrome dài nhất",
      "url": "https://oj.vnoi.info/problem/paliny",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "binary_search",
        "manacher"
      ]
    },
    {
      "code": "VNOJ_parigame",
      "name": "VOI 11 Bài 5 - Trò chơi chẵn lẻ",
      "url": "https://oj.vnoi.info/problem/parigame",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "game_theory_adhoc"
      ]
    },
    {
      "code": "VNOJ_passet",
      "name": "Tập hợp động (Pascal Version)",
      "url": "https://oj.vnoi.info/problem/passet",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_pbcdem",
      "name": "Đếm dãy",
      "url": "https://oj.vnoi.info/problem/pbcdem",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_pbcpoint",
      "name": "Nối điểm",
      "url": "https://oj.vnoi.info/problem/pbcpoint",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_pbcwater",
      "name": "Tính toán lượng nước",
      "url": "https://oj.vnoi.info/problem/pbcwater",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_pcircle",
      "name": "Vòng số nguyên tố",
      "url": "https://oj.vnoi.info/problem/pcircle",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_pcycle",
      "name": "VM 08 Bài 20 - Mê cung",
      "url": "https://oj.vnoi.info/problem/pcycle",
      "judge": "VNOJ",
      "tags": [
        "euler_tour"
      ]
    },
    {
      "code": "VNOJ_pizzaloc",
      "name": "Pizza Location",
      "url": "https://oj.vnoi.info/problem/pizzaloc",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_pk11e",
      "name": "Queen Game",
      "url": "https://oj.vnoi.info/problem/pk11e",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_plahte",
      "name": "PLAHTE",
      "url": "https://oj.vnoi.info/problem/plahte",
      "judge": "VNOJ",
      "tags": [
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_points2",
      "name": "Điểm và đoạn thẳng",
      "url": "https://oj.vnoi.info/problem/points2",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_poly4",
      "name": "Sao đa giác",
      "url": "https://oj.vnoi.info/problem/poly4",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_poslozi",
      "name": "POSLOZI",
      "url": "https://oj.vnoi.info/problem/poslozi",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_post2",
      "name": "A cộng B version 2",
      "url": "https://oj.vnoi.info/problem/post2",
      "judge": "VNOJ",
      "tags": [
        "fft"
      ]
    },
    {
      "code": "VNOJ_potato",
      "name": "Ăn khoai",
      "url": "https://oj.vnoi.info/problem/potato",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_power",
      "name": "Lũy thừa",
      "url": "https://oj.vnoi.info/problem/power",
      "judge": "VNOJ",
      "tags": [
        "binary_search",
        "dnc"
      ]
    },
    {
      "code": "VNOJ_pravo",
      "name": "Tam giác vuông",
      "url": "https://oj.vnoi.info/problem/pravo",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_predhbb21_teleports",
      "name": "Thi thử Duyên hải 2021 - Lần 3 - Bài 4 - TELEPORTS",
      "url": "https://oj.vnoi.info/problem/predhbb21_teleports",
      "judge": "VNOJ",
      "tags": [
        "euler_tour",
        "graph"
      ]
    },
    {
      "code": "VNOJ_prettyp",
      "name": "Pretty Printing",
      "url": "https://oj.vnoi.info/problem/prettyp",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_product",
      "name": "VM 10 Bài 08 - Tích",
      "url": "https://oj.vnoi.info/problem/product",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_ptrang",
      "name": "Phân Trang",
      "url": "https://oj.vnoi.info/problem/ptrang",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_ptree",
      "name": "Cây P đỉnh (Cơ bản)",
      "url": "https://oj.vnoi.info/problem/ptree",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_pvhoi22_3_tree",
      "name": "PVHOI 2.2 bài 3: Quan hệ mập mờ (60 điểm)",
      "url": "https://oj.vnoi.info/problem/pvhoi22_3_tree",
      "judge": "VNOJ",
      "tags": [
        "hld"
      ]
    },
    {
      "code": "VNOJ_pvhpassword",
      "name": "Mật khẩu an toàn",
      "url": "https://oj.vnoi.info/problem/pvhpassword",
      "judge": "VNOJ",
      "tags": [
        "hard-implementation"
      ]
    },
    {
      "code": "VNOJ_pvoi14_2",
      "name": "CHỌN ROBOT",
      "url": "https://oj.vnoi.info/problem/pvoi14_2",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_pvoi14_4",
      "name": "Chữ M",
      "url": "https://oj.vnoi.info/problem/pvoi14_4",
      "judge": "VNOJ",
      "tags": [
        "fenwick"
      ]
    },
    {
      "code": "VNOJ_pwalk",
      "name": "Dạo chơi đồng cỏ",
      "url": "https://oj.vnoi.info/problem/pwalk",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_pwrfail",
      "name": "Mất điện",
      "url": "https://oj.vnoi.info/problem/pwrfail",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_pyramid2",
      "name": "Duyệt binh",
      "url": "https://oj.vnoi.info/problem/pyramid2",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_qbagents",
      "name": "Các đại lý",
      "url": "https://oj.vnoi.info/problem/qbagents",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_qbbishop",
      "name": "VOI 06 Bài 2 - Quân tượng",
      "url": "https://oj.vnoi.info/problem/qbbishop",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_qbbuild",
      "name": "Xây dựng đường",
      "url": "https://oj.vnoi.info/problem/qbbuild",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_qbcake",
      "name": "Cắt bánh",
      "url": "https://oj.vnoi.info/problem/qbcake",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "geometry"
      ]
    },
    {
      "code": "VNOJ_qbcond",
      "name": "Quan hệ có điều kiện",
      "url": "https://oj.vnoi.info/problem/qbcond",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_qbdivseq",
      "name": "Chia dãy",
      "url": "https://oj.vnoi.info/problem/qbdivseq",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_qbflower",
      "name": "Tặng hoa",
      "url": "https://oj.vnoi.info/problem/qbflower",
      "judge": "VNOJ",
      "tags": [
        "matching-general"
      ]
    },
    {
      "code": "VNOJ_qbgame",
      "name": "Trò chơi trên ma trận",
      "url": "https://oj.vnoi.info/problem/qbgame",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_qbheap",
      "name": "Hàng đợi có độ ưu tiên",
      "url": "https://oj.vnoi.info/problem/qbheap",
      "judge": "VNOJ",
      "tags": [
        "stl"
      ]
    },
    {
      "code": "VNOJ_qbhv",
      "name": "Hoán vị chữ cái",
      "url": "https://oj.vnoi.info/problem/qbhv",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_qbmax",
      "name": "Đường đi có tổng lớn nhất",
      "url": "https://oj.vnoi.info/problem/qbmax",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_qbmst",
      "name": "Cây khung nhỏ nhất (HEAP)",
      "url": "https://oj.vnoi.info/problem/qbmst",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_qbpal",
      "name": "Đếm chuỗi đối xứng",
      "url": "https://oj.vnoi.info/problem/qbpal",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_qbpizza",
      "name": "Cắt bánh pizza",
      "url": "https://oj.vnoi.info/problem/qbpizza",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_qbpoint",
      "name": "Bộ ba điểm thẳng hàng",
      "url": "https://oj.vnoi.info/problem/qbpoint",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_qbrect",
      "name": "Hình chữ nhật 0 1",
      "url": "https://oj.vnoi.info/problem/qbrect",
      "judge": "VNOJ",
      "tags": [
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_qbschool",
      "name": "Đến trường",
      "url": "https://oj.vnoi.info/problem/qbschool",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_qbselect",
      "name": "VOI 06 Bài 1 - Chọn ô",
      "url": "https://oj.vnoi.info/problem/qbselect",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_qbsquare",
      "name": "Hình vuông 0 1",
      "url": "https://oj.vnoi.info/problem/qbsquare",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "mono_queue"
      ]
    },
    {
      "code": "VNOJ_qbticket",
      "name": "Mua vé tàu hoả",
      "url": "https://oj.vnoi.info/problem/qbticket",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_qbtrans",
      "name": "Vận chuyển hàng",
      "url": "https://oj.vnoi.info/problem/qbtrans",
      "judge": "VNOJ",
      "tags": [
        "dijkstra",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_qhroad",
      "name": "Phá đường",
      "url": "https://oj.vnoi.info/problem/qhroad",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_qmax",
      "name": "Giá trị lớn nhất",
      "url": "https://oj.vnoi.info/problem/qmax",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_qmax2",
      "name": "Giá trị lớn nhất ver2",
      "url": "https://oj.vnoi.info/problem/qmax2",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_qmax3vn",
      "name": "Giá trị lớn nhất 3",
      "url": "https://oj.vnoi.info/problem/qmax3vn",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_qos",
      "name": "VOI 14 Bài 5 - Chất Lượng Dịch Vụ",
      "url": "https://oj.vnoi.info/problem/qos",
      "judge": "VNOJ",
      "tags": [
        "dijkstra",
        "dp"
      ]
    },
    {
      "code": "VNOJ_qtbit",
      "name": "Trò chơi 0-1",
      "url": "https://oj.vnoi.info/problem/qtbit",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_qtmove",
      "name": "Trò chơi xếp hình",
      "url": "https://oj.vnoi.info/problem/qtmove",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_qtree3",
      "name": "VM 08 Bài 15 - Truy vấn trên cây",
      "url": "https://oj.vnoi.info/problem/qtree3",
      "judge": "VNOJ",
      "tags": [
        "hld"
      ]
    },
    {
      "code": "VNOJ_qtreex",
      "name": "Truy vấn trên cây",
      "url": "https://oj.vnoi.info/problem/qtreex",
      "judge": "VNOJ",
      "tags": [
        "hld"
      ]
    },
    {
      "code": "VNOJ_qtseq",
      "name": "Dãy số QT",
      "url": "https://oj.vnoi.info/problem/qtseq",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_quad",
      "name": "Xây hàng rào",
      "url": "https://oj.vnoi.info/problem/quad",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_qvescape",
      "name": "Help Conan 9 !",
      "url": "https://oj.vnoi.info/problem/qvescape",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_qvsick",
      "name": "Help Conan 10!",
      "url": "https://oj.vnoi.info/problem/qvsick",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_rabgame",
      "name": "Trò chơi thỏ",
      "url": "https://oj.vnoi.info/problem/rabgame",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "bignum"
      ]
    },
    {
      "code": "VNOJ_raovuon",
      "name": "Rào Vườn",
      "url": "https://oj.vnoi.info/problem/raovuon",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_rect1",
      "name": "Các hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/rect1",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_rect3",
      "name": "VM 08 Bài 23 - Khối tam chữ nhật",
      "url": "https://oj.vnoi.info/problem/rect3",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_rectp",
      "name": "Chu vi các hình chữ nhật",
      "url": "https://oj.vnoi.info/problem/rectp",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_reform",
      "name": "VOI 15 Bài 3 - Kế hoạch cải tổ",
      "url": "https://oj.vnoi.info/problem/reform",
      "judge": "VNOJ",
      "tags": [
        "bridge-and-articulation-points"
      ]
    },
    {
      "code": "VNOJ_revamp",
      "name": "Revamping Trails",
      "url": "https://oj.vnoi.info/problem/revamp",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_roads",
      "name": "Roads",
      "url": "https://oj.vnoi.info/problem/roads",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_safenet2",
      "name": "Mạng máy tính an toàn",
      "url": "https://oj.vnoi.info/problem/safenet2",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "biconnected"
      ]
    },
    {
      "code": "VNOJ_sails",
      "name": "IOI07 Sails",
      "url": "https://oj.vnoi.info/problem/sails",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_scollect",
      "name": "Trò chơi nhặt quà",
      "url": "https://oj.vnoi.info/problem/scollect",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_sec",
      "name": "Tin mật",
      "url": "https://oj.vnoi.info/problem/sec",
      "judge": "VNOJ",
      "tags": [
        "trie"
      ]
    },
    {
      "code": "VNOJ_selfdiv",
      "name": "VM 09 Bài 04 - Self-divisible Number",
      "url": "https://oj.vnoi.info/problem/selfdiv",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_seq198",
      "name": "VOI 16 Bài 1 - SEQ198",
      "url": "https://oj.vnoi.info/problem/seq198",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_setnja",
      "name": "Setnja",
      "url": "https://oj.vnoi.info/problem/setnja",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_sflowerf",
      "name": "Hội hoa xuân",
      "url": "https://oj.vnoi.info/problem/sflowerf",
      "judge": "VNOJ",
      "tags": [
        "matching"
      ]
    },
    {
      "code": "VNOJ_shhv",
      "name": "Số hiệu hoán vị",
      "url": "https://oj.vnoi.info/problem/shhv",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_shth",
      "name": "Số hiệu tổ hợp",
      "url": "https://oj.vnoi.info/problem/shth",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_shufflek",
      "name": "Shuffling cards",
      "url": "https://oj.vnoi.info/problem/shufflek",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_shuttle",
      "name": "Chuyến xe du lịch hội trợ",
      "url": "https://oj.vnoi.info/problem/shuttle",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_slikar",
      "name": "Slikar",
      "url": "https://oj.vnoi.info/problem/slikar",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_smartdog",
      "name": "VM 11 Bài 07 - Tham ăn",
      "url": "https://oj.vnoi.info/problem/smartdog",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_snad",
      "name": "Số lượng số",
      "url": "https://oj.vnoi.info/problem/snad",
      "judge": "VNOJ",
      "tags": [
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_sopenp",
      "name": "Khai bút đầu xuân",
      "url": "https://oj.vnoi.info/problem/sopenp",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_spseq",
      "name": "Sequences",
      "url": "https://oj.vnoi.info/problem/spseq",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp",
        "compress"
      ]
    },
    {
      "code": "VNOJ_spsum",
      "name": "Sum",
      "url": "https://oj.vnoi.info/problem/spsum",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_squares",
      "name": "Hình vuông",
      "url": "https://oj.vnoi.info/problem/squares",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_steel",
      "name": "VOI 05 Bài 4 - Khuôn thép",
      "url": "https://oj.vnoi.info/problem/steel",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_stone1",
      "name": "Rải sỏi",
      "url": "https://oj.vnoi.info/problem/stone1",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_stravel",
      "name": "Chuyến đi an toàn",
      "url": "https://oj.vnoi.info/problem/stravel",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_substr",
      "name": "Xâu con",
      "url": "https://oj.vnoi.info/problem/substr",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "kmp",
        "z_func"
      ]
    },
    {
      "code": "VNOJ_sumaa",
      "name": "Lại là cây",
      "url": "https://oj.vnoi.info/problem/sumaa",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "dsu"
      ]
    },
    {
      "code": "VNOJ_supersum",
      "name": "Tổng siêu hạng",
      "url": "https://oj.vnoi.info/problem/supersum",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_tamcam",
      "name": "VM 09 Bài 03 - Tam Cam",
      "url": "https://oj.vnoi.info/problem/tamcam",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_tapn",
      "name": "TAPN",
      "url": "https://oj.vnoi.info/problem/tapn",
      "judge": "VNOJ",
      "tags": [
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_tbike",
      "name": "Đạp xe",
      "url": "https://oj.vnoi.info/problem/tbike",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_tcdfz",
      "name": "Chữ số tận cùng khác 0",
      "url": "https://oj.vnoi.info/problem/tcdfz",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_tconcert",
      "name": "Buổi hòa nhạc",
      "url": "https://oj.vnoi.info/problem/tconcert",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_theme",
      "name": "Đoạn cao trào của bản nhạc",
      "url": "https://oj.vnoi.info/problem/theme",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_thseq",
      "name": "Dãy số",
      "url": "https://oj.vnoi.info/problem/thseq",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_thtrace",
      "name": "ĐUỔI BẮT",
      "url": "https://oj.vnoi.info/problem/thtrace",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_tjalg",
      "name": "Tìm TPLT mạnh",
      "url": "https://oj.vnoi.info/problem/tjalg",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "strongly_connected"
      ]
    },
    {
      "code": "VNOJ_tnhwifi",
      "name": "Cafe WIFI",
      "url": "https://oj.vnoi.info/problem/tnhwifi",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_tour2509",
      "name": "Dã ngoại",
      "url": "https://oj.vnoi.info/problem/tour2509",
      "judge": "VNOJ",
      "tags": [
        "euler_tour"
      ]
    },
    {
      "code": "VNOJ_toy",
      "name": "Đồ chơi",
      "url": "https://oj.vnoi.info/problem/toy",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_trafficn",
      "name": "Traffic Network",
      "url": "https://oj.vnoi.info/problem/trafficn",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_training",
      "name": "IOI07 Training",
      "url": "https://oj.vnoi.info/problem/training",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_treecst",
      "name": "Tree Construction",
      "url": "https://oj.vnoi.info/problem/treecst",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_treepath",
      "name": "Đường đi trên cây",
      "url": "https://oj.vnoi.info/problem/treepath",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_triangle",
      "name": "Diện tích các tam giác vuông cân",
      "url": "https://oj.vnoi.info/problem/triangle",
      "judge": "VNOJ",
      "tags": [
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_tribe",
      "name": "VM 08 Bài 10 - Bộ lạc",
      "url": "https://oj.vnoi.info/problem/tribe",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_triomino",
      "name": "Triomino Game",
      "url": "https://oj.vnoi.info/problem/triomino",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_tripod",
      "name": "Kiềng ba chân",
      "url": "https://oj.vnoi.info/problem/tripod",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_tripod2",
      "name": "Kiềng ba chân (hard version)",
      "url": "https://oj.vnoi.info/problem/tripod2",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_ttrip",
      "name": "Tham quan Thành Cổ",
      "url": "https://oj.vnoi.info/problem/ttrip",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_twist",
      "name": "Twist and whirl - want to cheat",
      "url": "https://oj.vnoi.info/problem/twist",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_two",
      "name": "Lập lịch trên 2 máy",
      "url": "https://oj.vnoi.info/problem/two",
      "judge": "VNOJ",
      "tags": [
        "ad_hoc"
      ]
    },
    {
      "code": "VNOJ_twoblack",
      "name": "Hai Ô Đen",
      "url": "https://oj.vnoi.info/problem/twoblack",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_twoopers",
      "name": "VM 08 Bài 21 - Xử lý xâu",
      "url": "https://oj.vnoi.info/problem/twoopers",
      "judge": "VNOJ",
      "tags": [
        "hash",
        "kmp",
        "z_func"
      ]
    },
    {
      "code": "VNOJ_tworeg",
      "name": "Hai phép gán",
      "url": "https://oj.vnoi.info/problem/tworeg",
      "judge": "VNOJ",
      "tags": [
        "number_theory"
      ]
    },
    {
      "code": "VNOJ_twosat",
      "name": "Du lịch",
      "url": "https://oj.vnoi.info/problem/twosat",
      "judge": "VNOJ",
      "tags": [
        "2sat"
      ]
    },
    {
      "code": "VNOJ_twoside",
      "name": "Bộ bài hai mặt",
      "url": "https://oj.vnoi.info/problem/twoside",
      "judge": "VNOJ",
      "tags": [
        "combination"
      ]
    },
    {
      "code": "VNOJ_twosum",
      "name": "Dãy 2-Sum",
      "url": "https://oj.vnoi.info/problem/twosum",
      "judge": "VNOJ",
      "tags": [
        "2_pointers"
      ]
    },
    {
      "code": "VNOJ_upgranet",
      "name": "VOI 11 Bài 6 - Nâng cấp mạng",
      "url": "https://oj.vnoi.info/problem/upgranet",
      "judge": "VNOJ",
      "tags": [
        "dsu"
      ]
    },
    {
      "code": "VNOJ_upit",
      "name": "Sequence queries",
      "url": "https://oj.vnoi.info/problem/upit",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_v11str",
      "name": "Tìm xâu",
      "url": "https://oj.vnoi.info/problem/v11str",
      "judge": "VNOJ",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "VNOJ_v8mayors",
      "name": "Thị trưởng",
      "url": "https://oj.vnoi.info/problem/v8mayors",
      "judge": "VNOJ",
      "tags": [
        "compress"
      ]
    },
    {
      "code": "VNOJ_v8org",
      "name": "Tổ chức đối lập",
      "url": "https://oj.vnoi.info/problem/v8org",
      "judge": "VNOJ",
      "tags": [
        "dp_on_tree"
      ]
    },
    {
      "code": "VNOJ_v8score",
      "name": "Chấm điểm",
      "url": "https://oj.vnoi.info/problem/v8score",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_v8sort",
      "name": "Sắp xếp",
      "url": "https://oj.vnoi.info/problem/v8sort",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_vbgrass",
      "name": "Bãi cỏ ngon nhất",
      "url": "https://oj.vnoi.info/problem/vbgrass",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_vblocks",
      "name": "VM 08 Bài 16 - Xếp hình",
      "url": "https://oj.vnoi.info/problem/vblocks",
      "judge": "VNOJ",
      "tags": [
        "segment_tree",
        "dp"
      ]
    },
    {
      "code": "VNOJ_vboard",
      "name": "VM 08 Bài 02 - Bàn cờ",
      "url": "https://oj.vnoi.info/problem/vboard",
      "judge": "VNOJ",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "VNOJ_vcoldwat",
      "name": "Nước lạnh",
      "url": "https://oj.vnoi.info/problem/vcoldwat",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_vcrisis",
      "name": "Thảm kịch ở nông trang",
      "url": "https://oj.vnoi.info/problem/vcrisis",
      "judge": "VNOJ",
      "tags": [
        "dijkstra"
      ]
    },
    {
      "code": "VNOJ_vdanger",
      "name": "Nguy hiểm rõ ràng trước mắt",
      "url": "https://oj.vnoi.info/problem/vdanger",
      "judge": "VNOJ",
      "tags": [
        "floyd"
      ]
    },
    {
      "code": "VNOJ_vector",
      "name": "Tổng vector",
      "url": "https://oj.vnoi.info/problem/vector",
      "judge": "VNOJ",
      "tags": [
        "meet-in-the-middle"
      ]
    },
    {
      "code": "VNOJ_vknights",
      "name": "Quân mã",
      "url": "https://oj.vnoi.info/problem/vknights",
      "judge": "VNOJ",
      "tags": [
        "dp_bitmask"
      ]
    },
    {
      "code": "VNOJ_vm3sets",
      "name": "VM 12 Bài 14 - Người yêu hòa bình",
      "url": "https://oj.vnoi.info/problem/vm3sets",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_vmatrix",
      "name": "VM 14 Bài 09 - Nhân ma trận",
      "url": "https://oj.vnoi.info/problem/vmatrix",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_vmempire",
      "name": "VM 13 Bài 01 - Trò chơi Empire",
      "url": "https://oj.vnoi.info/problem/vmempire",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_vmmtfive",
      "name": "VM 11 Bài 08 - Tổng trên ma trận!",
      "url": "https://oj.vnoi.info/problem/vmmtfive",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_vmmummy",
      "name": "VM 12 Bài 09 - Mummy Maze",
      "url": "https://oj.vnoi.info/problem/vmmummy",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_vmqtree",
      "name": "VM 12 Bài 15 - Mua nhà",
      "url": "https://oj.vnoi.info/problem/vmqtree",
      "judge": "VNOJ",
      "tags": [
        "lca"
      ]
    },
    {
      "code": "VNOJ_vmquabeo",
      "name": "VM 14 Bài 05 - Quá béo",
      "url": "https://oj.vnoi.info/problem/vmquabeo",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_vmsincos",
      "name": "VM 13 Bài 08 - Sin Cos Query",
      "url": "https://oj.vnoi.info/problem/vmsincos",
      "judge": "VNOJ",
      "tags": [
        "bbst"
      ]
    },
    {
      "code": "VNOJ_vmunch",
      "name": "Gặm cỏ",
      "url": "https://oj.vnoi.info/problem/vmunch",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_vmyt",
      "name": "VM 13 Bài 07 - Hành trình đến đảo dừa",
      "url": "https://oj.vnoi.info/problem/vmyt",
      "judge": "VNOJ",
      "tags": [
        "matrix_mul"
      ]
    },
    {
      "code": "VNOJ_vnempire",
      "name": "Đế chế",
      "url": "https://oj.vnoi.info/problem/vnempire",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    },
    {
      "code": "VNOJ_vningame",
      "name": "Trò chơi",
      "url": "https://oj.vnoi.info/problem/vningame",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_vobignum",
      "name": "VO 15 Bài 6 - Tính toán số lớn",
      "url": "https://oj.vnoi.info/problem/vobignum",
      "judge": "VNOJ",
      "tags": [
        "bignum"
      ]
    },
    {
      "code": "VNOJ_vocactus",
      "name": "VO 13 Bài 2 - Xương rồng",
      "url": "https://oj.vnoi.info/problem/vocactus",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_vodefend",
      "name": "VO 13 Bài 6 - Bảo vệ thành phố",
      "url": "https://oj.vnoi.info/problem/vodefend",
      "judge": "VNOJ",
      "tags": [
        "geometry"
      ]
    },
    {
      "code": "VNOJ_voexc",
      "name": "VO 12 Bài 6 - Trao đổi",
      "url": "https://oj.vnoi.info/problem/voexc",
      "judge": "VNOJ",
      "tags": [
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_voi18queue",
      "name": "VOI 18 Bài 2 - Dòng xe vào bến",
      "url": "https://oj.vnoi.info/problem/voi18queue",
      "judge": "VNOJ",
      "tags": [
        "stl",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_voi19_aspal",
      "name": "VOI 19 Bài 3 - Số siêu đối xứng",
      "url": "https://oj.vnoi.info/problem/voi19_aspal",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "dp_digit"
      ]
    },
    {
      "code": "VNOJ_voi20_building",
      "name": "VOI 20 Bài 5 - Tòa nhà",
      "url": "https://oj.vnoi.info/problem/voi20_building",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_voi20building",
      "name": "VOI 20 Bài 5 - Tòa nhà",
      "url": "https://oj.vnoi.info/problem/voi20building",
      "judge": "VNOJ",
      "tags": [
        "compress",
        "sweep_line"
      ]
    },
    {
      "code": "VNOJ_voi20bus",
      "name": "VOI 20 Bài 2 - Đi xe buýt",
      "url": "https://oj.vnoi.info/problem/voi20bus",
      "judge": "VNOJ",
      "tags": [
        "dsu_rollback"
      ]
    },
    {
      "code": "VNOJ_voi20light",
      "name": "VOI 20 Bài 4 - Giàn đèn",
      "url": "https://oj.vnoi.info/problem/voi20light",
      "judge": "VNOJ",
      "tags": [
        "prefix_sum"
      ]
    },
    {
      "code": "VNOJ_voi21_or",
      "name": "VOI 21 Bài 3 - Phép toán OR",
      "url": "https://oj.vnoi.info/problem/voi21_or",
      "judge": "VNOJ",
      "tags": [
        "dp",
        "dp-sos",
        "inclusion-exclusion"
      ]
    },
    {
      "code": "VNOJ_volis",
      "name": "VO 12 Bài 4 - Dãy con không giảm dài nhất",
      "url": "https://oj.vnoi.info/problem/volis",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_voscomps",
      "name": "Connected Components",
      "url": "https://oj.vnoi.info/problem/voscomps",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_vosmaxk",
      "name": "Lại là dãy số.",
      "url": "https://oj.vnoi.info/problem/vosmaxk",
      "judge": "VNOJ",
      "tags": []
    },
    {
      "code": "VNOJ_vosplay",
      "name": "Kết nối chơi game",
      "url": "https://oj.vnoi.info/problem/vosplay",
      "judge": "VNOJ",
      "tags": [
        "lca",
        "bin-search-parallel",
        "dsu"
      ]
    },
    {
      "code": "VNOJ_vostr",
      "name": "VO 13 Bài 4 - Xử lý xâu",
      "url": "https://oj.vnoi.info/problem/vostr",
      "judge": "VNOJ",
      "tags": [
        "hash"
      ]
    },
    {
      "code": "VNOJ_vovagame",
      "name": "Trò chơi của VOVA",
      "url": "https://oj.vnoi.info/problem/vovagame",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_voxor",
      "name": "VO 16 Bài 2 - XOR dãy số",
      "url": "https://oj.vnoi.info/problem/voxor",
      "judge": "VNOJ",
      "tags": [
        "trie",
        "dp_lexicographical"
      ]
    },
    {
      "code": "VNOJ_vpartsum",
      "name": "Tổng bộ phận",
      "url": "https://oj.vnoi.info/problem/vpartsum",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_vratf",
      "name": "Những con đường quanh nông trang",
      "url": "https://oj.vnoi.info/problem/vratf",
      "judge": "VNOJ",
      "tags": [
        "brute_force"
      ]
    },
    {
      "code": "VNOJ_vsteps",
      "name": "VM 08 Bài 01 - Bậc thang",
      "url": "https://oj.vnoi.info/problem/vsteps",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_vukvn",
      "name": "ICEFROG",
      "url": "https://oj.vnoi.info/problem/vukvn",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "binary_search"
      ]
    },
    {
      "code": "VNOJ_vwords",
      "name": "Tương đương hóa hai từ",
      "url": "https://oj.vnoi.info/problem/vwords",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs",
        "trie"
      ]
    },
    {
      "code": "VNOJ_weather",
      "name": "VM 10 Bài 01 - Điều kiện thời tiết",
      "url": "https://oj.vnoi.info/problem/weather",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_wifi",
      "name": "VM 08 Bài 27 - Phòng máy kỳ diệu",
      "url": "https://oj.vnoi.info/problem/wifi",
      "judge": "VNOJ",
      "tags": [
        "flow"
      ]
    },
    {
      "code": "VNOJ_winner",
      "name": "VM 09 Bài 09 - Ai thắng cuộc?",
      "url": "https://oj.vnoi.info/problem/winner",
      "judge": "VNOJ",
      "tags": [
        "Grundy"
      ]
    },
    {
      "code": "VNOJ_ws",
      "name": "Tách từ",
      "url": "https://oj.vnoi.info/problem/ws",
      "judge": "VNOJ",
      "tags": [
        "segment_tree"
      ]
    },
    {
      "code": "VNOJ_xoinc",
      "name": "A Coin Game",
      "url": "https://oj.vnoi.info/problem/xoinc",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_xucxac",
      "name": "Xúc xắc",
      "url": "https://oj.vnoi.info/problem/xucxac",
      "judge": "VNOJ",
      "tags": [
        "dfs_bfs"
      ]
    },
    {
      "code": "VNOJ_xyz",
      "name": "Đồ chơi XYZ",
      "url": "https://oj.vnoi.info/problem/xyz",
      "judge": "VNOJ",
      "tags": [
        "dp"
      ]
    },
    {
      "code": "VNOJ_yugi",
      "name": "Yugi-Oh",
      "url": "https://oj.vnoi.info/problem/yugi",
      "judge": "VNOJ",
      "tags": [
        "mst"
      ]
    }
  ]
}