Sandbox for Proposed Challenges

Question

This "sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to main. This is useful because writing a clear and fully specified challenge on your first try can be difficult, and there is a much better chance of your challenge being well received if you post it in the sandbox first.

Sandbox FAQ

Posting

To post to the sandbox, scroll to the bottom of this page and click "Answer This Question". Click "OK" when it asks if you really want to add another answer.

Write your challenge just as you would when actually posting it, though you can optionally add a title at the top. You may also add some notes about specific things you would like to clarify before posting it. Other users will help you improve your challenge by rating and discussing it.

When you think your challenge is ready for the public, go ahead and post it, and replace the post here with a link to the challenge and delete the sandbox post.

Discussion

The purpose of the sandbox is to give and receive feedback on posts. If you want to, feel free to give feedback to any posts you see here. Important things to comment about can include:

• Parts of the challenge you found unclear
• Comments addressing specific points mentioned in the proposal
• Problems that could make the challenge uninteresting or unfit for the site

You don't need any qualifications to review sandbox posts. The target audience of most of these challenges is code golfers like you, so anything you find unclear will probably be unclear to others.

If you think one of your posts requires more feedback, but it's been ignored, you can ask for feedback in The Nineteenth Byte. It's not only allowed, but highly recommended! Be patient and try not to nag people though, you might have to ask multiple times.

It is recommended to leave your posts in the sandbox for at least several days, and until it receives upvotes and any feedback has been addressed.

Other

Search the sandbox / Browse your pending proposals

The sandbox works best if you sort posts by active.

To add an inline tag to a proposal, use shortcut link syntax with a prefix: [tag:king-of-the-hill]. To search for posts with a certain tag, include the name in quotes: "king-of-the-hill".

Answer 1

Create a "Transpiler"

for the purpose of this challenge, a transpiler is any program that takes valid source code from one language as input and produces a program valid in another language that performs the same actions. Calling the original languages interpreter is not banned.

Posts should start with "SRCLANG to DSTLANG in LANG; X bytes" as a heading.

Here's an example post:

Shell to Ruby in Ruby; 41 bytes

puts'`bash #{Data}`
__END__
'+STDIN.read

Here we use the somewhat obscure Data constant to embed arbitrary data in the program. this has the advantage of never having to escape anything.

Each "triple" of source, destination, and working language represents its own category, as this challenge varies greatly in difficulty depending on the languages used.

Answer 2

I have the following code. Help me make it code shorter.

new Promise(r=>r(URL.createObjectURL(new Blob(['<h1>Example</h1>'],{type:'text/html'})))).then(u=>open(u)&&setTimeout(t=>URL.revokeObjectURL(u),2e3))

The Catch:

• This has to be in JavaScript
• It cannot contain semicolons
• It must be a "one-liner"
• It must have the same steps as the code above:
  1. Create a blob URL from a blob
  2. Open a browser window of the blob URL
  3. Revoke the blob URL

Extras

• The winner will be decided by the shortest amount of bytes
• If you try this in another language, you will still get an upvote

Answer 3

pi optimized-output

Most digits of Pi in a hundred bytes

Answer 4

Reinvent math

The task is simple. Define the basic operators (+, -, *, /) without using them directly.

Also banned:

• any add-assign (+=) and its equivalents
• basically anything intended to be used as a basic arithmetic operation

Program should consist of at least 4 binary functions, one for each operation. they may call other functions defined in your program, including each other. The types of the arguments to the function may be any types that the basic arithmetic operators work on, except for types that are less than 3 bits in size.

Shortest code wins

Answer 5

Enumerate all possible IPv4 addresses

Title might make the challenge hard, but it's easy.

You have to print all the possible IPv4 addresses from 0.0.0.0 to 255.255.255.255

Standard loopholes apply, no internet usage for this

Tags: code-golf,kolmogorov-complexity,string

Answer 6

Google search

Challenge is very simple, you have to get a string as input and then launch the default web browser, and search for that string in Google.

Input string will have only characters a-zA-Z

Google search URL is google.com/search?q=querystring

Standard loopholes apply, Internet connection allowed, but only to google.com domain

Tags: code-golf,internet

---

Author note: challenge title sucks, please improve it!

Answer 7

Reverse error quine

code-golf,quine

Based on this

Write a quine that prints it own source code in reverse, but to STDERR.

Penalties

• +200 using other files I.E. reverse.txt
• +150 internet usage
• +100 reading own source code

Rules

• Minimum length of source is 2 bytes

• Standard loopholes apply

code-golf, shortest code wins

Answer 8

“Simple” Programming Homework

code-golf restricted-source

---

Your friend has been caught sleeping in class again! As punishment, his computer science teacher has assigned him homework, knowing that he will not be able to solve it due to not having paid any attention.

The assignment seems deceiving simple at first; all that is required is to output the string:

John Doe

Unfortunately, the teacher is intent on making the simple assignment much more difficult. Since your friend was not listening when the teacher explained the concept of strings and numbers, the teacher forbids him from using any number character (0-9) or the quotes (", ', `).

Can you help your friend solve this problem with the shortest code possible, and save his computer science grade in the process?

Try to find the shortest code in each language!

_{Note: it is encouraged to try to solve this problem in languages where string/character literals exist but cannot be used due to the restrictions (most mainstream languages are like this, e.g. C++).}

Answer 9

Geometry Dash Clone in a weird Way?

code-challenge cloning-games

Try to make a functional clone of Geometry Dash in the shortest time.

How GD Works.

• You have a cube. In the clone, it can be as small as you want, but no bigger than 2x2.
• You have to jump over spikes. The key to do this is (preferably) the up arrow key, but can be any option you want (simply tell me in your answer what key is it.
• If you touch the spikes, the screen says "Game Over." and exits in 3 seconds.
• There are blocks! You can jump on them, but touching them from the left side results in the same thing that happens if you touch the spikes.
• A song plays in the background. How you do this is up to you.

Rules:

1. 3 Extra points for working forwards and backwards.
2. Must have the letter a 5-7 times and no q at all!
3. Allows ascii art type output and text input (standard input)!

Sandbox Questions

How is this even going to work?

Answer 10

Get Floor of N ^ (3 / 2)

Your task is very simple:

Get The Floor of N ^ (3 / 2)

OEIS

This is Code Golf so the winner wins

Test Cases

0 => 0
1 => 1
2 => 2
3 => 5
4 => 8
5 => 11
10 => 31
13 => 46
27 => 140
33 => 189
49 => 343
68 => 560
89 => 839
98 => 970
100 => 1000
136 => 1586
256 => 4096
500 => 11180
147385 => 56582212

Meta

• Any feedback?

Answer 11

Who Loses The number guessing game?

You are playing a number guessing game. You know everyone's guesses, and who won, and want to figure out who was in last place.

Task

Your task is to take a dictionary of guesses as input, along with the name of the winner. You should then return the name of the player whose guess was the farthest from the winner's, or if there are multiple, the lowest.

A input:

[{"Joe": 800, "Mama": 1000, "Biden": 1200}, "Joe"]

Means that the aproxximate score winner is Joe, The next is Mama, Mama is greater than Joe and Mama is greater than Biden.

So the loser is Biden.

All guesses are guaranteed to be unique

Test cases

[{"A": 100, "B": 200, "C": 300}, "A"] => "C"
[{"Hello": 200, "World": 201}, "World"] => "Hello"
[{"Blah": 210, "Bruh": 984, "Boo": 314}, "Boo"] => "Bruh"
[{"A": 6, "B": 7, "C": 666, "D": 1000}, "C"] => "A"
[{"AC": 100, "BE": 200, "CE": 300}, "B"] => "CE"

Meta

• Any feedback?

• Dupe?

Answer 12

Convert decimal to unary in fewest regex codes code-challengeregular-expression

Your task is to Convert decimal to undary in fewest regex codes

Every regex code is substitution mode.

The regex code counts the regex code, without test string and Substitution code

A example

^2, |11
^3, |111
^4, |1111
...
\|, <empty>

This scores infinity, But don't try this.

Rules

• Your score is always non-infinity

• Any flavor is allowed.

• Your score is the number of regex codes

• every length of regex code is non-infinite

Meta

• Any feedback?

Answer 13

Nth Eights Challenge

Inputs:

There are 2 inputs: The amount of eights to be used in the calculation, and the number to solve for.

What to solve:

The program needs to insert operators in between each eight, so when the newly created equation is calculated, the answer is the number that was trying to be solved for. When the equation is calculated, there is no operator priority.

Rules:

The only operators allowed are:

+
-
*
/
(And parentheses)

You may insert multiple operators between each number. No extra numbers are allowed. There must be an operator inserted in between each 8. The answer must be displayed when the program finishes.

Examples:

#User inputs
Amount of eights: 4
Solve for: 15

#Answer
8+8-8/8

#User inputs
Amount of eights: 4
Solve for: 10

#Answer
(8+8)/8+8

Winning Criteria:

The winning criteria is for the program written in the least amount of characters.

Answer 14

Get the Nth line

Challenge

Let's have a file f and a number n. Your task is to get the nth line from the file.

Constrains

• file f exists and has at least n lines
• you can index lines from 0 or 1, whichever you prefer

Example

• input: n = 2 (indexing from 1) and content of file f is:

foo
bar
baz

• output: bar

Rules

• this is code-golf challenge, so the shortest code wins
• standard rules apply for your answer with default I/O rules, so you are allowed to use stdin/stdout, functions/method with the proper parameters and return-type, full programs
• default Loopholes are forbidden.

Answer 15

Knight mover

Your task is to move a chess knight between the points B and E.

A chess knight moves in an L shaped pattern, like so:

.X.X.
X...X
..B..
X...X
.X.X.

The Xs mark where the knight in position B can move.

There may be other chess pieces on the board, blocking the knight's movement, but for clarity, you will only be notified of where you cannot go by # characters. You cannot land on these marked spaces, but you can go over them. You also cannot go outside of the board.

Your goal is to find how many turns N are needed to go from B to E, or return -1 if it can't be done.

Input & Output

• You are given 2 integers W and H giving the width and height of the board
• For the next H lines, you are given a row of the board, containing the characters B, E, . and #
• You are allowed to take in the input as a WxH board as a list of strings or a character matrix

Test case

3 2
..E
B..
->
1


5 5
B...E
..#..
.....
.....
.....
->
4


7 5
B..###.
####.##
...###E
..#.#.#
.#..#..
->
4


8 8
....#...
....##..
..E..#..
#...##..
.###....
........
........
.....B..
->
6

This is code-golf, so shortest code wins!

Credits to this puzzle

Answer 16

Game of GO

Go is an abstract strategy board game for two players, in which the aim is to surround more territory than the opponent.

Given a board (where some stones are already added) and a list of moves to be executed next, check whether the moves are valid and (if they are valid) execute them.

After executing all moves in the list the expected output is either not valid if at least one of the moves is invalid, or the new state of the board after all moves were executed.

Rules of Go:

• Two players place stones of their color (by turns)
• If a stone is completely surrounded by stones of the other player (or by the edge of the field) this stone is beaten and is removed from the board
• If stones of the same color are placed next to each other they build a group
• If the group is completely surrounded by stones of the other player (or by the edge of the fields) this group is beaten and all of its stones are removed from the board
• A stone can be placed on every free field on the board except for:

A position in which it would be completely surrounded by the stones of the other player (no suicidal moves allowed). Except this move beats some other stones which leads to it not being surrounded anymore

A position that would create the same board that was there before the other player made his move (to prevent an infinite loop of killing stones) which is named KO-rule (see a test case for an example)

• Points (which are not important for this puzzle) are made by empty fields that are surrounded by the stones of a player or by enemy stones that are beaten

For a more detailed description please visit here

Input & Output

• You are first given an integer S for the size of the field (the field is a square of S×S)
• You are then given an integer M for the number of moves that are to be made on the board
• You are then given a line of the board where . is an empty field, B is a field with a black stone and W is a field with a white stone on it (each line contains S characters) for the next S lines
• You are then given a move that is described by the player color, and the position (separated by a space character)
• Output the expected output, else output any character you want
• You are allowed to output the board as a matrix/list
• You may assume the initial board state in the input is always valid
• You are allowed to take in the input as a list/array of lines and moves

Testcases

5
5
.....
.....
.....
.....
.....
B 2 2
W 2 3
B 3 2
W 3 4
B 4 3
->
.....
.....
..BW.
..B.W
...B.


5
7
BB...
B....
.....
...W.
.....
B 3 2
W 0 2
B 3 4
W 2 0
B 2 3
W 1 1
B 4 3
->
..W..
.W...
W..B.
..B.B
...B.


5
1
.....
.....
..B..
.....
.....
B 2 2
->
0


5
5
.BW..
BW...
.W...
.....
.....
B 3 4
W 4 4
B 3 3
W 2 0
B 0 0
->
0


5
3
..B..
.B.B.
.WBW.
.BW..
.....
B 3 3
W 1 2
B 2 2
->
0


5
7
.B...
BW...
WB..W
...W.
...BW
B 3 4
W 0 2
B 0 3
W 0 0
B 1 2
W 0 1
B 1 0
->
...B.
B.B..
WB..W
...WB
...B.

This is code-golf, so shortest code wins!

Credits to this puzzle

Answer 17

Beaker drawing

Your task is to output the following beaker with the volume n:

_
 %      %
%       %
%       %
%       %
%       %
%%%%%%%%%

You are the fill n spaces of the beaker above, so n=5 looks like this

_
 %      %
%       %
%       %
%       %
%-----  %
%%%%%%%%%

Even though this defies the law of physics, you are to output the beaker with the liquid of n volume. The volume of the beaker is 35. The first 4 layers have a volume of 7 and the top has a layer of 6, and the _ represents an additional volume of 1 if the beaker overspills.

Test cases

34
->
_
 %------%
%-------%
%-------%
%-------%
%-------%
%%%%%%%%%

35
->
-
 %------%
%-------%
%-------%
%-------%
%-------%
%%%%%%%%%
(Note the `_` becomes a `-`)

15
->
_
 %      %
%       %
%-      %
%-------%
%-------%
%%%%%%%%%

You may assume n is positive (can be 0)

You may assume the beaker can overspill

You may perform the "flood fill" from left to right bottom to top or right to left bottom to top.

This is code-golf, so shortest code wins!

Answer 18

Play an audio file code-golf audio

---

Challenge

Your challenge is simple: play an audio file at a given path. Your program will take the file path as input and will play it once and quit.

To make this harder, however, you are not allowed to use external libraries, but modules that are part of your language's standard library (such as ctypes below) are allowed.

Rules

• Standard loopholes are forbidden.
• You may assume (a) specific operating system(s) and/or (a) specific file format(s).
• You may assume an absolute path.
• You do not have to hear the sound every time; you are not expected to unmute muted speakers, and you can play through whichever audio device is the most convenient. However, it must be possible to hear it every time you run it with certain settings. A window such as Control Panel -> Sound -> Playback on Windows must always be able to "show" the sound being played under at least one audio device. You are allowed to play the file under a different device each run.
• Your program must be able to play at least one of the audio file formats listed on Wikipedia. Other formats are allowed, as long as one of the formats listed there is supported.
• Outputting any content to any stream, file, etc. is allowed, but the sound must be played.
• Please explain your answer. This is not necessary, but it makes it easier for others to understand.
• Languages newer than the question are allowed. This means you could create your own language where it would be trivial to do this, but don't expect any upvotes.
• This is code-golf, so shortest code in bytes wins!

Reference implementaion (ungolfed, Python 3, Windows only, .wav only)

# -*- coding: utf_8 -*-

from ctypes import windll

winmm = windll.winmm
audio_file = input('Audio file path: ').encode('utf_8')

winmm.PlaySound(audio_file, 0, 131072)

Golfed reference implementation

import ctypes;ctypes.windll.winmm.PlaySoundW(input(),0,131072)

Answer 19

Visualize tag progress

code-golf ascii-art

Task is pretty simple. Given non-negative positive integers 0 ≤ s ≤ 1000 and 0 ≤ a ≤ 200, your code should draw following progress bars.

Examples

When s ≤ 100 or a ≤ 20:

Input:15 12
Output: 
15/100 score
++++++------------------------------------
12/20 answers
+++++++++++++++++++++++++-----------------

Input:3 1
Output: 
3/100 score
+-----------------------------------------
1/20 answers
------------------------------------------
  
Input:85 35
Output: 
85/100 score
+++++++++++++++++++++++++++++++++++-------
35/20 answers
++++++++++++++++++++++++++++++++++++++++++

When (s > 100 and a > 20) and (s ≤ 400 or a ≤ 80):

Input:156 43
Output: 
156/400 score
++++++++++++++++--------------------------
43/80 answers
++++++++++++++++++++++--------------------
  
Input:666 66
Output: 
666/400 score
++++++++++++++++++++++++++++++++++++++++++
66/80 answers
++++++++++++++++++++++++++++++++++--------

When (s > 400 and a > 80) and (s ≤ 1000 and a ≤ 200):

Input:999 85
Output: 
999/1000 score
+++++++++++++++++++++++++++++++++++++++++-
85/200 answers
+++++++++++++++++-------------------------

Input:666 194
Output: 
666/1000 score
+++++++++++++++++++++++++++---------------
194/200 answers
++++++++++++++++++++++++++++++++++++++++--

The number of +'s in each bar is equal to the value of a or s divided by its max value (max values for s are 100, 400, 1000 and for a are 20, 80, 100, the choice of max values ​​depends on the ranges in which the values ​​of a and s fall.), multiplied by 42 and rounded down. This number cannot be more than 42.
The number of -'s is equal to 42 minus the number of +'s.

End etc. Trailing spaces are allowed. Additional newlines are not allowed.

This is a code-golf challenge so the shortest solution wins.

Meta

I realized that I myself got confused in my task :) ... so this task will be in completion until this text is deleted.

Answer 20

Your task is to create an approximation for sin(x) in the fewest characters possible.

• Given the approximation s(x), it must satisfy 0.95 * sin(x) <= s(x) <= 1.05 * sin(x)

The entry with the fewest characters wins.

Answer 21

Draw the Swedish coat of arms

Or rather, assemble it. A coat of arms is specified not my its physical representation on Wikipedia or any other source, but by its blazon: a formal, pseudo-French listing of its components and their position. I'll explain the blazon, and it is your job to draw it out and display it.

Different from many questions on this site; accessing the internet is allowed. You can load files from websites under certain conditions, and only for charges. The reasoning is that, when the blazon specifies that this shield has a yellow lion, any yellow lion is in fact equally fine. That's how it worked historically, and that's how it will work for this challenge.

Blazon	English
A shield azure	You start with a shield, coloured fully in blue. My only requirements for "shield" is that it is a square or rectangle, with the top two corners being sharp, the bottom two corners being rounded, and in the middle of the bottom there's a marked point.
quartered by a cross Or with outbent arms,	A cross divides this shield in four sections. The cross should be yellow or gold, and the arms should get wider as you get farther from the center. Those arms should reach the edges of the shield but not visibly exceed it.
an inescutcheon containing the dynastic arms of the Royal House.	A smaller shield goes on top of it all. We'll get to that.
In the first and fourth fields three open crowns Or, placed two above one.	The top-left and bottom-right quarters of the large shield contain three identical yellow/golden open crowns (a crown leaving the top of the head bare, with no hoops or cap); placed so that two of them are side by side above the third, which is horizontally centered between the two.
In the second and third fields	In the top-right and bottom left quarters...
three sinisterbendwise streams argent,	The background should contain three parallel wavy lines that go from top-right to bottom left; they should be white/silver/grey. The lines should be roughly evenly arranged, i.e. not on top of each other.
a lion crowned with an open crown Or armed gules.	Atop that background goes a yellow/golden lion, wearing a yellow/golden open crown, and the lion should have red nails.
The inescutcheon	Now we get to the smaller shield on top of it all...
is party per pale	Divided horizontally in two
the arms for the House of Vasa	In the left half you have:
(Bendwise azure, argent and gules	A background diagonally (top-left to bottom-right) divided in three sections, top-to-bottom blue, white/silver/grey, red;
a vasa Or);	atop that is a yellow/golden vasa which is a sheaf of bundled straw.
and the House of Bernadotte	In the right half, you have:
(Azure,	Blue background;
issuant from a wavy base a bridge with three arches and two towers embattled argent,	The bottom part should be "wavy", e.g. resemble a water surface (with no specifications for colour). From the water (or from behind the water) there's a white/grey/silver bridge that must have three arches, two towers, and crenellations.
in honor point	Above that bridge:
an eagle regardant with wings inverted resting on thunderbolts Or,	A heraldic eagle looking to the objective left, to the eagle's right. The wings should be pointed down. Below its feet should be some depiction of thunderbolts. All of this in gold/yellow.
and in chief the Big Dipper constellation of the same).	Above the eagle, the eight stars of Big Dipper constellation, also gold/yellow.

As said you can load up charges from external sources. Charges are objects that sit atop the background, like eagles, stars, crosses. Loading them follows some rules:

• You cannot load multiple charges at once; so the thunderbolts, eagle, and Big Dipper should all be separate objects (you can however load the eight stars of Big Dipper as one object; and you don't have to load up the lion's red nails separately from the lion).
• Any added images can be whatever format you want; jpg, svg, animated gifs...
• Charges having a transparent background is encouraged but not required; what is required is that every element be clearly identifiable, including background colours/patterns.
• Files can be loaded from any website not hosted by yourself (or by your friend for that matter).
• Using url shorteners is not allowed.

Of course drawing them yourself is also allowed. There's no requirement for using any specific exact colours either; as long as the colours you use are recognisable under the English names I gave. Finally, charges should not bleed out of their shields/quarters or overlap one another where not specified. As in the example, the small shield is allowed to overlap the background elements slightly.

Output should be at least 400 pixels wide.

---

Sandbox

I am unsure what scoring criterion to use. code-golf is my go-to but I want to reward shields that look recognisable, specifically that are creative. Would popularity-contest work?

Answer 22

Longest Possible Pythagorean Triple Triangle

code-golf math arithmetic

A Pythagorean triple is a set of 3 integers \$\{a, b, c\}\$ where \$a^2 + b^2 = c^2\$. Your task is to, given an integer \$n\$ where \$3 ≤ n ≤ 15\$, output a Pythagorean triple using these rules:

• If \$n\$ is odd, output \$\{n, \frac{n^2-1}{2}, \frac{n^2+1}{2}\}\$.
• If \$n\$ is even, output \$\{n, \frac{n^2}{4}-1, \frac{n^2}{4}+1\}\$.

With these rules, the difference between the lengths of the longest leg and the hypotenuse is minimized.

Rules

• Input and output can be in any convenient format.
• The output does not have to be in any particular order.
• Standard loopholes are forbidden.
• This is code-golf, so the shortest code in bytes wins.

Test cases

Input | Output
------+-------
3     | 3 4 5
4     | 4 3 5
5     | 5 12 13
6     | 6 8 10
7     | 7 24 25
8     | 8 15 17
9     | 9 40 41
10    | 10 24 26
11    | 11 60 61
12    | 12 35 37
13    | 13 84 85
14    | 14 48 50
15    | 15 112 113

See A055523 and A055524.

Answer 23

Repeat Hello World according to another string's length

Answer 24

Take one of two distinct, consistent values of your choice. For one input, check if the input is prime. For another input, check if the input is a square.

Standard loophole apply except input complete or partial functions, which is replaced with

No input results in an infinite loop.

Answer 25

Munge my Text code-golf string random

Inspired by this example in the Python documentation.

Write a program that takes as input a string of arbitrary length and returns a version of that string with every letter, except the first and last, of every word randomly shuffled. "Word" is defined here as a contiguous set of alphabetical characters separated by one or more spaces or punctuation marks (!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~).

Examples

Input: Professor Abdolmalek, please report your absences promptly.
Possible output: Poefsrosr Aealmlobdk, pslaee reorpt your abnseces plmrptoy.

META TODO: Add more examples

This is code-golf, so shortest answer wins!

Answer 26

Fibonacci before the zero - Dublicate of Negative Fibonacci Numbers

Answer 27

See Those Sorts

popularity-contestsorting

Using shapes or Unicode, show how some array of numbers is sorted with a particular sorting method. You should include selection sort, merge sort, bubble sort, quick sort, bogo sort, and at least one other sort you find interesting (maybe try one of these).

Make sure that the speed of the sort corresponds to the actual performance on your computer. You can try adding a constant multiplier to the speed if you want.

^{Someone watched sort videos :)}

Answer 28

You're a programming language, right?

According to CGCC, for something to be considered a programming language, it must be capable of addition and primality testing. This challenge combines them into one.

Challenge

You must write a programme that takes 2 natural numbers (including 0) as input, checks if the sum of the numbers is prime, and prints the result. Input and output may be in any reasonable format.

Testcases:

2,3 -> True
3,6 -> False
0,1 -> False (1 is not prime by definition)
7,6 -> True
37,81 -> False
37,82 -> False
1,1 -> True
5,8 -> True

Note that True and False can be substituted with another reasonable representation, like 1 and 0, or T and F. Remember, this is code-golf, so standard code-golf rules apply.

code-golfmath

Answer 29

Output the number of lines of your code

Your task is to write a program that counts the number of its lines of code and outputs them.

Specs:

• The number mustn't be hardcoded into the program, nor in any other external resource;

• Internet access is forbidden;

• Your program's output must be the number of lines only;

• Your program should not use any tool, macro, function, or similar device designed with the specific purpose of counting lines.

popularity-contest

Answer 30

Here is my first attempt at a cops and robbers post (which is why I'm using the sandbox).

---

Cops - Golfed recursion

You must select a language that satisfies the following criteria:

• Functions - It must be possible to create a function with any number of integer input values and a single integer output (or return) value. The function may also be a complete program in itself. (Your language may not call it a function, but that is ok)
• Arithmetic operations - The integer operations +-*/% should all be possible, either in a simple or a complicated manner.
• Data - You should be able to store one-byte or two-byte long integers (either signed or unsigned will do). You may do this also in an indirect manner.
• Iteration - You must be able to create a loop that will keep running until a condition is satisfied. Therefore < > = <= >= ! & | should also be supported, either directly or indirectly.
• Recursion - You should be able to call a function from within the function itself with a set of input values calculated by the main function.
• Declaration - You should be able to declare new integer variables as needed from within the function.

Task

You need to create a recursive function. Code will be scored by the number of characters in it, the shorter the better. A solved code cannot win the challenge. A post with less than 5 up-votes cannot win the challenge. There will be no overall winner, but a separate winner for each language.

Robbers - Golfed recursion

Your objective is to pick up a cop's post, and write a function in the same language but it should not use any recursion (can use iteration). The function may create any number of variables, loops, etc. but should be able to achieve the exact same end result (atleast, in theory) as the cop's one.

Your score will be the same as the cop's post's score at the time it was solved. His/her post is now invalid, and you get his/her score