Skip to main content
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
Results tagged with
Search options not deleted user 409

Code-golf is a competition to solve a particular problem in the fewest bytes of source code.

1 vote

Find prime factors

Javascript (54) n=prompt()*1;for(i=2;n>1;n/=n%i?(++i,1):(alert(i),i));
aviraldg's user avatar
  • 199
2 votes

Uptime Progress Bar

Python (42) print('8'+int(input().split()[2])*"="+'D') Note: Python 3 used for reducing total character count.
aviraldg's user avatar
  • 199
2 votes

Implement an integer parser

Haskell - 51 69 chars p('-':n)= -p n p n=foldl(\v->(10*v-48+).fromEnum)0n
aviraldg's user avatar
  • 199
5 votes

Fibonacci function or sequence

JavaScript, 41 39 33 bytes (c=(a,b)=>alert(a)+c(b,a+b))(0,1)
aviraldg's user avatar
  • 199