{"id":19987246,"url":"https://github.com/chrkspln/discrete-math-calc","last_synced_at":"2026-06-06T18:32:19.455Z","repository":{"id":236854171,"uuid":"793283913","full_name":"chrkspln/discrete-math-calc","owner":"chrkspln","description":"Репозиторій для розрахункової роботи з курсу \"Дискретна математика\", 2 семестр","archived":false,"fork":false,"pushed_at":"2024-05-11T10:46:57.000Z","size":11,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-08T21:38:08.561Z","etag":null,"topics":["combinatorics","discrete-mathematics","python-3","university-assignment"],"latest_commit_sha":null,"homepage":"","language":"Python","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/chrkspln.png","metadata":{"files":{"readme":"README.md","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-04-28T23:00:09.000Z","updated_at":"2024-05-11T10:48:21.000Z","dependencies_parsed_at":"2024-11-13T04:35:01.401Z","dependency_job_id":"3f43a9b8-859f-4130-9503-cbc4849392c2","html_url":"https://github.com/chrkspln/discrete-math-calc","commit_stats":null,"previous_names":["chrkspln/discrete-math-calc"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/chrkspln/discrete-math-calc","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrkspln%2Fdiscrete-math-calc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrkspln%2Fdiscrete-math-calc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrkspln%2Fdiscrete-math-calc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrkspln%2Fdiscrete-math-calc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chrkspln","download_url":"https://codeload.github.com/chrkspln/discrete-math-calc/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chrkspln%2Fdiscrete-math-calc/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286079811,"owners_count":27282121,"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","status":"online","status_checked_at":"2025-11-25T02:00:05.816Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["combinatorics","discrete-mathematics","python-3","university-assignment"],"created_at":"2024-11-13T04:34:52.363Z","updated_at":"2025-11-25T18:04:59.486Z","avatar_url":"https://github.com/chrkspln.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"### Алгоритм 1.19 (ст. 51-52), Алгоритм 1.22 (ст. 57-58) за посібником «Комбінаторика для програмістів» (Липський В.)\n\nАлгоритм 1.19. (Генерирование всех разбиений множества {1, 2,...,n}).\nДанные: n.\nРезультат: Последовательность всех разбиений множества {1,...,n}, в которой\nкаждое следующее разбиение образуется из предыдущего путем перенесения единственного элемента в другой блок.\n```\n1. begin\n2. for i := 1 to n do (*поместить i в первый блок*)\n3. begin БЛОК[i] := 1; ВПЕР[i]:= истина;\n4. end;\n5. СЛЕД[1] := 0;\n6. выписать разбиение;\n7. j := n; (*j=активный элемент*)\n8. while j \u003e 1 do\n9. begin k := БЛОК[j];\n10. if ВПЕР[j] then (*j движется вперед*)\n11. begin\n12. if СЛЕД[k]=0 then (*k естьпоследний блок*)\n13. begin СЛЕД[k] := j; ПРЕД[j] := k; СЛЕД[j] := 0\n14. end;\n15. if СЛЕД[k] \u003e j then (*j образует новый блок*)\n16. begin ПРЕД[j] := k; СЛЕД[j] := СЛЕД[k];\n17. ПРЕД[СЛЕД[j]] := j; СЛЕД[k] := j\n18. end;\n19. БЛОК[j] := СЛЕД[k]\n20. end\n21. else (*j движется назад*)\n22. begin БЛОК[j] := ПРЕД[k];\n23. if k = j then (*j образует одноэлементный блок*)\n24. if СЛЕД[k]=0 then СЛЕД[ПРЕД[k]] := 0\n25. else begin СЛЕД[ПРЕД[k]] := СЛЕД[k];\n26. ПРЕД[СЛЕД[k]] := ПРЕД[k]\n27. end\n28. end;\n29. выписать разбиение;\n30. j := n;\n31. while (j \u003e 1) and\n32. ((ВПЕР[j] and (БЛОК[j] = j)) or (not ВПЕР[j] and (БЛОК[j]=1))) do\n33. begin ВПЕР[j]:=not ВПЕР[j]; j := j − 1;\n34. end\n35. end\n36. end\n```\n\n\nАлгоритм 1.22. (Нахождение всех разбиений числа)\nДанные: n.\nРезультат: последовательность разбиений числа n в порядке, обратном лексикографическому.\n```\n1. begin\n2. S[1] := n; R[1] := 1; n := 1; (*первое разбиение*)\n3. выписать разбиение;\n4. while S[1] \u003e 1 do (*нахождение следующего разбиения*)\n5. begin sum := 0; (*sum = сумма устраненных слагаемых*)\n6. if S[d]=1 then (*удаление слагаемых, равных единице*)\n7. begin sum := sum + R[d]; d := d − 1\n8. end;\n9. sum := sum + S[d]; R[d] := R[d] − 1; l := S[d] − 1;\n10. if R[d] \u003e 0 then d := d + 1;\n11. S[d] := l; R[d]:=sum div l;\n12. l:=sum mod l;\n13. if l \u003e= 0 then (*добавить последнее слагаемое, равное l*)\n14. begin d := d + l; S[d] := l; R[d] := 1\n15. end;\n16. выписать разбиение\n17. end\n18. end\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchrkspln%2Fdiscrete-math-calc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchrkspln%2Fdiscrete-math-calc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchrkspln%2Fdiscrete-math-calc/lists"}