#!/usr/bin/env setl
--
-- Project Euler problem 15 in SETL
--
-- Problem 15
-- """
-- Starting in the top left corner of a 2×2 grid, there are 6 routes
-- (without backtracking) to the bottom right corner.
--
-- How many routes are there through a 20×20 grid?
-- """
--
-- This SETL program was created by Hakan Kjellerstrand (hakank@bonetmail.com)
-- Also see my SETL page: http://www.hakank.org/setl/
--
problem15();
proc problem15();
nprint("Problem 15: ");
print(*/[21..40] / */[2..20]);
end proc;