{"id":18496665,"url":"https://github.com/gbbirkisson/euler","last_synced_at":"2025-05-14T04:35:14.380Z","repository":{"id":39665100,"uuid":"370756061","full_name":"gbbirkisson/euler","owner":"gbbirkisson","description":"Exercise in Rust by solving the Project Euler problems","archived":false,"fork":false,"pushed_at":"2025-02-03T08:48:40.000Z","size":111,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-03T09:38:32.024Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gbbirkisson.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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":"2021-05-25T16:17:34.000Z","updated_at":"2025-02-03T08:48:43.000Z","dependencies_parsed_at":"2023-02-02T18:15:44.478Z","dependency_job_id":"e4d2e4c5-90e9-427a-8d90-54157d8fc4f7","html_url":"https://github.com/gbbirkisson/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/gbbirkisson%2Feuler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gbbirkisson%2Feuler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gbbirkisson%2Feuler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gbbirkisson%2Feuler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gbbirkisson","download_url":"https://codeload.github.com/gbbirkisson/euler/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239212566,"owners_count":19600833,"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-06T13:30:32.529Z","updated_at":"2025-02-17T00:16:53.662Z","avatar_url":"https://github.com/gbbirkisson.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cimg align=\"right\" src=\"https://projecteuler.net/images/clipart/euler_portrait.png\"\u003e\n\n\u003ch1\u003eProject Euler\u003c/h1\u003e\n\n[![Cargo](https://github.com/gbbirkisson/euler/actions/workflows/cargo.yml/badge.svg)](https://github.com/gbbirkisson/euler/actions/workflows/cargo.yml)\n\nIn this repository is my humble attempt to solve some [Project Euler problems](https://projecteuler.net/archives)\nusing Rust. This is just for fun and to learn the Rust programming language.\n\nAny solution to a problem should not take more than one minute to solve! This is a quote from their website:\n\n\u003e Each problem has been designed according to a \"one-minute rule\", which means that although it may take several hours to design a successful algorithm with more difficult problems, an efficient implementation will allow a solution to be obtained on a modestly powered computer in less than one minute.\n\n## Running tests\n\n```console\n$ cargo test --release -- --test-threads=4 --show-output\n```\n\n## Running a single solution\n\nFor example, if you want to run the solution to problem `4` run:\n\n```console\n$ cargo run --release -- -p 4\n```\n\n## Test + Linting\n\n```console\n$ make\n```\n\n## Problems\n\n\u003e **Note**: Solutions that take more than 1 second are marked with: 🐢\n\n- [x] [001](src/problems/p001.rs) Multiples of 3 and 5\n- [x] [002](src/problems/p002.rs) Even Fibonacci numbers\n- [x] [003](src/problems/p003.rs) Largest prime factor\n- [x] [004](src/problems/p004.rs) Largest palindrome product\n- [x] [005](src/problems/p005.rs) Smallest multiple\n- [x] [006](src/problems/p006.rs) Sum square difference\n- [x] [007](src/problems/p007.rs) 10001st prime\n- [x] [008](src/problems/p008.rs) Largest product in a series\n- [x] [009](src/problems/p009.rs) Special Pythagorean triplet\n- [x] [010](src/problems/p010.rs) Summation of primes\n- [x] [011](src/problems/p011.rs) Largest product in a grid\n- [x] [012](src/problems/p012.rs) Highly divisible triangular number\n- [x] [013](src/problems/p013.rs) Large sum\n- [x] [014](src/problems/p014.rs) Longest Collatz sequence\n- [x] [015](src/problems/p015.rs) Lattice paths\n- [x] [016](src/problems/p016.rs) Power digit sum\n- [x] [017](src/problems/p017.rs) Number letter counts\n- [x] [018](src/problems/p018.rs) Maximum path sum I\n- [x] [019](src/problems/p019.rs) Counting Sundays\n- [x] [020](src/problems/p020.rs) Factorial digit sum\n- [x] [021](src/problems/p021.rs) Amicable numbers 🐢\n- [ ] 022 Names scores\n- [ ] 023 Non-abundant sums\n- [ ] 024 Lexicographic permutations\n- [ ] 025 1000-digit Fibonacci number\n- [ ] 026 Reciprocal cycles\n- [ ] 027 Quadratic primes\n- [ ] 028 Number spiral diagonals\n- [ ] 029 Distinct powers\n- [ ] 030 Digit fifth powers\n- [ ] 031 Coin sums\n- [ ] 032 Pandigital products\n- [ ] 033 Digit cancelling fractions\n- [ ] 034 Digit factorials\n- [ ] 035 Circular primes\n- [ ] 036 Double-base palindromes\n- [ ] 037 Truncatable primes\n- [ ] 038 Pandigital multiples\n- [ ] 039 Integer right triangles\n- [ ] 040 Champernowne's constant\n- [ ] 041 Pandigital prime\n- [ ] 042 Coded triangle numbers\n- [ ] 043 Sub-string divisibility\n- [ ] 044 Pentagon numbers\n- [ ] 045 Triangular, pentagonal, and hexagonal\n- [ ] 046 Goldbach's other conjecture\n- [ ] 047 Distinct primes factors\n- [ ] 048 Self powers\n- [ ] 049 Prime permutations\n- [ ] 050 Consecutive prime sum\n- [ ] 051 Prime digit replacements\n- [ ] 052 Permuted multiples\n- [ ] 053 Combinatoric selections\n- [ ] 054 Poker hands\n- [ ] 055 Lychrel numbers\n- [ ] 056 Powerful digit sum\n- [ ] 057 Square root convergents\n- [ ] 058 Spiral primes\n- [ ] 059 XOR decryption\n- [ ] 060 Prime pair sets\n- [ ] 061 Cyclical figurate numbers\n- [ ] 062 Cubic permutations\n- [ ] 063 Powerful digit counts\n- [ ] 064 Odd period square roots\n- [ ] 065 Convergents of e\n- [ ] 066 Diophantine equation\n- [x] [067](src/problems/p067.rs) Maximum path sum II\n- [ ] 068 Magic 5-gon ring\n- [ ] 069 Totient maximum\n- [ ] 070 Totient permutation\n- [ ] 071 Ordered fractions\n- [ ] 072 Counting fractions\n- [ ] 073 Counting fractions in a range\n- [ ] 074 Digit factorial chains\n- [ ] 075 Singular integer right triangles\n- [ ] 076 Counting summations\n- [ ] 077 Prime summations\n- [ ] 078 Coin partitions\n- [ ] 079 Passcode derivation\n- [ ] 080 Square root digital expansion\n- [ ] 081 Path sum: two ways\n- [ ] 082 Path sum: three ways\n- [ ] 083 Path sum: four ways\n- [ ] 084 Monopoly odds\n- [ ] 085 Counting rectangles\n- [ ] 086 Cuboid route\n- [ ] 087 Prime power triples\n- [ ] 088 Product-sum numbers\n- [ ] 089 Roman numerals\n- [ ] 090 Cube digit pairs\n- [ ] 091 Right triangles with integer coordinates\n- [ ] 092 Square digit chains\n- [ ] 093 Arithmetic expressions\n- [ ] 094 Almost equilateral triangles\n- [ ] 095 Amicable chains\n- [ ] 096 Su Doku\n- [ ] 097 Large non-Mersenne prime\n- [ ] 098 Anagramic squares\n- [ ] 099 Largest exponential\n- [ ] 100 Arranged probability\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgbbirkisson%2Feuler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgbbirkisson%2Feuler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgbbirkisson%2Feuler/lists"}