Background A snake is a path over the cells of a square grid, such that it doesn't touch itself on a side of a unit square. Touching at a corner is allowed. An example snake: ##.#. .#.## ##..# #.### ###.. Some example non-snakes: ###.# #.#.# ##### .#... .#### ### .#. ## ## Challenge Gi...

Refer to this challenge in Sandbox. My major language is Haskell. In Haskell, a parser (type ReadS) is a function that inputs a String and outputs a list of a tuple of the parsed element and the remaining string (ReadS a = String -> [(a,String)]). When the list is empty, there is no parse. When ...

Context We're at war! You need to transfer an important message to your general to inform him from an imminent assault. The thing is, your enemy knows a lot about cryptography : you will need to be more creative in order to encode your message... Task Create a program that accepts an ascii mes...

Introduction Windows 95 used a very simple algorithm for verifying license keys. The scheme of an OEM license key always looked like this: xxxyy-OEM-NNNNNNN-zzzzz The day can be anything within 001-366, and the year cannot be lower than 95 or above 03. xxx represents the day of the year the ...

Compute the pointiness, sharpness and smoothness of a letter code-golf kolmogorov-complexity Inspired by Determine the sharpness of a word. You are given an uppercase letter of the English alphabet. You have to compute (and output) its pointiness, sharpness and smoothness. Since it is difficult ...

so i have a java problem that i have to write a recursive function to print an array to how i can place pawns on a board, the first part of the problem is to write a function that calculate the min steps a pawn can do to get to another pawn (distance) and the second part is we write a function th...