Enumerate Pythagorean triples code-golf The task is to create a program that either outputs Pythagorean triples forever so that each triple is outputted in a finite amount of time or, given a integer \$n\$, outputs the \$n\$-th (in 0-based or 1-based indexing) triple in any numbering that assign...

Introdution Let's talk about Korean keyboard first. As you can see in Wikipedia, there is Kor/Eng key to change between Korean and English key set in Korean keyboard. Korean sometimes types wrong : attempt to write in Korean in qwerty keyboard or English in two-set keyboard. So, here is proble...

Suppose there are 5 positive integers in an array or list as 14, 12, 23, 45, 39. 15 and 12 cannot be taken in the subset as 1 is common in both. Similarly {12, 23}, {23, 39}, {14, 45} cannot be included in the same subset. So the subset which forms the maximum sum is {12, 45, 39}. The maximum s...

Given a position of a chess piece and another square, determine if the chess piece attacks that square Input Input would be in the form Qe4 c6 Where the first term denotes the piece and its position and the second term is the square we're interested in. Labels for pieces are: K - king ...

Output efficient Church encodings of natural numbers code-golf lambda-calculus The Church encoding of a natural number \$n\$ in lambda calculus is the higher-order function which takes a function \$f\$ to its \$n\$-fold iterate \$f^n = f \circ \cdots \circ f\$. For example, 0 = \f.\x.x 1 = \f...