Search the problemset by tag and difficulty

Frammenti di codice

curl "https://api.oanor.com/codeforces-api/v1/problems" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/codeforces-api/v1/problems", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/codeforces-api/v1/problems");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/codeforces-api/v1/problems",
    headers={"x-oanor-key": "oanor_test_..."}
)

Risposta di esempio

Una risposta reale di questo endpoint, acquisita dall'ultimo health check.

{
    "data": {
        "tags": [
            "dp"
        ],
        "count": 30,
        "total": 2486,
        "problems": [
            {
                "url": "https://codeforces.com/problemset/problem/2232/D",
                "name": "Magical Tiered Cake",
                "tags": [
                    "constructive algorithms",
                    "dfs and similar",
                    "dp",
                    "greedy"
                ],
                "index": "D",
                "rating": null,
                "contest_id": 2232
            },
            {
                "url": "https://codeforces.com/problemset/problem/2232/C1",
                "name": "Seating Arrangement (Easy Version)",
                "tags": [
                    "binary search",
                    "dp",
                    "greedy",
                    "two pointers"
                ],
                "index": "C1",
                "rating": null,
                "contest_id": 2232
            },
            {
                "url": "https://codeforces.com/problemset/problem/2231/E",
                "name": "Graph Cutting",
                "tags": [
                    "dfs and similar",
                    "dp",
                    "math",
                    "trees"
                ],
                "index": "E",
                "rating": 2300,
                "contest_id": 2231
            },
            {
                "url": "https://codeforces.com/problemset/problem/2230/F",
                "name": "Game on Growing Tree",
                "tags": [
                    "binary search",
                    "dfs and similar",
                    "divide and conquer",
                    "dp",
                    "games",
                    "implementation",
                    "trees"
                ],
                "index": "F",
                "rating": 2700,
                "contest_id": 2230
            },
            {
                "url": "https://codeforces.com/problemset/problem/2230/D",
                "name": "Good Schedule",
                "tags": [
                    "dp",
                    "greedy"
                ],
                "index": "D",
                "rating": 1700,
                "contest_id": 2230
            },
            {
                "url": "https://codeforces.com/problemset/problem/2229/I",
                "name": "The Endians",
                "tags": [
                    "dp",
                    "trees"
                ],
                "index": "I",
                "rating": 3400,
                "contest_id": 2229
            },
            {
                "url": "https://codeforces.com/problemset/problem/2229/H",
                "name": "Wowee Binary String",
                "tags": [
                    "combinatorics",
                    "dp",
                    "strings"
                ],
                "index": "H",
                "rating": 3200,
                "contest_id": 2229
       
…