..............................
Anonymous
Anonymous
Anonymous
Inspired by this challenge from puzzling.SE.
Polyominoes are fun - you can fill all sorts of shapes with them. But as soon as you have limits on what polyominoes you can use, you sadly start running into shapes you can't fill.
Today we'll be looking at the L tromino - a shape made up of three c...
Input
A digital clock style list of characters
output
123456789
0
0
A wave of power \$k\$ is an infinite array that looks like \$1,2,\dots,k,k-1,\dots,1,\dots,k,\dots,1,\dots\$, and so on.
For example, a wave of power 3 starts with \$1,2,3,2,1,2,3,2,1,...\$, and repeats indefinitely. A wave of power 1 is a infinite array of ones. They happen to be beautifully ex...
Create a program which prints the amount of characters its source has in English words.
If your program is nine letters long it should print "nine".
Capitalization is ignored: in case you're printing "one" (somehow) you can print "one", "oNe", "ONE" or anything else.
In the (unlikely but just ...
Inspired by this StackOverflow answer as to why HTML thinks chucknorris is a valid color. Your task is to take in a string as input, and perform on it the algorithm described in the linked answer. To re-state it here:
Replace all characters that are not valid hexadecimal digits (not matching th...
0
0
l have no idea but...
class X{public static void main(String[] s)
{int n=Integer.parseInt(s[0]);
int t=0;int c=0;
while(n>4){n-=5;
System.out.println("Fill 5L jug\n5L: 5, 3L: 0, T: "+t+"\nPour from 5L jug into tank\n5L: 0, 3L: 0, T: "+(t+5));
t+=5;c+=2;
}
while(n!=0)
{switch(n)
{case 1:System.out...
