{"id":19429668,"url":"https://github.com/janina280/proiectareaalgoritmilor","last_synced_at":"2025-08-16T22:33:37.732Z","repository":{"id":166160328,"uuid":"614090843","full_name":"janina280/ProiectareaAlgoritmilor","owner":"janina280","description":"The Refined Knapsack Problem  ","archived":false,"fork":false,"pushed_at":"2023-06-27T15:48:03.000Z","size":180,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-25T05:42:55.897Z","etag":null,"topics":["programming"],"latest_commit_sha":null,"homepage":"","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/janina280.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}},"created_at":"2023-03-14T21:49:23.000Z","updated_at":"2023-06-27T15:48:38.000Z","dependencies_parsed_at":"2024-02-22T08:45:00.398Z","dependency_job_id":null,"html_url":"https://github.com/janina280/ProiectareaAlgoritmilor","commit_stats":null,"previous_names":["janina280/proiectareaalgoritmilor"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/janina280/ProiectareaAlgoritmilor","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/janina280%2FProiectareaAlgoritmilor","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/janina280%2FProiectareaAlgoritmilor/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/janina280%2FProiectareaAlgoritmilor/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/janina280%2FProiectareaAlgoritmilor/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/janina280","download_url":"https://codeload.github.com/janina280/ProiectareaAlgoritmilor/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/janina280%2FProiectareaAlgoritmilor/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259493611,"owners_count":22866347,"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":["programming"],"created_at":"2024-11-10T14:20:37.477Z","updated_at":"2025-06-12T15:33:06.552Z","avatar_url":"https://github.com/janina280.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ProiectareaAlgoritmilor\nThe Refined Knapsack Problem\nLet's assume you are an investment agent with a capital C. There are n investment offers available for you to choose from. Each offer i has a certain number of shares available at a given price per share, which can bring an estimated profit of pi for each share purchased. Your task is to determine the investment that can yield the maximum estimated profit. Two different algorithms will be implemented to solve this problem.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjanina280%2Fproiectareaalgoritmilor","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjanina280%2Fproiectareaalgoritmilor","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjanina280%2Fproiectareaalgoritmilor/lists"}