problems.json

{
    "problems": [
        {
            "judge": "cf",
            "name": "Duff in Mafia",
            "url": "https://codeforces.com/problemset/problem/587/D",
            "tags": [
                "2_sat"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Too Many Constraints",
            "url": "https://codeforces.com/problemset/problem/1697/F",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2800"
        },
        {
            "judge": "gym",
            "name": "Crossword Puzzle",
            "url": "https://codeforces.com/gym/103104/problem/G",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "المپیادی",
            "name": "تبعید",
            "url": "https://quera.org/problemset/18780/",
            "tags": [
                "2_sat"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "National Property",
            "url": "https://codeforces.com/contest/876/problem/E",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Ring Road 2",
            "url": "https://codeforces.com/problemset/problem/27/D",
            "tags": [
                "2_sat"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Catowice City",
            "url": "https://codeforces.com/contest/1239/problem/D",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Radio Stations",
            "url": "https://codeforces.com/problemset/problem/1215/F",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Words on Tree",
            "url": "https://codeforces.com/problemset/problem/1657/F",
            "tags": [
                "2_sat"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Ants",
            "url": "https://codeforces.com/problemset/problem/1007/D",
            "tags": [
                "2_sat",
                "fake_vertex"
            ],
            "difficulty": "3100"
        },
        {
            "judge": "cf",
            "name": "Graph Transpositions",
            "url": "https://codeforces.com/problemset/problem/1442/C",
            "tags": [
                "djikstra"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Mike and Fish",
            "url": "https://codeforces.com/problemset/problem/547/D",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Mashtali: a Space Oddysey",
            "url": "https://codeforces.com/problemset/problem/1610/F",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Points and Segments",
            "url": "https://codeforces.com/contest/429/problem/E",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Data Center Drama",
            "url": "https://codeforces.com/problemset/problem/527/E",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Johnny and Megan's Necklace",
            "url": "https://codeforces.com/contest/1361/problem/C",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "oj",
            "name": "Postmen",
            "url": "https://oj.uz/problem/view/BOI14_postmen",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Fair Share",
            "url": "https://codeforces.com/contest/1634/problem/E",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Tanya and Password",
            "url": "https://codeforces.com/problemset/problem/508/D",
            "tags": [
                "euler_tour"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "usaco",
            "name": "Fenced In",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=625",
            "tags": [
                "kruskal"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "المپیادی",
            "name": "مدکا",
            "url": "https://quera.org/problemset/2742/",
            "tags": [
                "matrix"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cses",
            "name": "Graph Paths I",
            "url": "https://cses.fi/problemset/task/1723",
            "tags": [
                "matrix"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "atcoder",
            "name": "Good Vertices",
            "url": "https://atcoder.jp/contests/abc236/tasks/abc236_g",
            "tags": [
                "matrix"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cses",
            "name": "Graph Paths II",
            "url": "https://cses.fi/problemset/task/1724",
            "tags": [
                "matrix"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "atcoder",
            "name": "Walk",
            "url": "https://atcoder.jp/contests/dp/tasks/dp_r",
            "tags": [
                "matrix"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "baekjoon",
            "name": "Reading",
            "url": "https://www.acmicpc.net/problem/7081",
            "tags": [
                "matrix"
            ],
            "difficulty": "2600"
        },
        {
            "judge": "cf",
            "name": "Little Pony and Elements of Harmony",
            "url": "https://codeforces.com/problemset/problem/453/D",
            "tags": [
                "matrix",
                "fwht"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Magic Gems",
            "url": "https://codeforces.com/contest/1117/problem/D",
            "tags": [
                "matrix"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "المپیادی",
            "name": "قورباغه ها",
            "url": "https://quera.org/problemset/2741/",
            "tags": [
                "matrix"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Stairs and Lines",
            "url": "https://codeforces.com/contest/498/problem/E",
            "tags": [
                "matrix"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Subsequences Return",
            "url": "https://codeforces.com/problemset/problem/497/E",
            "tags": [
                "matrix"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Once Again",
            "url": "https://codeforces.com/contest/582/problem/B",
            "tags": [
                "matrix"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Wet Shark and Blocks",
            "url": "https://codeforces.com/contest/621/problem/E",
            "tags": [
                "matrix"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Flight for Regular Customers",
            "url": "https://codeforces.com/contest/576/problem/D",
            "tags": [
                "matrix"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "gym",
            "name": "Long Grid Covering",
            "url": "https://codeforces.com/gym/103098/problem/L",
            "tags": [
                "matrix"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Axel and Marston in Bitland",
            "url": "https://codeforces.com/contest/780/problem/F",
            "tags": [
                "matrix"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "shaazzz",
            "name": "لبوی خسته",
            "url": "https://quera.org/course/assignments/48772/problems",
            "tags": [
                "matrix"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "sgu",
            "name": "Inversions",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/180",
            "tags": [
                "divide",
                "fenwick",
                "sort"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Enemy Is Weak",
            "url": "https://codeforces.com/problemset/problem/61/E",
            "tags": [
                "divide",
                "fenwick",
                "sort"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Subsequence",
            "url": "https://codeforces.com/contest/1580/problem/D",
            "tags": [
                "divide"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Closest Point Pair",
            "url": "https://www.spoj.com/problems/CLOPPAIR/",
            "tags": [
                "divide"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Swap and Maximum Block",
            "url": "https://codeforces.com/contest/1716/problem/E",
            "tags": [
                "divide"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Meta Universe",
            "url": "https://codeforces.com/contest/475/problem/F",
            "tags": [
                "divide",
                "dsu"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Yet Another Array Counting Problem",
            "url": "https://codeforces.com/contest/1748/problem/E",
            "tags": [
                "divide"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Superset",
            "url": "https://codeforces.com/problemset/problem/97/B",
            "tags": [
                "divide"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Pashmak and Parmida's problem",
            "url": "https://codeforces.com/problemset/problem/459/D",
            "tags": [
                "divide",
                "fenwick"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "cf",
            "name": "Subsequence",
            "url": "https://codeforces.com/contest/597/problem/C",
            "tags": [
                "divide",
                "fenwick"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "codechef",
            "name": "Best Path",
            "url": "https://www.codechef.com/problems/BESTPATH?tab=statement",
            "tags": [
                "bellman"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Bracket Query",
            "url": "https://codeforces.com/gym/103931/problem/B",
            "tags": [
                "bellman"
            ],
            "difficulty": "2800"
        },
        {
            "judge": "oj",
            "name": "Merchant",
            "url": "https://oj.uz/problem/view/APIO17_merchant",
            "tags": [
                "bellman"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Greedy Path",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/236",
            "tags": [
                "bellman"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "spoj",
            "name": "NEGCYC",
            "url": "https://www.spoj.com/problems/NEGCYC/",
            "tags": [
                "bellman"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Flights",
            "url": "https://codeforces.com/problemset/problem/241/E",
            "tags": [
                "bellman"
            ],
            "difficulty": "2600"
        },
        {
            "judge": "quera",
            "name": "رشته‌ی خیلی بزرگ",
            "url": "https://quera.org/problemset/80649/",
            "tags": [
                "bellman",
                "aho"
            ],
            "difficulty": "2800"
        },
        {
            "judge": "sharecode",
            "name": "Fruit Weights",
            "url": "http://sharecode.io/section/problemset/problem/2730",
            "tags": [
                "bellman"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Meeting Her",
            "url": "https://codeforces.com/problemset/problem/238/E",
            "tags": [
                "bellman"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cf",
            "name": "Capitalism",
            "url": "https://codeforces.com/problemset/problem/1450/E",
            "tags": [
                "floyd"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Ela and the Wiring Wizard",
            "url": "https://codeforces.com/problemset/problem/1737/D",
            "tags": [
                "floyd"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Algorace",
            "url": "https://codeforces.com/problemset/problem/187/B",
            "tags": [
                "floyd"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Useful Edges",
            "url": "https://codeforces.com/contest/1482/problem/F",
            "tags": [
                "floyd"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Roads In Berland",
            "url": "https://codeforces.com/problemset/problem/25/C",
            "tags": [
                "floyd"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Greg and Graph",
            "url": "https://codeforces.com/problemset/problem/296/D/",
            "tags": [
                "floyd"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "atcoder",
            "name": "Edge Deletion",
            "url": "https://atcoder.jp/contests/abc243/tasks/abc243_e",
            "tags": [
                "floyd"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "quera",
            "name": "نوشابه خنک",
            "url": "https://quera.org/problemset/62460/",
            "tags": [
                "pbs"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "atcoder",
            "name": "Stamp Rally",
            "url": "https://atcoder.jp/contests/agc002/tasks/agc002_d",
            "tags": [
                "pbs",
                "dsu_tree",
                "dsu_history"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "szkopul",
            "name": "Meteors",
            "url": "https://szkopul.edu.pl/problemset/problem/7JrCYZ7LhEK4nBR5zbAXpcmM/site/?key=statement",
            "tags": [
                "pbs"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Odd Mineral Resource",
            "url": "https://codeforces.com/contest/1479/problem/D",
            "tags": [
                "pbs",
                "sweep_line",
                "mo"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Ice Skating",
            "url": "https://codeforces.com/problemset/problem/217/A",
            "tags": [
                "dfs"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "atcoder",
            "name": "Construct Highway",
            "url": "https://atcoder.jp/contests/abc239/tasks/abc239_f",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Graph Without Long Directed Paths",
            "url": "https://codeforces.com/contest/1144/problem/F",
            "tags": [
                "dfs"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "cf",
            "name": "Wizard's Tour",
            "url": "https://codeforces.com/problemset/problem/858/F",
            "tags": [
                "dfs"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Book of Evil",
            "url": "https://codeforces.com/contest/337/problem/d",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Guard Towers",
            "url": "https://codeforces.com/problemset/problem/85/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2600"
        },
        {
            "judge": "cf",
            "name": "Little Pony and Summer Sun Celebration",
            "url": "https://codeforces.com/problemset/problem/453/C",
            "tags": [
                "dfs"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Super M",
            "url": "https://codeforces.com/contest/592/problem/d",
            "tags": [
                "dfs"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Mahmoud and a xor trip",
            "url": "https://codeforces.com/problemset/problem/766/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Ant on the Tree",
            "url": "https://codeforces.com/problemset/problem/29/D?locale=en",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "atcoder",
            "name": "Subtree K-th Max",
            "url": "https://atcoder.jp/contests/abc239/tasks/abc239_e",
            "tags": [
                "dfs"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Johnny Solving",
            "url": "https://codeforces.com/problemset/problem/1103/C",
            "tags": [
                "dfs"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Number of Simple Paths",
            "url": "https://codeforces.com/contest/1454/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Blood Cousins",
            "url": "https://codeforces.com/problemset/problem/208/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Blood Cousins Return",
            "url": "https://codeforces.com/problemset/problem/246/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Cycling Coloring",
            "url": "https://codeforces.com/problemset/problem/183/C",
            "tags": [
                "dfs"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Leha and another game about graph",
            "url": "https://codeforces.com/contest/841/problem/D",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Bertown roads",
            "url": "https://codeforces.com/contest/118/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "sgu",
            "name": "Computer Network",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/149",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "usaco",
            "name": "Wormhole Sort",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=992v",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "sgu",
            "name": "Challenging Tic-Tac-Toe",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/289",
            "tags": [
                "dfs"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "AquaMoon and Permutations",
            "url": "https://codeforces.com/contest/1545/problem/C",
            "tags": [
                "dfs"
            ],
            "difficulty": "2800"
        },
        {
            "judge": "oj",
            "name": "T-covering",
            "url": "https://oj.uz/problem/view/eJOI19_covering",
            "tags": [
                "dfs"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Graph",
            "url": "https://codeforces.com/contest/1387/problem/A",
            "tags": [
                "dfs"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Fairy",
            "url": "https://codeforces.com/contest/19/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Graph Cutting",
            "url": "https://codeforces.com/contest/405/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Road Problem",
            "url": "https://codeforces.com/contest/45/problem/h",
            "tags": [
                "dfs"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "usaco",
            "name": "Where's Bessie?",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=740",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Pursuit for artifacts",
            "url": "https://codeforces.com/contest/652/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "المپیادی",
            "name": "کپی پیست",
            "url": "https://quera.org/problemset/3017/",
            "tags": [
                "dfs"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Minimal Diameter Forest",
            "url": "https://codeforces.com/contest/1092/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "oj",
            "name": "Prison",
            "url": "https://oj.uz/problem/view/BOI21_prison",
            "tags": [
                "dfs",
                "dsu"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Vasya and a tree",
            "url": "https://codeforces.com/contest/1076/problem/E",
            "tags": [
                "dfs"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "usaco",
            "name": "Milk Visits",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=968",
            "tags": [
                "dfs"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Tourists",
            "url": "https://codeforces.com/problemset/problem/487/E",
            "tags": [
                "hld",
                "block_tree"
            ],
            "difficulty": "3400"
        },
        {
            "judge": "cf",
            "name": "Cycling City",
            "url": "https://codeforces.com/problemset/problem/521/E",
            "tags": [
                "block_tree"
            ],
            "difficulty": "2600"
        },
        {
            "judge": "oj",
            "name": "Jail",
            "url": "https://oj.uz/problem/submit/JOI22_jail",
            "tags": [
                "lca",
                "fake_vertex",
                "topol_sort"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Cycle",
            "url": "https://codeforces.com/contest/117/problem/c",
            "tags": [
                "digraph"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cses",
            "name": "Game Routes",
            "url": "https://cses.fi/problemset/task/1681",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Giving Award",
            "url": "https://codeforces.com/contest/412/problem/D",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Fox And Names",
            "url": "https://codeforces.com/problemset/problem/510/C",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "المپیادی",
            "name": "توپولو‌های به هم چسبیده",
            "url": "https://quera.org/problemset/9857/",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Plan of lectures",
            "url": "https://codeforces.com/contest/1463/problem/E",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Unordered Swaps",
            "url": "https://codeforces.com/contest/1682/problem/E",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2600"
        },
        {
            "judge": "cf",
            "name": "Upgrading Cities",
            "url": "https://codeforces.com/problemset/problem/1062/F",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Count Seconds",
            "url": "https://codeforces.com/contest/1704/problem/E",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Mr. Kitayuta's Technology",
            "url": "https://codeforces.com/contest/505/problem/D",
            "tags": [
                "digraph"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cses",
            "name": "Flight Routes Check ",
            "url": "https://cses.fi/problemset/task/1682",
            "tags": [
                "digraph"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cses",
            "name": "Longest Flight Route",
            "url": "https://cses.fi/problemset/task/1680",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "المپیادی",
            "name": "غازززلند",
            "url": "https://quera.org/problemset/107493/",
            "tags": [
                "random_algorithm",
                "adhoc"
            ],
            "difficulty": "3300"
        },
        {
            "judge": "cses",
            "name": "Course Schedule II",
            "url": "https://cses.fi/problemset/task/1757",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "shaazzz",
            "name": "Course Schedule",
            "url": "https://quera.org/course/assignments/48772/problems/164976",
            "tags": [
                "topol_sort"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Petr and a Combination Lock",
            "url": "https://codeforces.com/contest/1097/problem/B",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cf",
            "name": "Preparing Olympiad",
            "url": "https://codeforces.com/contest/550/problem/B",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1400"
        },
        {
            "judge": "cf",
            "name": "Xor Guessing",
            "url": "https://codeforces.com/problemset/problem/1207/E",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Bitwise Queries (Hard Version)",
            "url": "https://codeforces.com/problemset/problem/1451/E2",
            "tags": [
                "bitmask"
            ],
            "difficulty": "2300"
        },
        {
            "judge": "cf",
            "name": "Fedor and new game",
            "url": "https://codeforces.com/problemset/problem/467/B",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1100"
        },
        {
            "judge": "cf",
            "name": "New Year's Eve",
            "url": "https://codeforces.com/problemset/problem/912/B",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1300"
        },
        {
            "judge": "cf",
            "name": "Anton and School",
            "url": "https://codeforces.com/contest/734/problem/f",
            "tags": [
                "bitmask"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cf",
            "name": "AND, OR and square sum",
            "url": "https://codeforces.com/contest/1368/problem/D",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Apollo versus Pan",
            "url": "https://codeforces.com/contest/1466/problem/E",
            "tags": [
                "bitmask"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "sgu",
            "name": "a + b",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/100",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "sgu",
            "name": "a^b - b^a",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/112",
            "tags": [
                "implementation"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "projecteuler",
            "name": "Factorial digit sum",
            "url": "https://projecteuler.net/problem=20",
            "tags": [
                "implementation"
            ],
            "difficulty": "1300"
        },
        {
            "judge": "quera",
            "name": "فاکتوریل",
            "url": "https://quera.org/problemset/589/",
            "tags": [
                "implementation",
                "recursive"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "اعداد فیثاغورثی",
            "url": "https://quera.org/problemset/9774/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "cf",
            "name": "Distinc Digits",
            "url": "https://codeforces.com/contest/1228/problem/A",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "مثلث خیام پاسکال",
            "url": "https://quera.org/problemset/3410/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "توان ۲",
            "url": "https://quera.org/problemset/616/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "چاپ لوزی",
            "url": "https://quera.org/problemset/618/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "عدد خود مغلوب",
            "url": "https://quera.org/problemset/617/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "لوزی های ستاره ای",
            "url": "https://quera.org/problemset/9773/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "تک رقمی",
            "url": "https://quera.org/problemset/3539/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "مبنا",
            "url": "https://quera.org/problemset/594/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "مسابقه پیاده سازی کوئرا(همه سوالات)",
            "url": "https://quera.org/contest/assignments/42708/problems/",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "quera",
            "name": "مسابقه پیاده سازی کوئرا(همه سوالات)",
            "url": "https://quera.org/contest/assignments/35049/problems",
            "tags": [
                "implementation"
            ],
            "difficulty": "800"
        },
        {
            "judge": "sgu",
            "name": "Spam Filter",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/274",
            "tags": [
                "implementation"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "projecteuler",
            "name": "Lexicographic permutations",
            "url": "https://projecteuler.net/problem=24",
            "tags": [
                "implementation"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "sgu",
            "name": "The Towers of Hanoi Revisited",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/202",
            "tags": [
                "recursive"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "sgu",
            "name": "Little Queens",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/224",
            "tags": [
                "recursive"
            ],
            "difficulty": "1300"
        },
        {
            "judge": "cf",
            "name": "Xor",
            "url": "https://codeforces.com/problemset/problem/194/D",
            "tags": [
                "recursive"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "leetcode",
            "name": "Next Permutation",
            "url": "https://leetcode.com/problems/next-permutation/",
            "tags": [
                "recursive"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "quera",
            "name": "کاشی‌کاری ",
            "url": "https://quera.org/problemset/605/",
            "tags": [
                "recursive"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "shaazzz",
            "name": "بی‌ فاصله",
            "url": "https://quera.org/course/assignments/48772/problems/166206",
            "tags": [
                "recursive"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "shaazzz",
            "name": "پریش",
            "url": "https://quera.org/course/assignments/48772/problems/166207",
            "tags": [
                "recursive"
            ],
            "difficulty": "900"
        },
        {
            "judge": "shaazzz",
            "name": "جم‌زی",
            "url": "https://quera.org/course/assignments/48772/problems/166208",
            "tags": [
                "recursive"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "shaazzz",
            "name": "الگویابی",
            "url": "https://quera.org/course/assignments/48772/problems/166209",
            "tags": [
                "recursive"
            ],
            "difficulty": "800"
        },
        {
            "judge": "shaazzz",
            "name": "اول‌دایره",
            "url": "https://quera.org/course/assignments/48772/problems/166211",
            "tags": [
                "recursive"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "shaazzz",
            "name": "شتر",
            "url": "https://quera.org/course/assignments/48772/problems/166212",
            "tags": [
                "recursive"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "projecteuler",
            "name": "1000-digit Fibonacci number",
            "url": "https://projecteuler.net/problem=25",
            "tags": [
                "recursive",
                "implementation"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "cf",
            "name": "Keep Xor Low",
            "url": "https://codeforces.com/problemset/problem/1616/H",
            "tags": [
                "divide"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "leetcode",
            "name": "Combinations",
            "url": "https://leetcode.com/problems/combinations/",
            "tags": [
                "recursive",
                "combinatorics"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "leetcode",
            "name": "Permutations",
            "url": "https://leetcode.com/problems/permutations/",
            "tags": [
                "recursive"
            ],
            "difficulty": "900"
        },
        {
            "judge": "leetcode",
            "name": "Generate Parentheses",
            "url": "https://leetcode.com/problems/generate-parentheses/",
            "tags": [
                "recursive"
            ],
            "difficulty": "900"
        },
        {
            "judge": "spoj",
            "name": "Easy modified sudoku",
            "url": "https://www.spoj.com/problems/EZSUDOKU/",
            "tags": [
                "recursive"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cf",
            "name": "Mafia",
            "url": "https://codeforces.com/problemset/problem/348/A",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Renting bikes",
            "url": "https://codeforces.com/problemset/problem/363/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "sgu",
            "name": "Elevator",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/379",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "cf",
            "name": "Multiplication Table",
            "url": "https://codeforces.com/problemset/problem/448/D/",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "cf",
            "name": "Hamburgers",
            "url": "https://codeforces.com/problemset/problem/371/C",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "GukiZ hates boxes",
            "url": "https://codeforces.com/problemset/problem/551/C",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Characteristics of Rectangles",
            "url": "https://codeforces.com/problemset/problem/333/D",
            "tags": [
                "binary_search",
                "bitset"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Read Time",
            "url": "https://codeforces.com/problemset/problem/343/C",
            "tags": [
                "binary_search",
                "two_pointers"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "String game",
            "url": "https://codeforces.com/problemset/problem/778/A",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Number Game",
            "url": "https://codeforces.com/problemset/problem/1749/C",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "1400"
        },
        {
            "judge": "oj",
            "name": "Guess The Number",
            "url": "https://oj.uz/problem/view/BOI20_guess",
            "tags": [
                "binary_search"
            ],
            "difficulty": "800"
        },
        {
            "judge": "cf",
            "name": "Professor GukiZ and Two Arrays",
            "url": "https://codeforces.com/problemset/problem/620/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "atcoder",
            "name": "Median pyramid hard",
            "url": "https://atcoder.jp/contests/agc006/tasks/agc006_d",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cf",
            "name": "Castle Defense",
            "url": "https://codeforces.com/problemset/problem/954/G",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Multiplication Table",
            "url": "https://codeforces.com/problemset/problem/448/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "cf",
            "name": "Minimizing Difference",
            "url": "https://codeforces.com/problemset/problem/1244/E",
            "tags": [
                "binary_search",
                "two_pointers",
                "greedy"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Degenerate Matrix",
            "url": "https://codeforces.com/problemset/problem/549/H",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Memory for Arrays",
            "url": "https://codeforces.com/problemset/problem/309/C",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Guess The String",
            "url": "https://codeforces.com/problemset/problem/1697/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Fixed Point Guessing",
            "url": "https://codeforces.com/problemset/problem/1698/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "cf",
            "name": "Searching Local Minimum",
            "url": "https://codeforces.com/problemset/problem/1479/A",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Magic Powder 2",
            "url": "https://codeforces.com/problemset/problem/670/D2",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "cf",
            "name": "Tree Infectoin",
            "url": "https://codeforces.com/contest/1665/problem/C",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Vasya and String",
            "url": "https://codeforces.com/contest/676/problem/C",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "cf",
            "name": "Guess The Maximums",
            "url": "https://codeforces.com/problemset/problem/1363/D",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "Interacdive Problem",
            "url": "https://codeforces.com/problemset/problem/1624/F",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "oj",
            "name": "Worm Worries - sub 1 - 2",
            "url": "https://oj.uz/problem/view/BOI18_worm",
            "tags": [
                "binary_search",
                "golden_ratio"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "oj",
            "name": "Worm Worries - sub 3 - 4",
            "url": "https://oj.uz/problem/view/BOI18_worm",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "cf",
            "name": "Increasing by Modulo",
            "url": "https://codeforces.com/problemset/problem/1169/C",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "oj",
            "name": "Worm Worries - sub 5 - 6",
            "url": "https://oj.uz/problem/view/BOI18_worm",
            "tags": [
                "random_algorithm"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cf",
            "name": "Keshi Is Throwing a Party",
            "url": "https://codeforces.com/problemset/problem/1610/C",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Joking (Easy Version)",
            "url": "https://codeforces.com/contest/1746/problem/E1",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cf",
            "name": "Weakness and Poorness",
            "url": "https://codeforces.com/problemset/problem/578/C",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Gluttony",
            "url": "https://codeforces.com/problemset/problem/892/D",
            "tags": [
                "sort"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "cf",
            "name": "Subsequence Permutation",
            "url": "https://codeforces.com/problemset/problem/1552/A",
            "tags": [
                "sort"
            ],
            "difficulty": "800"
        },
        {
            "judge": "usaco",
            "name": "out of sorts",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=834",
            "tags": [
                "sort"
            ],
            "difficulty": "1400"
        },
        {
            "judge": "cf",
            "name": "Restorer Distance",
            "url": "https://codeforces.com/problemset/problem/1355/E",
            "tags": [
                "binary_search"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "spoj",
            "name": "Merge Sort",
            "url": "https://www.spoj.com/problems/MERGSORT/",
            "tags": [
                "sort"
            ],
            "difficulty": "800"
        },
        {
            "judge": "usaco",
            "name": "Cow Photography",
            "url": "http://www.usaco.org/index.php?page=viewproblem2&cpid=100",
            "tags": [
                "sort"
            ],
            "difficulty": "2500"
        },
        {
            "judge": "cses",
            "name": "Distinct Numbers",
            "url": "https://cses.fi/problemset/task/1621",
            "tags": [
                "sort"
            ],
            "difficulty": "900"
        },
        {
            "judge": "cses",
            "name": "Subarray Sums II",
            "url": "https://cses.fi/problemset/task/1661",
            "tags": [
                "prefix_sum",
                "sort"
            ],
            "difficulty": "1100"
        },
        {
            "judge": "cses",
            "name": "Prefix Sum Queries",
            "url": "https://cses.fi/problemset/task/2166",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "800"
        },
        {
            "judge": "cf",
            "name": "Ilya and Queries",
            "url": "https://codeforces.com/problemset/problem/313/B",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "1100"
        },
        {
            "judge": "cf",
            "name": "Star sky",
            "url": "https://codeforces.com/contest/835/problem/C",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Boboniu Chats with Du",
            "url": "https://codeforces.com/contest/1394/problem/A",
            "tags": [
                "prefix_sum",
                "tow_pointers"
            ],
            "difficulty": "1800"
        },
        {
            "judge": "shaazzz",
            "name": "ایکسور خفن",
            "url": "https://quera.org/course/assignments/48772/problems/168588",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "800"
        },
        {
            "judge": "cses",
            "name": "Forest Queries",
            "url": "https://cses.fi/problemset/task/1652",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "1100"
        },
        {
            "judge": "cses",
            "name": "Max Subarray Sum",
            "url": "https://cses.fi/problemset/task/1643",
            "tags": [
                "prefix_sum"
            ],
            "difficulty": "900"
        },
        {
            "judge": "cf",
            "name": "Born this way",
            "url": "https://codeforces.com/problemset/problem/1148/B",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cses",
            "name": "Sum of Three Values",
            "url": "https://cses.fi/problemset/task/1641",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "800"
        },
        {
            "judge": "cf",
            "name": "A Tale of Two Lands",
            "url": "https://codeforces.com/problemset/problem/1166/C",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cf",
            "name": "Mysterious Crime",
            "url": "https://codeforces.com/problemset/problem/1043/D",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "cf",
            "name": "Same Count One",
            "url": "https://codeforces.com/problemset/problem/1774/D",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Remove the Substring (hard version)",
            "url": "https://codeforces.com/problemset/problem/1203/D2",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "cf",
            "name": "Binary String",
            "url": "https://codeforces.com/problemset/problem/1680/C",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Xenia and Colorful Gems",
            "url": "https://codeforces.com/problemset/problem/1336/B",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1700"
        },
        {
            "judge": "shaazzz",
            "name": "رژیم جسی",
            "url": "https://quera.org/course/assignments/48772/problems/168589",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "cf",
            "name": "Double Knapsack",
            "url": "https://codeforces.com/problemset/problem/618/F",
            "tags": [
                "two_pointers",
                "prefix_sum"
            ],
            "difficulty": "3000"
        },
        {
            "judge": "cf",
            "name": "Knapsack",
            "url": "https://codeforces.com/contest/1447/problem/C",
            "tags": [
                "greedy"
            ],
            "difficulty": "1300"
        },
        {
            "judge": "shaazzz",
            "name": "فاصله گذاری اجتماعی",
            "url": "https://quera.org/course/assignments/48772/problems/168592",
            "tags": [
                "binary_search"
            ],
            "difficulty": "1300"
        },
        {
            "judge": "cf",
            "name": "Spanning Tree Queries",
            "url": "https://codeforces.com/contest/1633/problem/E",
            "tags": [
                "mst"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Longest k-Good Segment",
            "url": "https://codeforces.com/problemset/problem/616/D",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "I Might Be Wrong",
            "url": "https://codeforces.com/problemset/problem/1693/F",
            "tags": [
                "two_pointers"
            ],
            "difficulty": "3400"
        },
        {
            "judge": "cf",
            "name": "Equal Frequencies",
            "url": "https://codeforces.com/contest/1782/problem/C",
            "tags": [
                "greedy"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "MinOr Tree",
            "url": "https://codeforces.com/contest/1624/problem/G",
            "tags": [
                "dfs"
            ],
            "difficulty": "1900"
        },
        {
            "judge": "cf",
            "name": "Shop",
            "url": "https://codeforces.com/problemset/problem/521/D",
            "tags": [
                "greedy"
            ],
            "difficulty": "2800"
        },
        {
            "judge": "cf",
            "name": "Matching vs Independent Set",
            "url": "https://codeforces.com/problemset/problem/1198/C",
            "tags": [
                "greedy"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "atcoder",
            "name": "Project Planning",
            "url": "https://atcoder.jp/contests/abc227/tasks/abc227_d",
            "tags": [
                "binary_search",
                "greedy"
            ],
            "difficulty": "2000"
        },
        {
            "judge": "sgu",
            "name": "Printed PR",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/259",
            "tags": [
                "greedy"
            ],
            "difficulty": "1000"
        },
        {
            "judge": "sgu",
            "name": "Basketball",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/165",
            "tags": [
                "greedy"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "Zero Array",
            "url": "https://codeforces.com/problemset/problem/1201/B",
            "tags": [
                "greedy"
            ],
            "difficulty": "1500"
        },
        {
            "judge": "atcoder",
            "name": "Taking The Middle",
            "url": "https://atcoder.jp/contests/agc053/tasks/agc053_b",
            "tags": [
                "greedy"
            ],
            "difficulty": "2700"
        },
        {
            "judge": "sgu",
            "name": "Telecasting station",
            "url": "https://codeforces.com/problemsets/acmsguru/problem/99999/114",
            "tags": [
                "greedy"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cf",
            "name": "Two Arrays and Sum of Functions",
            "url": "https://codeforces.com/problemset/problem/1165/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "1600"
        },
        {
            "judge": "cf",
            "name": "New Game Plus!",
            "url": "https://codeforces.com/contest/1456/problem/C",
            "tags": [
                "greedy"
            ],
            "difficulty": "2200"
        },
        {
            "judge": "cf",
            "name": "Great Sequence",
            "url": "https://codeforces.com/contest/1641/problem/A",
            "tags": [
                "greedy"
            ],
            "difficulty": "1200"
        },
        {
            "judge": "cf",
            "name": "Candy Shop",
            "url": "https://codeforces.com/problemset/problem/183/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "2900"
        },
        {
            "judge": "cf",
            "name": "Outermost Maximums",
            "url": "https://codeforces.com/problemset/problem/1693/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "3400"
        },
        {
            "judge": "cf",
            "name": "Coins",
            "url": "https://atcoder.jp/contests/agc018/tasks/agc018_c",
            "tags": [
                "greedy"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Minimax",
            "url": "https://codeforces.com/contest/1530/problem/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "The Human Equation",
            "url": "https://codeforces.com/problemset/problem/1775/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "DeadLee",
            "url": "https://codeforces.com/contest/1369/problem/E",
            "tags": [
                "greedy"
            ],
            "difficulty": "2400"
        },
        {
            "judge": "cf",
            "name": "Pokémon Army (hard version)",
            "url": "https://codeforces.com/contest/1420/problem/C2",
            "tags": [
                "greedy",
                "dp",
                "segment"
            ],
            "difficulty": "2100"
        },
        {
            "judge": "cf",
            "name": "secrets",
            "url": "https://codeforces.com/problemset/problem/333/A",
            "tags": [
                "greedy"
            ],
            "difficulty": "1600"
        }
    ]
}