{"id":18387691,"url":"https://github.com/webobite/project-euler","last_synced_at":"2025-04-12T02:47:30.504Z","repository":{"id":120241693,"uuid":"277861794","full_name":"webobite/Project-Euler","owner":"webobite","description":"An initialive try to solve everyday 1 Euler Problem (among 480 problems)","archived":false,"fork":false,"pushed_at":"2021-05-02T17:44:16.000Z","size":18,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"develop","last_synced_at":"2025-02-16T00:28:57.763Z","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/webobite.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":"2020-07-07T16:01:01.000Z","updated_at":"2020-08-01T14:46:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"1589fa34-a8f3-4b7a-a4c3-e10026df2a77","html_url":"https://github.com/webobite/Project-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/webobite%2FProject-Euler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/webobite%2FProject-Euler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/webobite%2FProject-Euler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/webobite%2FProject-Euler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/webobite","download_url":"https://codeload.github.com/webobite/Project-Euler/tar.gz/refs/heads/develop","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248508662,"owners_count":21115849,"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-06T01:27:20.617Z","updated_at":"2025-04-12T02:47:30.482Z","avatar_url":"https://github.com/webobite.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Project-Euler\n\n## Table of Contents\n\n- [About](#about)\n- [List of Problems no with Problem title](#list_of_problem)\n- [Usage](#usage)\n\n## About \u003ca name = \"about\"\u003e\u003c/a\u003e\n\nAn initialive to solve project Euler problems in order to upgrade my problem solving skills and Java skills.\n\n\n## List of Problems no with Problem title \u003ca name = \"list_of_problem\"\u003e\u003c/a\u003e\n\n### Index meaning : \n\n```\nNot Passed : Problem not tried\nPassed : Problem Completed [(DD - MM - YYYY)]\n```\n\u003chr\u003e\n\n```\n\nProblem 1: Multiples of 3 and 5\nPassed [(02 - 05 - 2021)]\n\nProblem 2: Even Fibonacci Numbers\nNot Passed\nProblem 3: Largest prime factor\nNot Passed\nProblem 4: Largest palindrome product\nNot Passed\nProblem 5: Smallest multiple\nNot Passed\nProblem 6: Sum square difference\nNot Passed\nProblem 7: 10001st prime\nNot Passed\nProblem 8: Largest product in a series\nNot Passed\nProblem 9: Special Pythagorean triplet\nNot Passed\nProblem 10: Summation of primes\nNot Passed\nProblem 11: Largest product in a grid\nNot Passed\nProblem 12: Highly divisible triangular number\nNot Passed\nProblem 13: Large sum\nNot Passed\nProblem 14: Longest Collatz sequence\nNot Passed\nProblem 15: Lattice paths\nNot Passed\nProblem 16: Power digit sum\nNot Passed\nProblem 17: Number letter counts\nNot Passed\nProblem 18: Maximum path sum I\nNot Passed\nProblem 19: Counting Sundays\nNot Passed\nProblem 20: Factorial digit sum\nNot Passed\nProblem 21: Amicable numbers\nNot Passed\nProblem 22: Names scores\nNot Passed\nProblem 23: Non-abundant sums\nNot Passed\nProblem 24: Lexicographic permutations\nNot Passed\nProblem 25: 1000-digit Fibonacci number\nNot Passed\nProblem 26: Reciprocal cycles\nNot Passed\nProblem 27: Quadratic primes\nNot Passed\nProblem 28: Number spiral diagonals\nNot Passed\nProblem 29: Distinct powers\nNot Passed\nProblem 30: Digit n powers\nNot Passed\nProblem 31: Coin sums\nNot Passed\nProblem 32: Pandigital products\nNot Passed\nProblem 33: Digit cancelling fractions\nNot Passed\nProblem 34: Digit factorials\nNot Passed\nProblem 35: Circular primes\nNot Passed\nProblem 36: Double-base palindromes\nNot Passed\nProblem 37: Truncatable primes\nNot Passed\nProblem 38: Pandigital multiples\nNot Passed\nProblem 39: Integer right triangles\nNot Passed\nProblem 40: Champernowne's constant\nNot Passed\nProblem 41: Pandigital prime\nNot Passed\nProblem 42: Coded triangle numbers\nNot Passed\nProblem 43: Sub-string divisibility\nNot Passed\nProblem 44: Pentagon numbers\nNot Passed\nProblem 45: Triangular, pentagonal, and hexagonal\nNot Passed\nProblem 46: Goldbach's other conjecture\nNot Passed\nProblem 47: Distinct primes factors\nNot Passed\nProblem 48: Self powers\nNot Passed\nProblem 49: Prime permutations\nNot Passed\nProblem 50: Consecutive prime sum\nNot Passed\nProblem 51: Prime digit replacements\nNot Passed\nProblem 52: Permuted multiples\nNot Passed\nProblem 53: Combinatoric selections\nNot Passed\nProblem 54: Poker hands\nNot Passed\nProblem 55: Lychrel numbers\nNot Passed\nProblem 56: Powerful digit sum\nNot Passed\nProblem 57: Square root convergents\nNot Passed\nProblem 58: Spiral primes\nNot Passed\nProblem 59: XOR decryption\nNot Passed\nProblem 60: Prime pair sets\nNot Passed\nProblem 61: Cyclical figurate numbers\nNot Passed\nProblem 62: Cubic permutations\nNot Passed\nProblem 63: Powerful digit counts\nNot Passed\nProblem 64: Odd period square roots\nNot Passed\nProblem 65: Convergents of e\nNot Passed\nProblem 66: Diophantine equation\nNot Passed\nProblem 67: Maximum path sum II\nNot Passed\nProblem 68: Magic 5-gon ring\nNot Passed\nProblem 69: Totient maximum\nNot Passed\nProblem 70: Totient permutation\nNot Passed\nProblem 71: Ordered fractions\nNot Passed\nProblem 72: Counting fractions\nNot Passed\nProblem 73: Counting fractions in a range\nNot Passed\nProblem 74: Digit factorial chains\nNot Passed\nProblem 75: Singular integer right triangles\nNot Passed\nProblem 76: Counting summations\nNot Passed\nProblem 77: Prime summations\nNot Passed\nProblem 78: Coin partitions\nNot Passed\nProblem 79: Passcode derivation\nNot Passed\nProblem 80: Square root digital expansion\nNot Passed\nProblem 81: Path sum: two ways\nNot Passed\nProblem 82: Path sum: three ways\nNot Passed\nProblem 83: Path sum: four ways\nNot Passed\nProblem 84: Monopoly odds\nNot Passed\nProblem 85: Counting rectangles\nNot Passed\nProblem 86: Cuboid route\nNot Passed\nProblem 87: Prime power triples\nNot Passed\nProblem 88: Product-sum numbers\nNot Passed\nProblem 89: Roman numerals\nNot Passed\nProblem 90: Cube digit pairs\nNot Passed\nProblem 91: Right triangles with integer coordinates\nNot Passed\nProblem 92: Square digit chains\nNot Passed\nProblem 93: Arithmetic expressions\nNot Passed\nProblem 94: Almost equilateral triangles\nNot Passed\nProblem 95: Amicable chains\nNot Passed\nProblem 96: Su Doku\nNot Passed\nProblem 97: Large non-Mersenne prime\nNot Passed\nProblem 98: Anagramic squares\nNot Passed\nProblem 99: Largest exponential\nNot Passed\nProblem 100: Arranged probability\nNot Passed\nProblem 101: Optimum polynomial\nNot Passed\nProblem 102: Triangle containment\nNot Passed\nProblem 103: Special subset sums: optimum\nNot Passed\nProblem 104: Pandigital Fibonacci ends\nNot Passed\nProblem 105: Special subset sums: testing\nNot Passed\nProblem 106: Special subset sums: meta-testing\nNot Passed\nProblem 107: Minimal network\nNot Passed\nProblem 108: Diophantine Reciprocals I\nNot Passed\nProblem 109: Darts\nNot Passed\nProblem 110: Diophantine Reciprocals II\nNot Passed\nProblem 111: Primes with runs\nNot Passed\nProblem 112: Bouncy numbers\nNot Passed\nProblem 113: Non-bouncy numbers\nNot Passed\nProblem 114: Counting block combinations I\nNot Passed\nProblem 115: Counting block combinations II\nNot Passed\nProblem 116: Red, green or blue tiles\nNot Passed\nProblem 117: Red, green, and blue tiles\nNot Passed\nProblem 118: Pandigital prime sets\nNot Passed\nProblem 119: Digit power sum\nNot Passed\nProblem 120: Square remainders\nNot Passed\nProblem 121: Disc game prize fund\nNot Passed\nProblem 122: Efficient exponentiation\nNot Passed\nProblem 123: Prime square remainders\nNot Passed\nProblem 124: Ordered radicals\nNot Passed\nProblem 125: Palindromic sums\nNot Passed\nProblem 126: Cuboid layers\nNot Passed\nProblem 127: abc-hits\nNot Passed\nProblem 128: Hexagonal tile differences\nNot Passed\nProblem 129: Repunit divisibility\nNot Passed\nProblem 130: Composites with prime repunit property\nNot Passed\nProblem 131: Prime cube partnership\nNot Passed\nProblem 132: Large repunit factors\nNot Passed\nProblem 133: Repunit nonfactors\nNot Passed\nProblem 134: Prime pair connection\nNot Passed\nProblem 135: Same differences\nNot Passed\nProblem 136: Singleton difference\nNot Passed\nProblem 137: Fibonacci golden nuggets\nNot Passed\nProblem 138: Special isosceles triangles\nNot Passed\nProblem 139: Pythagorean tiles\nNot Passed\nProblem 140: Modified Fibonacci golden nuggets\nNot Passed\nProblem 141: Investigating progressive numbers, n, which are also square\nNot Passed\nProblem 142: Perfect Square Collection\nNot Passed\nProblem 143: Investigating the Torricelli point of a triangle\nNot Passed\nProblem 144: Investigating multiple reflections of a laser beam\nNot Passed\nProblem 145: How many reversible numbers are there below one-billion?\nNot Passed\nProblem 146: Investigating a Prime Pattern\nNot Passed\nProblem 147: Rectangles in cross-hatched grids\nNot Passed\nProblem 148: Exploring Pascal's triangle\nNot Passed\nProblem 149: Searching for a maximum-sum subsequence\nNot Passed\nProblem 150: Searching a triangular array for a sub-triangle having minimum-sum\nNot Passed\nProblem 151: Paper sheets of standard sizes: an expected-value problem\nNot Passed\nProblem 152: Writing one half as a sum of inverse squares\nNot Passed\nProblem 153: Investigating Gaussian Integers\nNot Passed\nProblem 154: Exploring Pascal's pyramid\nNot Passed\nProblem 155: Counting Capacitor Circuits\nNot Passed\nProblem 156: Counting Digits\nNot Passed\nProblem 157: Solving the diophantine equation\nNot Passed\nProblem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left\nNot Passed\nProblem 159: Digital root sums of factorisations\nNot Passed\nProblem 160: Factorial trailing digits\nNot Passed\nProblem 161: Triominoes\nNot Passed\nProblem 162: Hexadecimal numbers\nNot Passed\nProblem 163: Cross-hatched triangles\nNot Passed\nProblem 164: Numbers for which no three consecutive digits have a sum greater than a given value\nNot Passed\nProblem 165: Intersections\nNot Passed\nProblem 166: Criss Cross\nNot Passed\nProblem 167: Investigating Ulam sequences\nNot Passed\nProblem 168: Number Rotations\nNot Passed\nProblem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2\nNot Passed\nProblem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products\nNot Passed\nProblem 171: Finding numbers for which the sum of the squares of the digits is a square\nNot Passed\nProblem 172: Investigating numbers with few repeated digits\nNot Passed\nProblem 173: Using up to one million tiles how many different \"hollow\" square laminae can be formed?\nNot Passed\nProblem 174: Counting the number of \"hollow\" square laminae that can form one, two, three, ... distinct arrangements\nNot Passed\nProblem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2\nNot Passed\nProblem 176: Right-angled triangles that share a cathetus\nNot Passed\nProblem 177: Integer angled Quadrilaterals\nNot Passed\nProblem 178: Step Numbers\nNot Passed\nProblem 179: Consecutive positive divisors\nNot Passed\nProblem 180: Rational zeros of a function of three variables\nNot Passed\nProblem 181: Investigating in how many ways objects of two different colours can be grouped\nNot Passed\nProblem 182: RSA encryption\nNot Passed\nProblem 183: Maximum product of parts\nNot Passed\nProblem 184: Triangles containing the origin\nNot Passed\nProblem 185: Number Mind\nNot Passed\nProblem 186: Connectedness of a network\nNot Passed\nProblem 187: Semiprimes\nNot Passed\nProblem 188: The hyperexponentiation of a number\nNot Passed\nProblem 189: Tri-colouring a triangular grid\nNot Passed\nProblem 190: Maximising a weighted product\nNot Passed\nProblem 191: Prize Strings\nNot Passed\nProblem 192: Best Approximations\nNot Passed\nProblem 193: Squarefree Numbers\nNot Passed\nProblem 194: Coloured Configurations\nNot Passed\nProblem 195: Inscribed circles of triangles with one angle of 60 degrees\nNot Passed\nProblem 196: Prime triplets\nNot Passed\nProblem 197: Investigating the behaviour of a recursively defined sequence\nNot Passed\nProblem 198: Ambiguous Numbers\nNot Passed\nProblem 199: Iterative Circle Packing\nNot Passed\nProblem 200: Find the 200th prime-proof sqube containing the contiguous sub-string \"200\"\nNot Passed\nProblem 201: Subsets with a unique sum\nNot Passed\nProblem 202: Laserbeam\nNot Passed\nProblem 203: Squarefree Binomial Coefficients\nNot Passed\nProblem 204: Generalised Hamming Numbers\nNot Passed\nProblem 205: Dice Game\nNot Passed\nProblem 206: Concealed Square\nNot Passed\nProblem 207: Integer partition equations\nNot Passed\nProblem 208: Robot Walks\nNot Passed\nProblem 209: Circular Logic\nNot Passed\nProblem 210: Obtuse Angled Triangles\nNot Passed\nProblem 211: Divisor Square Sum\nNot Passed\nProblem 212: Combined Volume of Cuboids\nNot Passed\nProblem 213: Flea Circus\nNot Passed\nProblem 214: Totient Chains\nNot Passed\nProblem 215: Crack-free Walls\nNot Passed\nProblem 216: Investigating the primality of numbers of the form 2n2-1\nNot Passed\nProblem 217: Balanced Numbers\nNot Passed\nProblem 218: Perfect right-angled triangles\nNot Passed\nProblem 219: Skew-cost coding\nNot Passed\nProblem 220: Heighway Dragon\nNot Passed\nProblem 221: Alexandrian Integers\nNot Passed\nProblem 222: Sphere Packing\nNot Passed\nProblem 223: Almost right-angled triangles I\nNot Passed\nProblem 224: Almost right-angled triangles II\nNot Passed\nProblem 225: Tribonacci non-divisors\nNot Passed\nProblem 226: A Scoop of Blancmange\nNot Passed\nProblem 227: The Chase\nNot Passed\nProblem 228: Minkowski Sums\nNot Passed\nProblem 229: Four Representations using Squares\nNot Passed\nProblem 230: Fibonacci Words\nNot Passed\nProblem 231: The prime factorisation of binomial coefficients\nNot Passed\nProblem 232: The Race\nNot Passed\nProblem 233: Lattice points on a circle\nNot Passed\nProblem 234: Semidivisible numbers\nNot Passed\nProblem 235: An Arithmetic Geometric sequence\nNot Passed\nProblem 236: Luxury Hampers\nNot Passed\nProblem 237: Tours on a 4 x n playing board\nNot Passed\nProblem 238: Infinite string tour\nNot Passed\nProblem 239: Twenty-two Foolish Primes\nNot Passed\nProblem 240: Top Dice\nNot Passed\nProblem 241: Perfection Quotients\nNot Passed\nProblem 242: Odd Triplets\nNot Passed\nProblem 243: Resilience\nNot Passed\nProblem 244: Sliders\nNot Passed\nProblem 245: Coresilience\nNot Passed\nProblem 246: Tangents to an ellipse\nNot Passed\nProblem 247: Squares under a hyperbola\nNot Passed\nProblem 248: Numbers for which Euler’s totient function equals 13!\nNot Passed\nProblem 249: Prime Subset Sums\nNot Passed\nProblem 250: 250250\nNot Passed\nProblem 251: Cardano Triplets\nNot Passed\nProblem 252: Convex Holes\nNot Passed\nProblem 253: Tidying up\nNot Passed\nProblem 254: Sums of Digit Factorials\nNot Passed\nProblem 255: Rounded Square Roots\nNot Passed\nProblem 256: Tatami-Free Rooms\nNot Passed\nProblem 257: Angular Bisectors\nNot Passed\nProblem 258: A lagged Fibonacci sequence\nNot Passed\nProblem 259: Reachable Numbers\nNot Passed\nProblem 260: Stone Game\nNot Passed\nProblem 261: Pivotal Square Sums\nNot Passed\nProblem 262: Mountain Range\nNot Passed\nProblem 263: An engineers' dream come true\nNot Passed\nProblem 264: Triangle Centres\nNot Passed\nProblem 265: Binary Circles\nNot Passed\nProblem 266: Pseudo Square Root\nNot Passed\nProblem 267: Billionaire\nNot Passed\nProblem 268: Counting numbers with at least four distinct prime factors less than 100\nNot Passed\nProblem 269: Polynomials with at least one integer root\nNot Passed\nProblem 270: Cutting Squares\nNot Passed\nProblem 271: Modular Cubes, part 1\nNot Passed\nProblem 272: Modular Cubes, part 2\nNot Passed\nProblem 273: Sum of Squares\nNot Passed\nProblem 274: Divisibility Multipliers\nNot Passed\nProblem 275: Balanced Sculptures\nNot Passed\nProblem 276: Primitive Triangles\nNot Passed\nProblem 277: A Modified Collatz sequence\nNot Passed\nProblem 278: Linear Combinations of Semiprimes\nNot Passed\nProblem 279: Triangles with integral sides and an integral angle\nNot Passed\nProblem 280: Ant and seeds\nNot Passed\nProblem 281: Pizza Toppings\nNot Passed\nProblem 282: The Ackermann function\nNot Passed\nProblem 283: Integer sided triangles for which the area * perimeter ratio is integral\nNot Passed\nProblem 284: Steady Squares\nNot Passed\nProblem 285: Pythagorean odds\nNot Passed\nProblem 286: Scoring probabilities\nNot Passed\nProblem 287: Quadtree encoding (a simple compression algorithm)\nNot Passed\nProblem 288: An enormous factorial\nNot Passed\nProblem 289: Eulerian Cycles\nNot Passed\nProblem 290: Digital Signature\nNot Passed\nProblem 291: Panaitopol Primes\nNot Passed\nProblem 292: Pythagorean Polygons\nNot Passed\nProblem 293: Pseudo-Fortunate Numbers\nNot Passed\nProblem 294: Sum of digits - experience #23\nNot Passed\nProblem 295: Lenticular holes\nNot Passed\nProblem 296: Angular Bisector and Tangent\nNot Passed\nProblem 297: Zeckendorf Representation\nNot Passed\nProblem 298: Selective Amnesia\nNot Passed\nProblem 299: Three similar triangles\nNot Passed\nProblem 300: Protein folding\nNot Passed\nProblem 301: Nim\nNot Passed\nProblem 302: Strong Achilles Numbers\nNot Passed\nProblem 303: Multiples with small digits\nNot Passed\nProblem 304: Primonacci\nNot Passed\nProblem 305: Reflexive Position\nNot Passed\nProblem 306: Paper-strip Game\nNot Passed\nProblem 307: Chip Defects\nNot Passed\nProblem 308: An amazing Prime-generating Automaton\nNot Passed\nProblem 309: Integer Ladders\nNot Passed\nProblem 310: Nim Square\nNot Passed\nProblem 311: Biclinic Integral Quadrilaterals\nNot Passed\nProblem 312: Cyclic paths on Sierpiński graphs\nNot Passed\nProblem 313: Sliding game\nNot Passed\nProblem 314: The Mouse on the Moon\nNot Passed\nProblem 315: Digital root clocks\nNot Passed\nProblem 316: Numbers in decimal expansions\nNot Passed\nProblem 317: Firecracker\nNot Passed\nProblem 318: 2011 nines\nNot Passed\nProblem 319: Bounded Sequences\nNot Passed\nProblem 320: Factorials divisible by a huge integer\nNot Passed\nProblem 321: Swapping Counters\nNot Passed\nProblem 322: Binomial coefficients divisible by 10\nNot Passed\nProblem 323: Bitwise-OR operations on random integers\nNot Passed\nProblem 324: Building a tower\nNot Passed\nProblem 325: Stone Game II\nNot Passed\nProblem 326: Modulo Summations\nNot Passed\nProblem 327: Rooms of Doom\nNot Passed\nProblem 328: Lowest-cost Search\nNot Passed\nProblem 329: Prime Frog\nNot Passed\nProblem 330: Euler's Number\nNot Passed\nProblem 331: Cross flips\nNot Passed\nProblem 332: Spherical triangles\nNot Passed\nProblem 333: Special partitions\nNot Passed\nProblem 334: Spilling the beans\nNot Passed\nProblem 335: Gathering the beans\nNot Passed\nProblem 336: Maximix Arrangements\nNot Passed\nProblem 337: Totient Stairstep Sequences\nNot Passed\nProblem 338: Cutting Rectangular Grid Paper\nNot Passed\nProblem 339: Peredur fab Efrawg\nNot Passed\nProblem 340: Crazy Function\nNot Passed\nProblem 341: Golomb's self-describing sequence\nNot Passed\nProblem 342: The totient of a square is a cube\nNot Passed\nProblem 343: Fractional Sequences\nNot Passed\nProblem 344: Silver dollar game\nNot Passed\nProblem 345: Matrix Sum\nNot Passed\nProblem 346: Strong Repunits\nNot Passed\nProblem 347: Largest integer divisible by two primes\nNot Passed\nProblem 348: Sum of a square and a cube\nNot Passed\nProblem 349: Langton's ant\nNot Passed\nProblem 350: Constraining the least greatest and the greatest least\nNot Passed\nProblem 351: Hexagonal orchards\nNot Passed\nProblem 352: Blood tests\nNot Passed\nProblem 353: Risky moon\nNot Passed\nProblem 354: Distances in a bee's honeycomb\nNot Passed\nProblem 355: Maximal coprime subset\nNot Passed\nProblem 356: Largest roots of cubic polynomials\nNot Passed\nProblem 357: Prime generating integers\nNot Passed\nProblem 358: Cyclic numbers\nNot Passed\nProblem 359: Hilbert's New Hotel\nNot Passed\nProblem 360: Scary Sphere\nNot Passed\nProblem 361: Subsequence of Thue-Morse sequence\nNot Passed\nProblem 362: Squarefree factors\nNot Passed\nProblem 363: Bézier Curves\nNot Passed\nProblem 364: Comfortable distance\nNot Passed\nProblem 365: A huge binomial coefficient\nNot Passed\nProblem 366: Stone Game III\nNot Passed\nProblem 367: Bozo sort\nNot Passed\nProblem 368: A Kempner-like series\nNot Passed\nProblem 369: Badugi\nNot Passed\nProblem 370: Geometric triangles\nNot Passed\nProblem 371: Licence plates\nNot Passed\nProblem 372: Pencils of rays\nNot Passed\nProblem 373: Circumscribed Circles\nNot Passed\nProblem 374: Maximum Integer Partition Product\nNot Passed\nProblem 375: Minimum of subsequences\nNot Passed\nProblem 376: Nontransitive sets of dice\nNot Passed\nProblem 377: Sum of digits, experience 13\nNot Passed\nProblem 378: Triangle Triples\nNot Passed\nProblem 379: Least common multiple count\nNot Passed\nProblem 380: Amazing Mazes!\nNot Passed\nProblem 381: (prime-k) factorial\nNot Passed\nProblem 382: Generating polygons\nNot Passed\nProblem 383: Divisibility comparison between factorials\nNot Passed\nProblem 384: Rudin-Shapiro sequence\nNot Passed\nProblem 385: Ellipses inside triangles\nNot Passed\nProblem 386: Maximum length of an antichain\nNot Passed\nProblem 387: Harshad Numbers\nNot Passed\nProblem 388: Distinct Lines\nNot Passed\nProblem 389: Platonic Dice\nNot Passed\nProblem 390: Triangles with non rational sides and integral area\nNot Passed\nProblem 391: Hopping Game\nNot Passed\nProblem 392: Enmeshed unit circle\nNot Passed\nProblem 393: Migrating ants\nNot Passed\nProblem 394: Eating pie\nNot Passed\nProblem 395: Pythagorean tree\nNot Passed\nProblem 396: Weak Goodstein sequence\nNot Passed\nProblem 397: Triangle on parabola\nNot Passed\nProblem 398: Cutting rope\nNot Passed\nProblem 399: Squarefree Fibonacci Numbers\nNot Passed\nProblem 400: Fibonacci tree game\nNot Passed\nProblem 401: Sum of squares of divisors\nNot Passed\nProblem 402: Integer-valued polynomials\nNot Passed\nProblem 403: Lattice points enclosed by parabola and line\nNot Passed\nProblem 404: Crisscross Ellipses\nNot Passed\nProblem 405: A rectangular tiling\nNot Passed\nProblem 406: Guessing Game\nNot Passed\nProblem 407: Idempotents\nNot Passed\nProblem 408: Admissible paths through a grid\nNot Passed\nProblem 409: Nim Extreme\nNot Passed\nProblem 410: Circle and tangent line\nNot Passed\nProblem 411: Uphill paths\nNot Passed\nProblem 412: Gnomon numbering\nNot Passed\nProblem 413: One-child Numbers\nNot Passed\nProblem 414: Kaprekar constant\nNot Passed\nProblem 415: Titanic sets\nNot Passed\nProblem 416: A frog's trip\nNot Passed\nProblem 417: Reciprocal cycles II\nNot Passed\nProblem 418: Factorisation triples\nNot Passed\nProblem 419: Look and say sequence\nNot Passed\nProblem 420: 2x2 positive integer matrix\nNot Passed\nProblem 421: Prime factors of n15+1\nNot Passed\nProblem 422: Sequence of points on a hyperbola\nNot Passed\nProblem 423: Consecutive die throws\nNot Passed\nProblem 424: Kakuro\nNot Passed\nProblem 425: Prime connection\nNot Passed\nProblem 426: Box-ball system\nNot Passed\nProblem 427: n-sequences\nNot Passed\nProblem 428: Necklace of Circles\nNot Passed\nProblem 429: Sum of squares of unitary divisors\nNot Passed\nProblem 430: Range flips\nNot Passed\nProblem 431: Square Space Silo\nNot Passed\nProblem 432: Totient sum\nNot Passed\nProblem 433: Steps in Euclid's algorithm\nNot Passed\nProblem 434: Rigid graphs\nNot Passed\nProblem 435: Polynomials of Fibonacci numbers\nNot Passed\nProblem 436: Unfair wager\nNot Passed\nProblem 437: Fibonacci primitive roots\nNot Passed\nProblem 438: Integer part of polynomial equation's solutions\nNot Passed\nProblem 439: Sum of sum of divisors\nNot Passed\nProblem 440: GCD and Tiling\nNot Passed\nProblem 441: The inverse summation of coprime couples\nNot Passed\nProblem 442: Eleven-free integers\nNot Passed\nProblem 443: GCD sequence\nNot Passed\nProblem 444: The Roundtable Lottery\nNot Passed\nProblem 445: Retractions A\nNot Passed\nProblem 446: Retractions B\nNot Passed\nProblem 447: Retractions C\nNot Passed\nProblem 448: Average least common multiple\nNot Passed\nProblem 449: Chocolate covered candy\nNot Passed\nProblem 450: Hypocycloid and Lattice points\nNot Passed\nProblem 451: Modular inverses\nNot Passed\nProblem 452: Long Products\nNot Passed\nProblem 453: Lattice Quadrilaterals\nNot Passed\nProblem 454: Diophantine reciprocals III\nNot Passed\nProblem 455: Powers With Trailing Digits\nNot Passed\nProblem 456: Triangles containing the origin II\nNot Passed\nProblem 457: A polynomial modulo the square of a prime\nNot Passed\nProblem 458: Permutations of Project\nNot Passed\nProblem 459: Flipping game\nNot Passed\nProblem 460: An ant on the move\nNot Passed\nProblem 461: Almost Pi\nNot Passed\nProblem 462: Permutation of 3-smooth numbers\nNot Passed\nProblem 463: A weird recurrence relation\nNot Passed\nProblem 464: Möbius function and intervals\nNot Passed\nProblem 465: Polar polygons\nNot Passed\nProblem 466: Distinct terms in a multiplication table\nNot Passed\nProblem 467: Superinteger\nNot Passed\nProblem 468: Smooth divisors of binomial coefficients\nNot Passed\nProblem 469: Empty chairs\nNot Passed\nProblem 470: Super Ramvok\nNot Passed\nProblem 471: Triangle inscribed in ellipse\nNot Passed\nProblem 472: Comfortable Distance II\nNot Passed\nProblem 473: Phigital number base\nNot Passed\nProblem 474: Last digits of divisors\nNot Passed\nProblem 475: Music festival\nNot Passed\nProblem 476: Circle Packing II\nNot Passed\nProblem 477: Number Sequence Game\nNot Passed\nProblem 478: Mixtures\nNot Passed\nProblem 479: Roots on the Rise\nNot Passed\nProblem 480: The Last Question\n```\n\n### Prerequisites\n\nWhat things you need to install the software and how to install them.\n\n```\nAny Java IDE will work fine\n```\n\n### Installing\n\nA step by step series of examples that tell how to get a development env running.\n\n\n```\ngit clone https://github.com/webobite/Project-Euler.git\n```\n\n\n## Usage \u003ca name = \"usage\"\u003e\u003c/a\u003e\n\nPersonal project to enhance my skills.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwebobite%2Fproject-euler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwebobite%2Fproject-euler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwebobite%2Fproject-euler/lists"}