Square a Number my Way. code-golf number
People keep telling me that the square of a number is the number multiplied by itself. This is obviously false. The correct way to square a number is to make it into a square, by stacking it on top of itself a number of times equal to its length, and th...
What general tips do you have for golfing in Nim? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to Nim (e.g. "remove comments" is not an answer).
Please post one tip per answer.
In the language Nim, the rules for differentiating identifiers are slightly more relaxed than most other languages. Two identifiers are equivalent or address the same variable if they follow these rules:
the first character of both are the same (case sensitive)
both strings are the same (case i...
Given a number n, print the nth prime Fermat number, where the nth Fermat number is 22n+1. This code should theoretically work for any n (i.e. don't hardcode it), although it is not expected to terminate for n > 4.
Test cases
0 -> 3
1 -> 5
2 -> 17
3 -> 257
4 -> 65537
Rules
Standard loophole...
Language of a Simple Context-Free Grammar
code-golf grammars
Given a list of production rules and start symbol of a proper context-free grammar (CFG) of printable characters, your program or function must output its formal language (the set of all sentences which can be constructed from it).
...
This is an answer chaining question that uses sequences from OEIS, and the length of the previous submission.
This answer chaining question will work in the following way:
I will post the first answer. All other solutions must stem from that.
The next user (let's call them userA) will find the...
JavaScript with UnderscoreJS, 20 Bytes
alert(_.range(1,11))
There is a Call Center which records number of complaints against a service on daily basis.
For example, below values show number of complaints for last 6 months for a service
Jan, Feb, Mar, Apr, May, Jun
020, 030, 010, 030, 045, 065
How can one find sudden increase/decrease in complaints fo...
Java, 1 :(
public class P{ static{ System.out.println("1"); }}
You will be given as input an integer k in the range from -4503599627370496 (-2^52) to 4503599627370496 (2^52). As is well known, integers in this range can be represented exactly as double-precision floating-point values.
You should output the Hamming weight (number of ones) of the encoding of ...
Given a list of non-negative integers in any reasonable format, iterate over it, skipping as many elements as every integer you step on says.
Here is a worked example:
[0, 1, 0, 2, 5, 1, 3, 1, 6, 2] | []
^ First element, always include it
[0, 1, 0, 2, 5, 1, 3, 1, 6, 2] | [0]
^ Skip 0 ele...
