Search
Ruby, 36 bytes ->a{i=-1;a.map{a[0..i+=1].count _1}} Try it online! The code in the TIO link is 2 bytes longer because _n block parameter names are not supported on TIO's Ruby instance yet. ...
Assign ints before main(){} This is a combination of 2 golfing tricks. It's possible to write a program as just main(){}, though it will send a warning, not an error though, so it's still safe to ...
Canvas, cracked by Shaggy, 129 bytes /bin/bash > echo "Cops and Robbers"; #Testing, testing 1 2 3 Segmentation Fault > echp "Cops and Robbers"; #Huh? Cops and Robbers This version of ...
Erlang (escript), 43 bytes - cracked by Shaggy main([])-> io:fwrite("Cops and Robbers"). Printing Cops and Robbers as the challenge says. Try it online!
Rockstar, 19 bytes say "Hello, World!" Try it here (Code will need to be pasted in)
C# (.NET Core), 67 bytes class a{static void Main(){System.Console.Write("Hello, World!");}} Try it online!
Verbosity, 512 bytes, cracked by Moshi Include<Integer> Include<MetaFunctions> Include<Output> Include<String> Integer:DefineVariable<IntegerOne; 1> Output:Def...
Cracks Kevin M. Mansour's answer: Erlang Searched for languages that use fwrite, no joy. Searched for io:fwrite, got it instantly main([])-> io:fwrite("Cops and Robbers"). Try it onli...
Scala, 18 bytes x=>_.:\(.0)(_+_*x) Try it online! Not too complicated. Takes the list of coefficients and folds from the right, multiplying the accumulator by x each time and adding the nex...
Cracks Mark Girrafe's answer: PicoLisp A sneaky search of TIO's GitHub org revealed this one ;) (prinl "Cops and Robbers")(bye) Try it online!
C (clang), 189 181 176 173 bytes i,n,x,y;main(){scanf("%i",&x);y=1,n=10001;int z[n];for(i=0;i<n;i++,y++){z[i]=pow(y,2);}for(i=0;i<n;i++){if(x==z[i]){puts("True");break;}if(x!=z[i]&...
Sclipting, (UTF-16) 8 bytes 根❶圜同 Takes the square root, pushes a copy, rounds the copy, and compares. Basically, checks that the square root is an integer.
Sclipting, (UTF-16) 238 bytes 눰 감下❶貶下標⓶긆깯덇끬뉗꼠닶눠눦녥댠❷감侔是검摧終併終❷긆뭮긇끨뉒걷눖롬 껂밀⓹껠뙔눖띥긆뭮뉒걤닷덮긆굮뉂거눗꽳긆땴긆굲닷녮뉂렠⓺❺껠똊終棄棄껠뙇닲건닲건늆넠댷끯댦넠눖멤긆깵뎒걳닶륥긆륯댦넬긃딹긆깯덇끬뉗꼠닶눠눦녥댢걯닢건늆넠덶구닂밎 Explanation 눰 감下 For n from 99 down to 1 ...
JavaScript (Node.js), 228 224 bytes -4 bytes thanks to Hakerh400 (b=n=>`${n} bottle${n-1?'s':''} of beer`,w=' on the wall')=>[...Array(99)].map((_,i)=>`${b(i=99-i)}${w}, ${b(i)}. `+(--i...
Japt, 117 116 115 bytes Needs more golfing or, perhaps, a completely different approach. Borrows a couple of tricks trick from ETHProductions' original version. Includes 2 trailing newlines. ´LÇ...
brainfuck, cracked by Aaron Miller, 243 bytes void main(x,y)->{ printf=io.write(z=x-y); printf("+++++[++++>---<]>.+[--->+<]>+++.+.+++.+[---->+<]>+++.[->+++<]&...
Jelly, cracked by m90 13 bytes Should be pretty simple - I'm running out of ideas; one of the downsides of only golfing in 2 languages! “¿×⁶ṆḶN{N=ȷṾ» Try it online!
HTML, 31 Bytes <HTML style="background:black"> The best solution is frequently the easiest one.
Jelly, 45 bytes L‘ḃ5MḢ;‘$œṖƲḅ5aị¥⁸N1¦Sṭ “¢¦½2d‘Çȷ6¡iḃ5ị“IVXLC Try it online! A pair of links that takes an integer as its argument and returns a string with the shortest generalised Roman num...
Find the shortest representation of an integer in generalised Roman numerals. Since there is more than one way to generalise, only the following definition applies to this challenge. Definition T...
Haskell, 62 bytes (\n->(scanl(*)1$cycle[5,2])!!(length$takeWhile(/=n)"IVXLCDM")) No import needed. It just uses standard Prelude functions. scanl(*)1$cycle[5,2] will give you the infinit...
Swift, 114 bytes func y(x:String)->Int?{return ["I":1,"V":5,"X":10,"L":50,"C":100,"D":500,"M":1000].filter{$0.key==x}.first?.value} Try it online! Explanation + Non-Golfed Version The no...
Python 3, 149 bytes g=lambda r:r>1and g(r-1)+g(r-2)or r lambda n:[i for(i)in map(g,range(2*n+2))if(lambda*l:all(abs(n-i)!=1for(n,i)in zip(l,l[1:])))(*map(int,str(i)))][n] Try it online! ...
