{"id":19620951,"url":"https://github.com/secti6n/oj-solutions","last_synced_at":"2025-09-04T18:26:34.739Z","repository":{"id":82302374,"uuid":"141003388","full_name":"secti6n/oj-solutions","owner":"secti6n","description":null,"archived":false,"fork":false,"pushed_at":"2016-02-21T15:24:12.000Z","size":59,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-01-09T11:29:43.323Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"CSS","has_issues":false,"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/secti6n.png","metadata":{"files":{"readme":"README.rst","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}},"created_at":"2018-07-15T06:15:50.000Z","updated_at":"2018-07-15T06:15:52.000Z","dependencies_parsed_at":"2023-05-05T23:44:57.888Z","dependency_job_id":null,"html_url":"https://github.com/secti6n/oj-solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/secti6n%2Foj-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/secti6n%2Foj-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/secti6n%2Foj-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/secti6n%2Foj-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/secti6n","download_url":"https://codeload.github.com/secti6n/oj-solutions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240914875,"owners_count":19878056,"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":[],"created_at":"2024-11-11T11:20:42.887Z","updated_at":"2025-02-26T18:45:12.574Z","avatar_url":"https://github.com/secti6n.png","language":"CSS","funding_links":[],"categories":[],"sub_categories":[],"readme":"====================\nOnline Judge解题报告\n====================\n\n主要就是记录一下解题思路，以及证明的思路。假如题目很长，也会有一个简单的概述。不会有任何实际代码，代码随便搜就有了。\n\n除了解题报告以外，还有按\\ `主题 \u003ctopics/README.rst\u003e`_\\ 排列的知识点。\n\n======================= ============\nOnline Judge            解题报告\n======================= ============\n`Google Code Jam`__     `GCJ`__\n`PKU JudgeOnline`__     `POJ`__\n`Sphere online judge`__ `SPOJ`__\n`USACO Traning`__       `USACO`__\n`UVa Online Judge`__    `UVA`__\n======================= ============\n\n.. __: https://code.google.com/codejam/contests.html\n.. __: GCJ/README.rst\n.. __: http://poj.org/\n.. __: POJ/README.rst\n.. __: http://www.spoj.com/\n.. __: SPOJ/README.rst\n.. __: http://train.usaco.org/usacogate/\n.. __: USACO/README.rst\n.. __: https://uva.onlinejudge.org/\n.. __: UVA/README.rst\n\n\n================================= ==============\n习题集                            解题报告\n================================= ==============\n`Competitive Programming 3`__     `CP3`__\n`CS 97SI`__                       `CS97SI`__\n`POJ訓練計劃Moon修訂298道題`__    `MOON298`__\n================================= ==============\n\n.. __: https://uva.onlinejudge.org/index.php?option=com_onlinejudge\u0026Itemid=8\u0026category=604\n.. __: CP3/README.rst\n.. __: http://web.stanford.edu/class/cs97si/\n.. __: CS97SI.rst\n.. __: http://cs.cysh.cy.edu.tw/php_system/news/upload/POJ%E9%A1%8C%E7%9B%AE%E8%A8%93%E7%B7%B4%E8%A8%88%E5%8A%83.doc\n.. __: MOON298.rst\n\n\n要生成HTML，请在git clone后运行make。\n\n\n标签定义\n========\n\n========== =======================\ndp         Dynamic Programming\nmanacher   Manacher's Algorithm\nsuffix     Suffix Array\n========== =======================\n\n\n符号定义\n========\n\n解题报告中所使用的符号\n\n======================= ======================================\n:code:`NOT`             :math:`\\neg`\n:code:`FORALL`          :math:`\\forall`\n:code:`EXISTS`          :math:`\\exists`\n:code:`{}`              :math:`\\emptyset`\n:code:`\u003c-`              :math:`\\in`\n:code:`\u003c/-`             :math:`\\notin`\n:code:`=`               :math:`=`\n:code:`=/=`             :math:`\\neq`\n:code:`|x|`             :math:`|x|`\n:code:`\u003c`               :math:`\u003c`\\ ,\\ :math:`\\subset`\n:code:`=\u003c`              :math:`\\leq`\\ ,\\ :math:`\\subseteq`\n:code:`/\\ `             :math:`\\cap`\n:code:`\\/`              :math:`\\cup`\n:code:`\\ `              :math:`\\setminus`\n:code:`=\u003e`              implies\n:code:`\u003c=\u003e`             iff\n:code:`a**b`            :math:`a^b`\n:code:`{x FOR x \u003c- S}`  :math:`\\{x | x \\in S\\}`\n:code:`\u003c=`              assignment\n======================= ======================================\n\n\n类型定义\n========\n\n解题报告中所使用的类型\n\n整数\n----\n\n:code:`Integer()`\n\n\n集合\n----\n\n若元素类型为\\ :code:`X`\\ ，则集合类型为\\ :code:`Set(X)`\\ 。比如，元素类型为整数的集合为\\ :code:`Set(Integer())`\\ 。\n\n.. code::\n\n    1 \u003c- {1,2,3}\n    4 \u003c/- {1,2,3}\n    {1} \\/ {2} = {1,2}\n    {1,2} /\\ {2,3} = {2}\n    {1,2} \\ {2,3} = {1}\n    {1,2} = {1,2}\n    {1,2} =/= {1,2,3}\n    {} \u003c {1}\n    {1} \u003c {1,2}\n\n数组\n----\n\n若元素类型为\\ :code:`X`\\ ，则数组类型为\\ :code:`Array(X)`\\ 。比如，元素类型为整数的数组为\\ :code:`Array(Integer())`\\ 。\n\n从数组中取元素的符号与Python一致\n\n.. code::\n\n    [1,2,3] = [1,2,3]\n    [1,2,3] + [4] = [1,2,3,4]\n    ([1,2,3])[0] = 1\n    ([1,2,3])[:2] = [1,2]\n\n\n字符串\n------\n\n:code:`String() = Array(Integer())`\n\n字符串就是普通的整数数组\n\n\n函数定义\n========\n\n解题报告中所使用的函数\n\nmin\n---\n\n求参数中的最小值\n\n.. code::\n\n    min(1,2,3) = 1\n    min(2,3) = 2\n\n\nmax\n---\n\n求参数中的最大值\n\n.. code::\n\n    max(1,2,3) = 3\n    max(1,2) = 2\n\n\nrange\n-----\n\n类似Python中的range\n\n.. code::\n\n    range(1,4) = [1,2,3]\n\n\nsize\n----\n\n.. code::\n\n    size([1,1,1]) = 3\n    size({1,2,3}) = 3\n\n\nreduce\n------\n\n类似Python中的reduce\n\n.. code::\n\n    reduce(+, [1,1,1]) = 3\n    reduce(+, [1,2,3]) = 6\n\n\npowerset\n--------\n\n.. code::\n\n    powerset({1,2,3}) = {{},{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}\n    powerset([1,2,3]) = {[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]}\n    powerset([1,1,2]) = {[],[1,1],[1,2],[1,1,2]}\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsecti6n%2Foj-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsecti6n%2Foj-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsecti6n%2Foj-solutions/lists"}