celtschk‭

Looping counter Create an infinite loop that outputs lines of asterisks, with each line containing one more asterisk. Instead of the asterisk, any printable, non-whitespace character can be used. ...

21 answers  ·  posted 3y ago by celtschk‭  ·  last activity 1y ago by xrs‭

An integer is called square-free if it is not a multiple of a perfect square other than 1. For example, 42 is square-free, but 44 is not because it is a multiple of the perfect square 4 = 2². Your...

13 answers  ·  posted 4y ago by celtschk‭  ·  last activity 3y ago by Shaggy‭

C (gcc), 113 Bytes i;main(){while(i++<100){char*h[]={"%d "," "},**p=h;i%3||(*p++="Fizz%2$s");i%5||(*p="Buzz ");printf(*h,i,h[1]);}} This compiles with several warnings, but no errors. Here'...

posted 5y ago by celtschk‭  ·  edited 5y ago by celtschk‭

A while ago I wrote an answer in C (gcc) to the FizzBuzz challenge. Now I've found a shorter solution for the same compiler, which however uses a completely different strategy. Now I wonder if I s...

1 answer  ·  posted 4y ago by celtschk‭  ·  edited 2y ago by trichoplax‭

Given a string and a non-negative integer $n$, output a new string in which each character is repeated $n$ times. Test cases: "abc", 1 -> "abc" "Hello", 0 -> "" "double", 2 -> "ddo...

posted 4y ago by celtschk‭  ·  edited 2y ago by trichoplax‭

Given a string and a non-negative integer $n$, output a new string in which each character is repeated $n$ times. Test cases: "abc", 1 -> "abc" "Hello", 0 -> "" "double", 2 -> "ddo...

14 answers  ·  posted 4y ago by celtschk‭  ·  last activity 4y ago by south‭

Rational numbers in decimal representation can have an infinite periodic part. One common way to write this down is to repeat the periodic digits and then add three dots. Numbers without those thre...

2 answers  ·  posted 4y ago by celtschk‭  ·  edited 4y ago by General Sebast1an‭

C (gcc), 133 131 bytes f(p,s){char*t="Hole in one\0Albatross\0Eagle\0Birdie\0Par\0Bogey\0Double bogey\0Triple bogey";for(--s?s+=5-p:0;s-=!*t++;);puts(t);} Saved two bytes thanks to m90 in the...

posted 4y ago by celtschk‭  ·  edited 4y ago by celtschk‭

The task is to generate the text of Lewis Caroll's Jabberwocky. The text, quoted from Wikipedia, is as follows (I've replaced a non-ASCII character with ASCII, otherwise it's direct copy&paste...

4 answers  ·  posted 5y ago by celtschk‭  ·  last activity 4y ago by General Sebast1an‭

C (gcc), 35 32 bytes Saved 3 bytes thanks to Lundin f(n){n&&f(n/2);putchar(n&1|48);} This solution exploits that leading zeros, while not required, are also not forbidden by the ...

posted 4y ago by celtschk‭  ·  edited 4y ago by celtschk‭

[Rule 110] is a Turing complete cellular automaton. It is defined as follows: Take as initial value a sequence of symbols that's infinite to both sides, which consists only of two different symbol...

1 answer  ·  posted 4y ago by celtschk‭  ·  last activity 4y ago by Moshi‭

If you print some string s without a newline character at the end, instead of print(s,end="") write print(end=s) to save two bytes. Note that this only works for strings, not for other typ...

posted 4y ago by celtschk‭  ·  edited 4y ago by General Sebast1an‭

Rational numbers in decimal representation can have an infinite periodic part. One common way to write this down is to repeat the periodic digits and then add three dots. Numbers without those thre...

posted 4y ago by celtschk‭  ·  edited 2y ago by trichoplax‭

Bash, 20 18 bytes Saved two bytes by removing the quotes; the code works well without them. echo Hello, `cat`! Try it online!

posted 4y ago by celtschk‭  ·  edited 3y ago by celtschk‭

Run-length encoding is a simple compression technique which compresses sequences of repeating identical bytes. The encoding rules for this task are as follows: Any sequence of $n$ identical bytes...

posted 5y ago by celtschk‭  ·  edited 2y ago by trichoplax‭