(This is part 1 in a two-part challenge.)
Your task is to solve a Hexasweep puzzle.
A Hexasweep puzzle is set out on a grid of diamonds arranged in hexagonal shapes, of which the board looks like a hexagon, like so:
_____
/\ \
_____/ X\____\_____
/\ \ / XX /\ \
/X...
What about one question on numeric solve?
write one function that gets as one argument
one function f(x) and return the list of all element
v with f(v)=0.
Win the one write the function with biggest set
of right results. If two have the same set,
win the one has less characters.
You can not use...
Minimize Your Code's SHA-256 Hash code-challenge
Write a program or function that outputs its own SHA-256 hash as a hex digest. The winner will be the program with the smallest output (when interpreted as a hexadecimal integer).
Rules
Accessing the program/function's source code is allowed (a...
Take a positive integer X. This number is part of the sequence we are interested in if the sum of all digits of X is a divisor of X, and if the product of all digits of X is a divisor of X.
For example, 135 is such a number because 1 + 3 + 5 = 9 which divides 135 = 9 * 15 and 1 * 3 * 5 = 15 whic...
Challenge
Create the shortest program that meets the requirements
Requirements
1) The code must generate a 5x5 grid of 0s, like so:
00000
00000
00000
00000
00000
2) The code must accept an input (column, row, character). The grid must change accordingly:
Start:
00000
00000
00000
00000
0000...
