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 |
A popularity-contest is a competition where the answer with the highest vote tally (upvotes minus downvotes) wins. As these are frequently closed, read the tag info and post your challenge to the sandbox first.
3
votes
Constant output program
Javascript
var input = ~~prompt("Input an integer!");
if(Math.abs(input)<=Math.pow(2,31))
console.log("It's too small! (not bigger than 2^31 = "+Math.pow(2,31)+")");
else console.log("It's quite bi …
17
votes
Accepted
Write the prettiest bytebeat composition
(Signed 16-bit little endian, 8000Hz mono (--format=S16_LE))
Music
Much better than before! (although it's quite long)
main(t){for(;;t++)putchar(((7&(((t>>17)+1)>>2)+((t>>10)&1+2*(t>>18&1))*(("2346 …
6
votes
JAxH obfuscated method, not text
Dart
class Print{
var PrinT,print,prinT;
get PRint() => PrinT;
get pRInt() => 'A$prinT';
get pRint() => print;
set pRInt(PrinT){print=PrinT;}
set prInt(pRInt){prinT='n$pRInt';}
Print(pr …
3
votes
JAxH obfuscated method, not text
Javascript
eval('Acy419yt=12-14;'.split('').map(function(x){return String.fromCharCode(
0240-x.charCodeAt(0))}).join(''))[_]((___='splitulengthureverseujoinufilter'
.split('\x75'),function __(_){retu …
2
votes
99 Bottles Of Beer
Dart
class Bottle{
int _amount;
String _kind,_place;
get amount() => _amount;
set amount(int amt){
if(amt<0){
_amount = 99;
throw "Go to store and buy some more, ${toStr(true) …
17
votes
What's my name? Produce the name of the language indirectly
BrainFuck
Just for fun (I know this isn't related to the purpose of the task.), I wrote this code...
+++++[><-+-+-><><>++<><>+++++<>+<]>>>+
+>><<+<>+><<>+[><-<<+>>><>+<><>++<]>[-<<<
+>>>]+<<+<[><->> …