Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 57013

Code-golf is a competition to solve a particular problem in the fewest bytes of source code. If you want to score by characters instead of bytes, please state this explicitly in the challenge. If source code length is not the primary scoring criterion, consider using another tag instead.

3
votes
TI-BASIC, 35 34 bytes -1 byte from Misha Lavrov Prompt A,B Disp A,B cos(π(A>B For(I,A+Ans,B-Ans,Ans Disp I End
answered Nov 8 '18 by kamoroso94
1
vote
TI-BASIC, 80 bytes Repeat not(I int(8rand→I Disp sub("GRAY RED ORANGEYELLOWGREEN BLUE INDIGOVIOLET",6I+1,6)+" DUCK End
answered Mar 22 '18 by kamoroso94
3
votes
JavaScript (ES6), 112 bytes Takes input as a list of lists of lines, outputs a list of lines. s=>s.reduce((a,b)=>(i=a.findIndex(x=>(j=b.indexOf(x))>=0))<0?a.concat(b):a.slice(0,i+1).concat(b.slice(j …
answered Feb 22 '18 by kamoroso94
3
votes
JavaScript, 77 73 bytes n=>{p={};for(i=n;i--;p[i]=2);while(--p[n*Math.random()|0])i++;return i+2} Explanation var f = (n) => { var index; // used first to initialize pile, then as counter …
answered Aug 2 '16 by kamoroso94
0
votes
TI-BASIC, 31 bytes randInt(1,9→A randInt(1,9→B 10A+B Disp A,B,Ans,Ans²
answered Oct 31 '18 by kamoroso94
2
votes
TI-BASIC, 16 bytes The input and output are stored in Ans. Ans→X While Ans≠X^Ans X^Ans End
answered Jul 25 '17 by kamoroso94
0
votes
JavaScript, 160 146 141 bytes s=>{a=s[1];r="";l=s.split("\n");m=l.length;n=l[0].length;for(i=0;i<=m;i++){for(j=0;j<=n;j++)r+=!(i%m)&&j%n||i%m&&!(j%n)?a:" ";r+="\n"}return r}
answered Aug 14 '16 by kamoroso94
6
votes
TI-BASIC (TI-83/84+), 22 bytes Since the screen is black and white, we just need to test if the specified pixel is on or off and map that to black or white RGB. Also, the pixels are only accessible …
answered Dec 5 '18 by kamoroso94
1
vote
JavaScript (ES6), 86 bytes Outputs 0 for North, 1 for East, 2 for South, and 3 for West. //// _// //// =// _=>0//>// ////1// // // //3//// //>//2>=_ //= //// //_ //// const source = ` …
answered Aug 5 '17 by kamoroso94
0
votes
JavaScript, 33 32 bytes f=([c,...s]='f='+f)=>c?f(s)+c:'' Recursively reverses the string by first providing the quine as the default argument. This beats the syntax error version, which isn't even …
answered Feb 27 by kamoroso94
1
vote
JavaScript (ES6), 20+12=32 bytes To Decimal p=>parseFloat(p)/100 To Percentage d=>d*100+'%'
answered Jul 2 '17 by kamoroso94
1
vote
JavaScript, 45 bytes s=>[...s].filter(c=>s.match(c+'.*'+c)).join``
answered Feb 25 by kamoroso94
0
votes
JavaScript (ES8), 52 bytes Takes a url as an argument and returns a promise that resolves to true if the file isn't empty and contains no null bytes. async p=>!/\0|^$/.test(await(await fetch(p)).tex …
answered Aug 30 '18 by kamoroso94
1
vote
TI-BASIC, 36 bytes Initial wait period is 1 second. 1→L Input Str1 checkTmr(0→T While 1 While L>checkTmr(T End Disp Str1 2L→L End
answered May 9 '17 by kamoroso94
2
votes
JavaScript (ES6), 48 bytes s=>(a=s.split` `,a.every(l=>l.length==a.length))
answered Jun 6 '17 by kamoroso94

15 30 50 per page