518 B
518 B
Similar to problem 22 this is not quite befunge-friendly due to enormous input size. But otherwise it wasn't hard, I create for every word the word value and count the triangle numbers in it.
Two little tricks:
- I cached the triangle numbers from 1 to 400 (biggest possible word value is 364 because the longest word is 14 letters)
- to count the triangle numbers just add the boolean results of the
isTrianglefunction. Because true is1and false is0this results equals the number of triangle numbers.