{"schema_version":"0.1","resource":{"uid":"gh/dragonslayerx/Competitive-Programming-Repository","repory_url":"https://takemyrepo.com/gh/dragonslayerx/Competitive-Programming-Repository","source":"github","kind":"repo","source_id":"75975826","source_url":"https://github.com/dragonslayerx/Competitive-Programming-Repository","name":"Competitive-Programming-Repository","full_name":"dragonslayerx/Competitive-Programming-Repository","owner":{"login":"dragonslayerx","source_id":"6523069","url":"https://github.com/dragonslayerx","type":"user","avatar_url":"https://avatars.githubusercontent.com/u/6523069?v=4","on_repory":false},"description":"Competitive Programming templates that I used during the past few years.","homepage":null,"topics":["algorithms","algorithms-implemented","bellman-ford-algorithm","biginteger","bipartite-graphs","competitive-programming","data-structures","dijkstra","disjoint-sets","dynamic-programming","fft","floyd-warshall","graphs","hashing","lca","matching","matrix-exponentiation","recurrence","segment-tree","string"],"language":"C++","license":"MIT","license_note":"declared at the source","popularity":{"stars_or_likes":444,"forks":154,"downloads_30d":null},"task":null,"library":null,"gated":false,"archived":false,"image_url":null,"details":[{"k":"Open issues","v":"6","how":"Issues and pull requests open on GitHub"},{"k":"Watchers","v":"25","how":"People notified of every change on GitHub"},{"k":"Started","v":"2016-12","how":"Repository created on GitHub"},{"k":"Repository size","v":"150 KB","how":"Code and history, as counted by GitHub"},{"k":"Main branch","v":"master","how":"Where an agent clones from"},{"k":"On GitHub","v":"wiki, issues","how":"Switched on by the maintainer"}],"created_at":"2016-12-08T21:16:37+00:00","updated_at":"2020-09-30T18:54:46+00:00","synced_at":"2026-11-20T15:13:24.826769+00:00","from_snapshot":false},"install_plan_url":"https://takemyrepo.com/api/v1/install-plan?uid=gh%2Fdragonslayerx%2FCompetitive-Programming-Repository"}