0
The story continues from AoC2017 Day 22, Part 2.
The damn virus that was infecting a grid computing cluster now has jumped to a hexagonal computing cluster! In this cluster, the computers are connected in the honeycomb-like shape, and each computer has three neighbors.
.. .. ..
. .. .. .
...
Your challenge is to create the shortest code that can achieve the above problem given 6 coordinates (x1,y1,z1) (x2,y2,z2)
In python 3, this can be used: (i think im correct hopefully)
import math
math.sqrt((x2-x1)**2+(y2-y1)**2+(z2-z1)**2)
55 Bytes
The Most Wanted Prime Number(s)
Output a sequence of all the primes that are of the following form:
123...91011...(n-1)n(n-1)..11109...321. That is, acending decimal numbers up to some n, followed by a decending tail, all concatenated.
Background
Recently, Numberphile posted a video about primes ...
Challenge
Given two binary vectors (containing two consistent values of your choice) of length \$n\$ and \$m\$, output a corresponding ascii-art hitomezashi stitching pattern.
You are to fill the following pattern, where \$n\$ is the number of A-columns and \$m\$ is the number of B-rows:
A A A A...
Rotate two differently cased subwords independently
You have one string made of two subwords in different cases, the upper case first, then the lowercase:
ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
And you must return each subword cycled by a given increment. (N.b. the letters aren't ...
