Three-Three-Three!
Write a program that produces an output such that:
At least three distinct characters appear.
The number of occurrences of each character is a multiple of 3.
For example, A TEA AT TEE is a valid output since each of the 4 distinct characters, A, E and T and (space), occurs...
@Qwerp-Derp oh, awesome. 1) Play Pokemon Go and get yourself a Tauros (which I assume you don't have seeing as how you don't live in the USA) 2) Go to World Trade Center, the new building is very cool. 3) Go eat at some fancy restraunt. There are some really good ones. Pizza is really good there.
@DJMcMayhem yeah I just go up here at Mammoth. Its only like 5 hours drive from my place. Or Big Bear which is actually only 1.5 hours but getting up the mountain takes another 45 minutes.
@Downgoat I prefer landing at LAX, waiting for a boarding gate for 45 min, walking through a mile of tunnels to get to baggage claim, waiting 30 minutes for your bags to come off the plane, then another 45 for the enterprise shuttle to come get you ;) Thats the real US expierence
@Pavel Yeah, it's kindof a pain to enter. I just use vim because it's easy for me, but I'm working on making it easier
@TrojanByAccident I meant if you're using vim, then "*yl will yank one byte to the system clipboard but I don't think it would in V. (Especially if you're using TIO)
@Zgarb Do you have an easy way of generating more test cases for your grid challenge? I think my algorithm is solid, but I'm not so sure about two optimizations.
@Qwerp-Derp Sure, go ahead! (Honestly, I didn't know anyone but me was interested in it.) Putting it on TIO would be great--I might have to modify the interpreter to make REPL not the default mode, will look into that.
@Zgarb Thanks in advance. No rush from my part. I should be heading to bed anyway. Below are all 3x3 matrices for which my two answers differ. I tried comparing notes with the Pyth answer, but it doesn't agree with either of my answers. At least 2 of these 3 answers are wrong...
(d div?
(q (
(num den)
(i (l num den)
(i num 0 1)
(d (s num den) den)))))
(d prm-help
(q (
(n orig)
(i (e n 1) 1
(i (div? orig n) 0
(prm-help (s n 1) orig))))))
(d prime?
(q (
(n)
(prm-help n n))))
Golomb rulers are sets of non-negative integers such that no two pairs of integers in the set are the same distance apart.
For example, [0, 1, 4, 6] is a Golomb ruler because all distances between two integers in this set are unique:
0, 1 -> distance 1
0, 4 -> distance 4
0, 6 -> distance 6
1, 4 -
Three-Three-Three!
Write a program that produces an output such that:
At least three distinct characters appear.
The number of occurrences of each character is a multiple of 3.
For example, A TEA AT TEE is a valid output since each of the 4 distinct characters, A, E and T and (space), occurs...
Golomb rulers are sets of non-negative integers such that no two pairs of integers in the set are the same distance apart.
For example, [0, 1, 4, 6] is a Golomb ruler because all distances between two integers in this set are unique:
0, 1 -> distance 1
0, 4 -> distance 4
0, 6 -> distance 6
1, 4 -
