-1
Your task is to print the hexidecimal times table:
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f
00 02 04 06 08 0a 0c 0e 10 12 14 16 18 1a 1c 1e
00 03 06 09 0c 0f 12 15 18 1b 1e 21 24 27 2a 2d
00 04 08 0c 10 14 18 1c 20 24 28 2c 30 34 38 3c
...
Read this if you're confused.
Challenge:
The goal of this code-golf is based around the number 8675309...
Your goal is to print out every prime number from 2 to 8675309, starting with the number 2 and then skipping 8 prime numbers, then skipping 6, then skipping 7, etc. In essence, skip a numb...
Challenge
Create a program that will build a recursive list of all linked webpages (given a starting point), to a depth determined by user input.
Any valid link in the HTML should be crawled, whether or not it is a script, image, etc.
Example Input
<program name> <url to crawl> <depth>
webcraw...
Given a string as argument, output the length of the longest(s) non-overlapping repeated substring(s) or zero if there is no such string.
Examples
abcdefabc : the substring abc is repeated at positions 1 and 7, so the program should output 3
abcabcabcabcab : abcabc or bcabca or cabcab are repe...
Prelude:
I wanted to train making test cases, so I'm gonna try them on something easy.
Challenge:
Take any given (string) input and deduce if it's a number and output something that could be used to evaluate.
Rules:
You can write a full program or a function.
If a number, return anything th...
I've seen many challenges get marked as duplicates on this stack. Most I see as fair, some, not so much.
What qualifies as a duplicate question?
Consider challenges where:
Entries from a will be valid for b , and entries from b will be valid for a
Entries from a will be valid for b , but en...
A Very Quick Golf
When a new challenge appears on PPCG, users rush to be the first to submit an answer in their language.
To motivate me to do the same, I need a simple timer.
The Challenge
The stages of an ASCII hourglass look like this:
________
\@@@@@@/
\@@@@/
\@@/
/ \
/ \
/___...
0
The natural logarithm of a number is its logarithm to the base of the mathematical constant e, where e is an irrational and transcendental number approximately equal to 7000271828182845899♠2.718281828459. The natural logarithm of x is generally written as ln x, loge x, or sometimes, if the base e is implicit, simply log x. Parentheses are sometimes added for clarity, giving ln(x), loge(x) or log(x). This is done in particular when the argument to the logarithm is not a single symbol, to prevent ambiguity.
The natural logarithm of x is the power to which e would have to be raised to equal x. For...
Give your processor a break!
code-golf code-generation kolmogorov-complexity
Introduction
Here at PPCG our CPUs are always working hard to run all these awesome golfed programs. Now nobody can work hard continuously without a break. So it's time to give your CPUs a break. For a CPU, such a b...
