{"id":17982316,"url":"https://github.com/pierrechevalier83/euler","last_synced_at":"2025-04-04T01:47:26.611Z","repository":{"id":82227195,"uuid":"106353710","full_name":"pierrechevalier83/euler","owner":"pierrechevalier83","description":"Project Euler (my solutions with C++17 and range-v3)","archived":false,"fork":false,"pushed_at":"2017-10-22T13:02:07.000Z","size":15,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-09T13:29:34.128Z","etag":null,"topics":["euler-solutions","eulerproject","moderncpp","ranges","ranges-v3"],"latest_commit_sha":null,"homepage":null,"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/pierrechevalier83.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":"2017-10-10T01:30:42.000Z","updated_at":"2021-06-21T01:45:09.000Z","dependencies_parsed_at":"2023-04-05T10:46:22.817Z","dependency_job_id":null,"html_url":"https://github.com/pierrechevalier83/euler","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/pierrechevalier83%2Feuler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pierrechevalier83%2Feuler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pierrechevalier83%2Feuler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pierrechevalier83%2Feuler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pierrechevalier83","download_url":"https://codeload.github.com/pierrechevalier83/euler/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247107833,"owners_count":20884797,"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":["euler-solutions","eulerproject","moderncpp","ranges","ranges-v3"],"created_at":"2024-10-29T18:13:43.035Z","updated_at":"2025-04-04T01:47:26.595Z","avatar_url":"https://github.com/pierrechevalier83.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"Project Euler\n-------------\n\nThese will be my solutions to the Project Euler problems.\n\n[1](1/src/main.cpp)\n-\n\nIf we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.\nFind the sum of all the multiples of 3 or 5 below 1000.\n\n[2](2/src/main.cpp)\n-\nEach new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:\n\n1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...\n\nBy considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.\n\n[3](3/src/main.cpp)\n-\nThe prime factors of 13195 are 5, 7, 13 and 29.\n\nWhat is the largest prime factor of the number 600851475143 ?\n\n[4](4/src/main.cpp)\n-\nA palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.\n\nFind the largest palindrome made from the product of two 3-digit numbers.\n\n[5](5/src/main.cpp)\n-\n2520 is the smallest number that can be divided by each of the numbers from 1 to\n10 without any remainder.\n\nWhat is the smallest positive number that is evenly divisible by all of the\nnumbers from 1 to 20?\n\n[6](6/src/main.cpp)\n-\nThe sum of the squares of the first ten natural numbers is,\n1^2 + 2^2 + ... + 10^2 = 385\n\nThe square of the sum of the first ten natural numbers is,\n(1 + 2 + ... + 10)^2 = 55^2 = 3025\n\nHence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.\n\nFind the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.\n\n[7](7/src/main.cpp)\n-\nBy listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.\n\nWhat is the 10 001st prime number?\n\n[8](8/src/main.cpp)\n-\nThe four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.\n\n73167176531330624919225119674426574742355349194934\n96983520312774506326239578318016984801869478851843\n85861560789112949495459501737958331952853208805511\n12540698747158523863050715693290963295227443043557\n66896648950445244523161731856403098711121722383113\n62229893423380308135336276614282806444486645238749\n30358907296290491560440772390713810515859307960866\n70172427121883998797908792274921901699720888093776\n65727333001053367881220235421809751254540594752243\n52584907711670556013604839586446706324415722155397\n53697817977846174064955149290862569321978468622482\n83972241375657056057490261407972968652414535100474\n82166370484403199890008895243450658541227588666881\n16427171479924442928230863465674813919123162824586\n17866458359124566529476545682848912883142607690042\n24219022671055626321111109370544217506941658960408\n07198403850962455444362981230987879927244284909188\n84580156166097919133875499200524063689912560717606\n05886116467109405077541002256983155200055935729725\n71636269561882670428252483600823257530420752963450\n\nFind the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?\n\n[9](9/src/main.cpp)\n-\nA pythagorean triplet is a set of three natural numbers, a \u003c b \u003c c, for which, a^2 + b^2 = c^2\n\nFor example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2\n\nThere exists exactly one Pythagorean triplet for which a + b + c = 1000\nFind the product abc\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpierrechevalier83%2Feuler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpierrechevalier83%2Feuler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpierrechevalier83%2Feuler/lists"}