{"id":19036399,"url":"https://github.com/huanhuanonly/codeforces","last_synced_at":"2025-04-13T15:01:47.464Z","repository":{"id":258982052,"uuid":"876011784","full_name":"huanhuanonly/Codeforces","owner":"huanhuanonly","description":"Some interesting problems I solved on competition platforms such as codeforces","archived":false,"fork":false,"pushed_at":"2025-01-13T04:01:03.000Z","size":155,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-27T05:51:14.787Z","etag":null,"topics":["acm-icpc","algorithms","atcoder","balanced-tree","bfs-dfs","codeforces","cpp","data-structures","divide-and-conquer","dynamic-programming","graph-algorithms","layered-graph","luogu","network-flow","nowcoder","persistent-data-structure","shortest-path","string-matching","templates","tree-structure"],"latest_commit_sha":null,"homepage":"https://codeforces.com/profile/huanhuanonly","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/huanhuanonly.png","metadata":{"files":{"readme":null,"changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-10-21T08:53:09.000Z","updated_at":"2025-01-13T04:01:08.000Z","dependencies_parsed_at":"2025-01-02T05:41:52.550Z","dependency_job_id":"dc66d682-9cd6-4965-a4b1-ce55038c5a79","html_url":"https://github.com/huanhuanonly/Codeforces","commit_stats":null,"previous_names":["huanhuanonly/codeforces"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huanhuanonly%2FCodeforces","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huanhuanonly%2FCodeforces/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huanhuanonly%2FCodeforces/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huanhuanonly%2FCodeforces/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/huanhuanonly","download_url":"https://codeload.github.com/huanhuanonly/Codeforces/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248732474,"owners_count":21152851,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm-icpc","algorithms","atcoder","balanced-tree","bfs-dfs","codeforces","cpp","data-structures","divide-and-conquer","dynamic-programming","graph-algorithms","layered-graph","luogu","network-flow","nowcoder","persistent-data-structure","shortest-path","string-matching","templates","tree-structure"],"created_at":"2024-11-08T21:54:22.327Z","updated_at":"2025-04-13T15:01:47.452Z","avatar_url":"https://github.com/huanhuanonly.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuanhuanonly%2Fcodeforces","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuanhuanonly%2Fcodeforces","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuanhuanonly%2Fcodeforces/lists"}