{"id":17651332,"url":"https://github.com/nash403/m1s1_act_tp3","last_synced_at":"2025-03-30T09:12:49.343Z","repository":{"id":87358327,"uuid":"43437772","full_name":"nash403/M1S1_ACT_tp3","owner":"nash403","description":null,"archived":false,"fork":false,"pushed_at":"2015-11-01T14:19:48.000Z","size":346,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-05T11:17:03.676Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/nash403.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}},"created_at":"2015-09-30T14:28:51.000Z","updated_at":"2016-05-28T16:21:39.000Z","dependencies_parsed_at":"2023-03-13T18:55:01.689Z","dependency_job_id":null,"html_url":"https://github.com/nash403/M1S1_ACT_tp3","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/nash403%2FM1S1_ACT_tp3","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nash403%2FM1S1_ACT_tp3/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nash403%2FM1S1_ACT_tp3/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nash403%2FM1S1_ACT_tp3/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nash403","download_url":"https://codeload.github.com/nash403/M1S1_ACT_tp3/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246296615,"owners_count":20754635,"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-10-23T11:41:55.196Z","updated_at":"2025-03-30T09:12:49.322Z","avatar_url":"https://github.com/nash403.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TP3 Programmation dynamique\n## Antoine PETIT \u0026 Honoré NINTUNZE\n\n### Question 1\n\n\t\t      +3___\n         / \\   \\\n        /   \\   \\\n       +1   -2   \\\n       | \\  / \\  |\n       |  \\/   \\ |\n       |  +1    +1\n       |  |     /\n       |  |    /\n       |  |   /\n       |  |  /\n        \\ | /\n          0\n\n### Question 2\n\n* S'il existe au moins un successeur avec une valeur négative, prendre le successeur avec la plus grande valeur (On considère 0 comme un nombre négatif).\n* S'il n'y a aucun successeur avec une valeur négative, prendre le successeur avec la plus grande valeur.\n\n### Question 3\n\n(10,7,7,3) s'exécute en 15 secondes alors que (10,7,5,3) s'exécute en 31 secondes.\nLa compléxité est exponentielle car on calcule énormément de fois la même chose.\n\n### Question 4\n\n(100, 100, 50, 50) = -198\n(100, 100, 48, 52) =  191\n\n### Question 5\n\nPour m = n = 127 et une valeur de 127, les couples (i,j) correspondant sont:\n* (0,63)\n* (63,0)\n* (63,126)\n* (126,63)\n\n### Question 6\n\nEn considérent que m~n, on a une complexité en O(n^4)\n\n### Question 7\n\nOn peut remarquer que pour un (m,n) donné, on a 4 couples (i,j) qui auront des valeurs identiques:\n* (i,j)\n* (i,n-j-1)\n* (m-i-1,j)\n* (m-i-1,n-j-1)\n\n### Question 8\n\nOn constate effectivement une amélioration de l'ordre de + ou - 6 fois plus rapide.\n\n### Question 9\n\nL'amélioration est cette fois de l'ordre de + ou - 8 fois plus rapide que la version naive.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnash403%2Fm1s1_act_tp3","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnash403%2Fm1s1_act_tp3","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnash403%2Fm1s1_act_tp3/lists"}