Search Results
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 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
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 |
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
0
votes
Queueing With Friends
C# - 91 bytes
int[]r=new int[n/j-1];for(int i=1;i<n/j;i++){r[i-1]=i*j-x/2-1;}return(x%2==0)?r:new int[0];
0
votes
Predict the Bomb's Landing Point!
C#, 46 bytes
(a,b,c,d)=>a+c*(int)Math.Ceiling((double)b/d);
2
votes
Make me a square!
C#,50 bytes
a=>Console.Write(a+a+a+"\n"+a+" "+a+"\n"+a+a+a);
Test Case:
var f = new Action<string>(
a=>Console.Write(a+a+a+"\n"+a+" "+a+"\n"+a+a+a);
);
f("#");
0
votes
Find the polynomial
C#, 62 bytes
(a,b)=>{var r="";a++;while(b>0){r+=(b%a)+" ";b/=a;}return r;};