Project Euler/61 - Revision history

Unknown user: /* Code */

2025-04-15T01:13:46Z

Code

← Older revision		Revision as of 01:13, 15 April 2025
Line 49:		Line 49:
	==Code==		==Code==

	https://git.charlesreid1.com/cs/euler/src/branch/master/scratch/Round2_050-070/061/GuavaFigurate.java		<s>https://git.charlesreid1.com/cs/euler/src/branch/master/scratch/Round2_050-070/061/GuavaFigurate.java</s>

			https://git.charlesreid1.com/cs/euler/src/branch/master/java/Problem061.java

	==Flags==		==Flags==

	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2025-04-15T01:13:13Z

Solution Technique

← Older revision		Revision as of 01:13, 15 April 2025
Line 33:		Line 33:
	==Solution Technique==		==Solution Technique==

	'''CURRENTLY UNSOLVED'''		<s>'''CURRENTLY UNSOLVED'''</s>

	Our solution technique is to generate a graph (for this, we use the Guava library).		Our solution technique is to generate a graph (for this, we use the Guava library).
Line 42:		Line 42:

	This results in a 6-partite graph, and we seek a path, a cycle, that passes through all 6 partitions.		This results in a 6-partite graph, and we seek a path, a cycle, that passes through all 6 partitions.

			===crux (several years later)===

			The approach described above was sound, the implementation was logical, but the program just contained one significant, fatal bug: when we assembled the graph connecting four-digit numbers with shared first-two-digits and last-two-digits, we incorrectly implemented it to connect last-two-digits to last-two-digits. Change a % to a / and it worked okay.

	==Code==		==Code==

2025-04-14T23:42:55Z

Code

← Older revision		Revision as of 23:42, 14 April 2025
Line 45:		Line 45:
	==Code==		==Code==

	https://git.charlesreid1.com/cs/euler/src/branch/~~main~~/scratch/Round2_050-070/061/GuavaFigurate.java		https://git.charlesreid1.com/cs/euler/src/branch/master/scratch/Round2_050-070/061/GuavaFigurate.java

	==Flags==		==Flags==

	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2025-04-14T23:41:55Z

Code

← Older revision		Revision as of 23:41, 14 April 2025
Line 45:		Line 45:
	==Code==		==Code==

	https://git.charlesreid1.com/cs/euler/src/~~master~~/scratch/Round2_050-070/061/GuavaFigurate.java		https://git.charlesreid1.com/cs/euler/src/branch/main/scratch/Round2_050-070/061/GuavaFigurate.java

	==Flags==		==Flags==

	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2019-10-09T03:49:10Z

Replacing charlesreid1.com:3000 with git.charlesreid1.com

← Older revision		Revision as of 03:49, 9 October 2019
Line 45:		Line 45:
	==Code==		==Code==

	https://charlesreid1.com~~:3000~~/cs/euler/src/master/scratch/Round2_050-070/061/GuavaFigurate.java		https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/061/GuavaFigurate.java

	==Flags==		==Flags==

	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2018-01-08T10:20:32Z

Code

← Older revision		Revision as of 10:20, 8 January 2018
Line 45:		Line 45:
	==Code==		==Code==

	https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/061		https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/061/GuavaFigurate.java

	==Flags==		==Flags==

	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2018-01-08T10:20:22Z

Solution Technique

← Older revision		Revision as of 10:20, 8 January 2018
Line 32:		Line 32:

	==Solution Technique==		==Solution Technique==

			'''CURRENTLY UNSOLVED'''

			Our solution technique is to generate a graph (for this, we use the Guava library).

			We wish to find the sum of the ordered set of six cyclic 4-digit numbers for which ''each'' polygonal type, triangle/square/pentagonal/hexaongal,/heptagonal,octagonal, is represented by a different permutation of the digits (maintaining original order).

			To do this, we create a graph, with each possible connection between a prefix and a suffix marked with an edge.

			This results in a 6-partite graph, and we seek a path, a cycle, that passes through all 6 partitions.

	==Code==		==Code==

2018-01-08T10:17:19Z

@@ Line 1: / Line 1: @@
 ==Problem Statement==
 Link: https://projecteuler.net/problem=61
@@ Line 6: / Line 34: @@
 ==Code==
 ==Flags==
 {{ProjectEulerFlag}}

2018-01-08T10:11:12Z

Created page with "==Problem Statement== Link: https://projecteuler.net/problem=61 ==Solution Technique== ==Code== ==Flags== {{ProjectEulerFlag}}"

New page

==Problem Statement==

Link: https://projecteuler.net/problem=61

==Solution Technique==

==Code==

==Flags==

{{ProjectEulerFlag}}