Given an input of a list of positive integers with some replaced with 0,
output the list with the missing numbers that were changed to 0 replaced.
Characteristics of the input list:
The list will always have a length of at least 2.
Let us define the input list as a and the "original list" (tha...
well I'm going to bed, so I'll just reveal (because I'd definitely have to give a few more hints for it to be possible to figure out the sequence). the first one I mentioned is number of Hamiltonian cycles in an NxN grid graph (so some sort of "permutation problem" was pretty close). the longer one is the flattened triangle of MxN grid graphs.
(I figured with the supersequence people might be able to figure out that that one's a triangle, so might have to do with grids; plus it looks like combinatorics from the fast growth; and then look into what doesn't work on the grids that give 0)
Write a program or function that takes in a non-negative integer N from stdin or as a function argument. It must print or return a string of a hollow ASCII-art square whose sides are each made with N copies of the number N.
Specifically:
If N is 0, no copies of N are used, so there should be no...
> ,a - draws a box, given width, height, and options, in a string, abcd, where a is the corner, b is the horizontal strut, c is the vertical strut, and d is the fill character.
Given an input of a list of positive integers with some replaced with 0,
output the list with the missing numbers that were changed to 0 replaced.
Characteristics of the input list:
The list will always have a length of at least 2.
Let us define the input list as a and the "original list" (tha...
Write a program or function that takes in a non-negative integer N from stdin or as a function argument. It must print or return a string of a hollow ASCII-art square whose sides are each made with N copies of the number N.
Specifically:
If N is 0, no copies of N are used, so there should be no...
