{"id":18379067,"url":"https://github.com/harshitv21/project-euler-solutions","last_synced_at":"2025-04-11T08:39:02.163Z","repository":{"id":252564380,"uuid":"840773507","full_name":"Harshitv21/Project-Euler-Solutions","owner":"Harshitv21","description":"Solution for project Euler problems (https://projecteuler.net).","archived":false,"fork":false,"pushed_at":"2024-09-03T10:01:54.000Z","size":38,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-15T22:44:09.083Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","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/Harshitv21.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-08-10T16:34:20.000Z","updated_at":"2024-09-03T10:01:57.000Z","dependencies_parsed_at":"2024-11-06T00:47:51.369Z","dependency_job_id":null,"html_url":"https://github.com/Harshitv21/Project-Euler-Solutions","commit_stats":null,"previous_names":["harshitv21/project-euler-solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harshitv21%2FProject-Euler-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harshitv21%2FProject-Euler-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harshitv21%2FProject-Euler-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harshitv21%2FProject-Euler-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Harshitv21","download_url":"https://codeload.github.com/Harshitv21/Project-Euler-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248362186,"owners_count":21091065,"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-06T00:36:58.137Z","updated_at":"2025-04-11T08:39:02.134Z","avatar_url":"https://github.com/Harshitv21.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Project Euler Solutions\n\nC++ codes for project euler problems.\nIf some problems are tricky I will try to provide an explanation for them or link to some resource explaining it.\n\n\u003e Goal is to find a solution but it may not be the most efficient one!\n\n## Progress ⌛\n\n| no  | Problem name                             | status | Project Euler link                           |\n| --- | ---------------------------------------- | ------ | -------------------------------------------- |\n| 1   | Multiples of 3 or 5                      | ✅      | [link](https://projecteuler.net/problem=1)   |\n| 2   | Even Fibonacci Numbers                   |        | [link](https://projecteuler.net/problem=2)   |\n| 3   | Largest Prime Factor                     |        | [link](https://projecteuler.net/problem=3)   |\n| 4   | Largest Palindrome Product               |        | [link](https://projecteuler.net/problem=4)   |\n| 5   | Smallest Multiple                        |        | [link](https://projecteuler.net/problem=5)   |\n| 6   | Sum Square Difference                    | ✅      | [link](https://projecteuler.net/problem=6)   |\n| 7   | 10001st Prime                            | ✅       | [link](https://projecteuler.net/problem=7)   |\n| 8   | Largest Product in a Series              |        | [link](https://projecteuler.net/problem=8)   |\n| 9   | Special Pythagorean Triplet              |        | [link](https://projecteuler.net/problem=9)   |\n| 10  | Summation of Primes                      |        | [link](https://projecteuler.net/problem=10)  |\n| 11  | Largest Product in a Grid                |        | [link](https://projecteuler.net/problem=11)  |\n| 12  | Highly Divisible Triangular Number       |        | [link](https://projecteuler.net/problem=12)  |\n| 13  | Large Sum                                |        | [link](https://projecteuler.net/problem=13)  |\n| 14  | Longest Collatz Sequence                 |        | [link](https://projecteuler.net/problem=14)  |\n| 15  | Lattice Paths                            |        | [link](https://projecteuler.net/problem=15)  |\n| 16  | Power Digit Sum                          |        | [link](https://projecteuler.net/problem=16)  |\n| 17  | Number Letter Counts                     |        | [link](https://projecteuler.net/problem=17)  |\n| 18  | Maximum Path Sum I                       |        | [link](https://projecteuler.net/problem=18)  |\n| 19  | Counting Sundays                         |        | [link](https://projecteuler.net/problem=19)  |\n| 20  | Factorial Digit Sum                      |        | [link](https://projecteuler.net/problem=20)  |\n| 21  | Amicable Numbers                         |        | [link](https://projecteuler.net/problem=21)  |\n| 22  | Names Scores                             |        | [link](https://projecteuler.net/problem=22)  |\n| 23  | Non-Abundant Sums                        |        | [link](https://projecteuler.net/problem=23)  |\n| 24  | Lexicographic Permutations               |        | [link](https://projecteuler.net/problem=24)  |\n| 25  | $1000$-digit Fibonacci Number            |        | [link](https://projecteuler.net/problem=25)  |\n| 26  | Reciprocal Cycles                        |        | [link](https://projecteuler.net/problem=26)  |\n| 27  | Quadratic Primes                         |        | [link](https://projecteuler.net/problem=27)  |\n| 28  | Number Spiral Diagonals                  |        | [link](https://projecteuler.net/problem=28)  |\n| 29  | Distinct Powers                          |        | [link](https://projecteuler.net/problem=29)  |\n| 30  | Digit Fifth Powers                       |        | [link](https://projecteuler.net/problem=30)  |\n| 31  | Coin Sums                                |        | [link](https://projecteuler.net/problem=31)  |\n| 32  | Pandigital Products                      |        | [link](https://projecteuler.net/problem=32)  |\n| 33  | Digit Cancelling Fractions               |        | [link](https://projecteuler.net/problem=33)  |\n| 34  | Digit Factorials                         |        | [link](https://projecteuler.net/problem=34)  |\n| 35  | Circular Primes                          |        | [link](https://projecteuler.net/problem=35)  |\n| 36  | Double-base Palindromes                  |        | [link](https://projecteuler.net/problem=36)  |\n| 37  | Truncatable Primes                       |        | [link](https://projecteuler.net/problem=37)  |\n| 38  | Pandigital Multiples                     |        | [link](https://projecteuler.net/problem=38)  |\n| 39  | Integer Right Triangles                  |        | [link](https://projecteuler.net/problem=39)  |\n| 40  | Champernowne's Constant                  |        | [link](https://projecteuler.net/problem=40)  |\n| 41  | Pandigital Prime                         |        | [link](https://projecteuler.net/problem=41)  |\n| 42  | Coded Triangle Numbers                   |        | [link](https://projecteuler.net/problem=42)  |\n| 43  | Sub-string Divisibility                  |        | [link](https://projecteuler.net/problem=43)  |\n| 44  | Pentagon Numbers                         |        | [link](https://projecteuler.net/problem=44)  |\n| 45  | Triangular, Pentagonal, and Hexagonal    |        | [link](https://projecteuler.net/problem=45)  |\n| 46  | Goldbach's Other Conjecture              |        | [link](https://projecteuler.net/problem=46)  |\n| 47  | Distinct Primes Factors                  |        | [link](https://projecteuler.net/problem=47)  |\n| 48  | Self Powers                              |        | [link](https://projecteuler.net/problem=48)  |\n| 49  | Prime Permutations                       |        | [link](https://projecteuler.net/problem=49)  |\n| 50  | Consecutive Prime Sum                    |        | [link](https://projecteuler.net/problem=50)  |\n| 51  | Prime Digit Replacements                 |        | [link](https://projecteuler.net/problem=51)  |\n| 52  | Permuted Multiples                       |        | [link](https://projecteuler.net/problem=52)  |\n| 53  | Combinatoric Selections                  |        | [link](https://projecteuler.net/problem=53)  |\n| 54  | Poker Hands                              |        | [link](https://projecteuler.net/problem=54)  |\n| 55  | Lychrel Numbers                          |        | [link](https://projecteuler.net/problem=55)  |\n| 56  | Powerful Digit Sum                       |        | [link](https://projecteuler.net/problem=56)  |\n| 57  | Square Root Convergents                  |        | [link](https://projecteuler.net/problem=57)  |\n| 58  | Spiral Primes                            |        | [link](https://projecteuler.net/problem=58)  |\n| 59  | XOR Decryption                           |        | [link](https://projecteuler.net/problem=59)  |\n| 60  | Prime Pair Sets                          |        | [link](https://projecteuler.net/problem=60)  |\n| 61  | Cyclical Figurate Numbers                |        | [link](https://projecteuler.net/problem=61)  |\n| 62  | Cubic Permutations                       |        | [link](https://projecteuler.net/problem=62)  |\n| 63  | Powerful Digit Counts                    |        | [link](https://projecteuler.net/problem=63)  |\n| 64  | Odd Period Square Roots                  |        | [link](https://projecteuler.net/problem=64)  |\n| 65  | Convergents of $e$                       |        | [link](https://projecteuler.net/problem=65)  |\n| 66  | Diophantine Equation                     |        | [link](https://projecteuler.net/problem=66)  |\n| 67  | Maximum Path Sum II                      |        | [link](https://projecteuler.net/problem=67)  |\n| 68  | Magic 5-gon Ring                         |        | [link](https://projecteuler.net/problem=68)  |\n| 69  | Totient Maximum                          |        | [link](https://projecteuler.net/problem=69)  |\n| 70  | Totient Permutation                      |        | [link](https://projecteuler.net/problem=70)  |\n| 71  | Ordered Fractions                        |        | [link](https://projecteuler.net/problem=71)  |\n| 72  | Counting Fractions                       |        | [link](https://projecteuler.net/problem=72)  |\n| 73  | Counting Fractions in a Range            |        | [link](https://projecteuler.net/problem=73)  |\n| 74  | Digit Factorial Chains                   |        | [link](https://projecteuler.net/problem=74)  |\n| 75  | Singular Integer Right Triangles         |        | [link](https://projecteuler.net/problem=75)  |\n| 76  | Counting Summations                      |        | [link](https://projecteuler.net/problem=76)  |\n| 77  | Prime Summations                         |        | [link](https://projecteuler.net/problem=77)  |\n| 78  | Coin Partitions                          |        | [link](https://projecteuler.net/problem=78)  |\n| 79  | Passcode Derivation                      |        | [link](https://projecteuler.net/problem=79)  |\n| 80  | Square Root Digital Expansion            |        | [link](https://projecteuler.net/problem=80)  |\n| 81  | Path Sum: Two Ways                       |        | [link](https://projecteuler.net/problem=81)  |\n| 82  | Path Sum: Three Ways                     |        | [link](https://projecteuler.net/problem=82)  |\n| 83  | Path Sum: Four Ways                      |        | [link](https://projecteuler.net/problem=83)  |\n| 84  | Monopoly Odds                            |        | [link](https://projecteuler.net/problem=84)  |\n| 85  | Counting Rectangles                      |        | [link](https://projecteuler.net/problem=85)  |\n| 86  | Cuboid Route                             |        | [link](https://projecteuler.net/problem=86)  |\n| 87  | Prime Power Triples                      |        | [link](https://projecteuler.net/problem=87)  |\n| 88  | Product-sum Numbers                      |        | [link](https://projecteuler.net/problem=88)  |\n| 89  | Roman Numerals                           |        | [link](https://projecteuler.net/problem=89)  |\n| 90  | Cube Digit Pairs                         |        | [link](https://projecteuler.net/problem=90)  |\n| 91  | Right Triangles with Integer Coordinates |        | [link](https://projecteuler.net/problem=91)  |\n| 92  | Square Digit Chains                      |        | [link](https://projecteuler.net/problem=92)  |\n| 93  | Arithmetic Expressions                   |        | [link](https://projecteuler.net/problem=93)  |\n| 94  | Almost Equilateral Triangles             |        | [link](https://projecteuler.net/problem=94)  |\n| 95  | Amicable Chains                          |        | [link](https://projecteuler.net/problem=95)  |\n| 96  | Su Doku                                  |        | [link](https://projecteuler.net/problem=96)  |\n| 97  | Large Non-Mersenne Prime                 |        | [link](https://projecteuler.net/problem=97)  |\n| 98  | Anagramic Squares                        |        | [link](https://projecteuler.net/problem=98)  |\n| 99  | Largest Exponential                      |        | [link](https://projecteuler.net/problem=99)  |\n| 100 | Arranged Probability                     |        | [link](https://projecteuler.net/problem=100) |\n\n## Script to generate table 👆\n\nRefer to [this](/script/README.md) README file for instructions on how to generate this table using a script for as many problems as you want!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharshitv21%2Fproject-euler-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fharshitv21%2Fproject-euler-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharshitv21%2Fproject-euler-solutions/lists"}