Personal tools

Euler problems/81 to 90

From HaskellWiki

< Euler problems(Difference between revisions)
Jump to: navigation, search
m
m (Corrected the links to Project Euler)
Line 1: Line 1:
 
[[Category:Programming exercise spoilers]]
 
[[Category:Programming exercise spoilers]]
== [http://projecteuler.net/index.php?section=problems&id=81 Problem 81] ==
+
== [http://projecteuler.net/index.php?section=view&id=81 Problem 81] ==
 
Find the minimal path sum from the top left to the bottom right by moving right and down.
 
Find the minimal path sum from the top left to the bottom right by moving right and down.
   
Line 8: Line 8:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=82 Problem 82] ==
+
== [http://projecteuler.net/index.php?section=view&id=82 Problem 82] ==
 
Find the minimal path sum from the left column to the right column.
 
Find the minimal path sum from the left column to the right column.
   
Line 16: Line 16:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=83 Problem 83] ==
+
== [http://projecteuler.net/index.php?section=view&id=83 Problem 83] ==
 
Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down.
 
Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down.
   
Line 24: Line 24:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=84 Problem 84] ==
+
== [http://projecteuler.net/index.php?section=view&id=84 Problem 84] ==
 
In the game, Monopoly, find the three most popular squares when using two 4-sided dice.
 
In the game, Monopoly, find the three most popular squares when using two 4-sided dice.
   
Line 32: Line 32:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=85 Problem 85] ==
+
== [http://projecteuler.net/index.php?section=view&id=85 Problem 85] ==
 
Investigating the number of rectangles in a rectangular grid.
 
Investigating the number of rectangles in a rectangular grid.
   
Line 40: Line 40:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=86 Problem 86] ==
+
== [http://projecteuler.net/index.php?section=view&id=86 Problem 86] ==
 
Exploring the shortest path from one corner of a cuboid to another.
 
Exploring the shortest path from one corner of a cuboid to another.
   
Line 48: Line 48:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=87 Problem 87] ==
+
== [http://projecteuler.net/index.php?section=view&id=87 Problem 87] ==
 
Investigating numbers that can be expressed as the sum of a prime square, cube, and fourth power?
 
Investigating numbers that can be expressed as the sum of a prime square, cube, and fourth power?
   
Line 56: Line 56:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=88 Problem 88] ==
+
== [http://projecteuler.net/index.php?section=view&id=88 Problem 88] ==
 
Exploring minimal product-sum numbers for sets of different sizes.
 
Exploring minimal product-sum numbers for sets of different sizes.
   
Line 64: Line 64:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=89 Problem 89] ==
+
== [http://projecteuler.net/index.php?section=view&id=89 Problem 89] ==
 
Develop a method to express Roman numerals in minimal form.
 
Develop a method to express Roman numerals in minimal form.
   
Line 72: Line 72:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=90 Problem 90] ==
+
== [http://projecteuler.net/index.php?section=view&id=90 Problem 90] ==
 
An unexpected way of using two cubes to make a square.
 
An unexpected way of using two cubes to make a square.
   

Revision as of 13:55, 20 July 2007

Contents

1 Problem 81

Find the minimal path sum from the top left to the bottom right by moving right and down.

Solution:

problem_81 = undefined

2 Problem 82

Find the minimal path sum from the left column to the right column.

Solution:

problem_82 = undefined

3 Problem 83

Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down.

Solution:

problem_83 = undefined

4 Problem 84

In the game, Monopoly, find the three most popular squares when using two 4-sided dice.

Solution:

problem_84 = undefined

5 Problem 85

Investigating the number of rectangles in a rectangular grid.

Solution:

problem_85 = undefined

6 Problem 86

Exploring the shortest path from one corner of a cuboid to another.

Solution:

problem_86 = undefined

7 Problem 87

Investigating numbers that can be expressed as the sum of a prime square, cube, and fourth power?

Solution:

problem_87 = undefined

8 Problem 88

Exploring minimal product-sum numbers for sets of different sizes.

Solution:

problem_88 = undefined

9 Problem 89

Develop a method to express Roman numerals in minimal form.

Solution:

problem_89 = undefined

10 Problem 90

An unexpected way of using two cubes to make a square.

Solution:

problem_90 = undefined