New answers tagged

0

JavaScript, 63 Bytes, no infinite recursive s=>s[1]?Math.random()*2**31|eval("while(s>'!');"):'Hello World' bad network so no TIO link


0

Wren, 143 135 bytes I am not a good golfer... The RNG generates the same value each time because it is a pseudo-random number generator. Fn.new{|a| import"random"for Random if(a=="*+*"){ while(1){} }else System.write(a[0]==" "?Random.new(9).int((1<<31)-1):"Hello World") } Try it online!


0

Perl 5, 8 bytes say/ f/g Try it online!


0

Keg, 18 10 bytes ?( =[f=[0. Try it online! -8 bytes thanks to @A_ Answer History 18 Bytes ?(!2/|``++`f `=[0. Try it online!


1

Japt, 4 bytes èfù2 Try it It's not entirely clear what exactly we should be outputting so this may need to be ... ffù2 Try it Or even ... ffù2)ç Try it


0

Japt v2.0a0 -Q, 7 bytes f/ f/ ç Try it


1

WDC 65816 machine code, 22 bytes Hex: A2 00 9B B5 00 C9 20 D0 07 B5 01 C9 66 D0 01 5A E8 B5 00 D0 EE DB Disassembled: LDX #$00 TXY start: LDA $00,x CMP #$20 ; space BNE skip LDA $01,x CMP #$66 ; 'f' BNE skip PHY skip: INX LDA $00,x BNE start STP Assumes starting in 8-bit accumulator and index mode. (SEP ...


1

Retina, 5 4 bytes -1 byte thanks to @FryAmTheEggman L` f This creates the newline-separated list of all matches of the regex / f/. Try it online!


2

Python 3, 38 26 bytes lambda s:[0]*s.count(" f") Thanks to: - @A_ for saving me 12 bytes Try it online!


3

Pyth, 9 8 bytes *]0/z" f Try it online! Alternatively, to print nice falses: *]!1/z" f -1 byte thanks to @FryAmTheEggman


Top 50 recent answers are included