brainfuck, 219 bytes
+[+[>+<+<]>],[<+<+>>-]>[<<[->]>[<]>-]++++[<++++++++>-]<<[[-]----[>-<----]>-<<[>+>+<<-]<,[[>+>>>+>>+>+<<<<<<<-]>>[<<+>>-]<<[>->+<<-]>[[-]+<]>[>]<<[>>+<<-]>>[<-<+>>-]<[[-]+>]>>[<]<<<<[>>>+<<<-]>>>-[>>.<<-]>>>[[-]<]<<<<<,]
(Requires tape that either allows the pointer to go t...
Lua, jcgoble3, ≤ 128
x=111111111
h="haha"
p=h..3*x..2*x..h..7*x..h..2*x
q="ha"..6*x..p..p..h..6*x..h..7*x..h..4*x..h..5*x
"ha"..(q..h):rep(11)..q
124 bytes. Tested in Lua 5.3.1 REPL.
This is a cleaner version that can be executed as a single command or even a full program:
x=111111111 h="hah...
OCTOBER 22 IS INTERNATIONAL CAPS LOCK DAY! UNFORTUNATELY, SOME DO NOT RECOGNIZE THE GLORY OF THE ALMIGHTY CAPS LOCK. THEY SAY IT SEEMS "OBNOXIOUS" OR "LIKE SHOUTING" OR SOME NONSENSE. IN ORDER TO CONFORM TO THESE OBVIOUSLY ILLOGICAL AND INANE COMPLAINTS, PLEASE WRITE ME A PROGRAM THAT TURNS NORMA...
Exploding-Imploding Quine.
code-golfcode-bowlingquine
Your task to create program A that will take no input and output B. Program B will take no input and output A. Program A have to have property that if a run of text is deleted, it will not produce same result. Program B is designed as short ...
From Text to 1337!
1337/L33T/Leet is a language in which letters are replaced by symbols and numbers. You must write a program to do this automatically.
Rules
Your program cannot utilise anything outside of its folder. Your program must work for all English letters.
Scoring
Your score is you...
AppleScript, 209 bytes
My only reconciliation is that I beat Brainfuck.
set a to(display dialog""default answer"")'s text returned
set n to a's characters's number
set o to""
repeat n
try
if not a's character n=a's character 1 then set o to a's character n&o
end
set n to n-1
end
o
How this works is that I take input through a, get the length of a and mark it as n, and set an output variable o. For every character that I find that does not contain the first character of a (a's character 1), I concatenate it to o. The final line prints o.
Encrypt a string with itself
Your goal is to encrypt a string with itself as follows:
Take an input, e.g. the string x
Replace all occurrences of the first character in string x with the last character of string x in string x, the result is the interim string a
Replace all occurrences of the s...
For this challenge, we are writing the time in the following form: hh:mm:ss
Some examples:
12:34:08
06:05:30
23:59:00
The challenge is to output the time after an amount of hours, minutes and seconds have elapsed, with as starting time 00:00:00. You can compare this with a timer ...
