Activity for Quintec
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Answer | — |
A: The Pell Numbers [APL (Dyalog Classic)], 20 18 17 16 bytes ⊢/,+.×⍣⎕⍨∘.+⍨⌽⍳2 Matrix implementation, requires `⎕IO←0`. Thanks to @Razetime for the idea, -3 bytes by me Try it online! [APL (Dyalog Classic)], 19 18 bytes {⍵ {×⍵:⌊0.5+(∇⍵-1)÷1-⍨2÷2⋄1} Random fun implementation Try it... (more) |
— | about 3 years ago |
| Edit | Post #280839 | Initial revision | — | about 3 years ago |
| Answer | — |
A: The Pell Numbers [Python 3], 39 bytes f=lambda x:x if x<2else 2f(x-1)+f(x-2) Generic recursive implementation Try it online! (more) |
— | about 3 years ago |
| Comment | Post #280761 |
@DJMcMayhem hm, I didn't think of it, so I'm going to say no now (more) |
— | about 3 years ago |
| Edit | Post #280761 | Initial revision | — | about 3 years ago |
| Question | — |
Win a War (or at least a few battles) You have an army of size $n$ that you need to split up to fight $k$ battles simultaneously against an opposing army $A$. In each battle, the army with the most troops present wins - no one wins a tie. Your scouts have just reported back with the enemy troops' movements - how can you divide your army ... (more) |
— | about 3 years ago |
| Comment | Post #280754 |
Why are these called set squares when they are triangles (more) |
— | about 3 years ago |
| Edit | Post #280740 | Initial revision | — | about 3 years ago |
| Question | — |
Solve Goldbach's Conjecture Goldbach's Conjecture states that every even whole number greater than 2 is the sum of 2 prime numbers. Your task is to return those 2 prime numbers, given an even whole number as input. There are often multiple solutions - any solution will do. Input/Output Examples These examples only show on... (more) |
— | about 3 years ago |
| Comment | Post #280729 |
Oh, huh, mirroring is special for that character, I see (more) |
— | about 3 years ago |
| Comment | Post #280729 |
Why does the canvas alphabet contain ^ instead of V? (more) |
— | about 3 years ago |
| Edit | Post #280708 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Create an Alphabet Diamond Japt `-R`, 14 13 bytes ;Bãê kb'A û ê Test it Takes all substrings of the alphabet, palindromizes them, and then takes only the ones starting with A and centers and mirrors that too. -1 byte thanks to @Shaggy (more) |
— | about 3 years ago |
| Edit | Post #279233 |
Post edited: |
— | over 3 years ago |
| Comment | Post #280372 |
Maybe, IMO any number of dimensions is just an extra I/O challenge that doesn't really have anything to do with the challenge idea (but that's just me perhaps) (more) |
— | over 3 years ago |
| Comment | Post #280372 |
Any number of dimensions is kind of annoying and severely limits some languages such as java - is there a reason for it? (more) |
— | over 3 years ago |
| Edit | Post #279255 |
Post edited: |
— | over 3 years ago |
| Comment | Post #280244 |
+1 for the walrus operator (more) |
— | over 3 years ago |
| Comment | Post #279754 |
It is worth noting that "find the language" is not the only type of cops and robbers - https://codegolf.stackexchange.com/questions/40932/unscramble-the-source-code comes to mind. (more) |
— | over 3 years ago |
| Edit | Post #279482 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279852 | Initial revision | — | over 3 years ago |
| Question | — |
The Camelot Wheel Given a musical key, output its number and letter on the Camelot Wheel (shown below). Camelot Wheel Input A musical key as a string, as shown on the wheel. The words "Sharp" and "Flat" may be replaced with symbols (such as "#" and "b") if you wish. Output The number and letter, either ... (more) |
— | over 3 years ago |
| Edit | Post #279797 | Question closed | — | over 3 years ago |
| Comment | Post #279797 |
Hey, since we already have a discussion on this, might as well continue it there. (more) |
— | over 3 years ago |
| Edit | Post #279199 | Question reopened | — | over 3 years ago |
| Edit | Post #279199 | Question closed | — | over 3 years ago |
| Edit | Post #279793 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279793 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Generate Lewis Caroll's Jabberwocky Japt, 625 615 bytes ``` `'T°s ߦg, d e sÒy v Did gy d g½e e °¼; A¥ Úßy ØÀ e Þgov, A e Ú ÎÈs tg¼. ` +i` "BeØ e {=`Jab¼rwock`}, my s! T jaws È ßÒ, e claws È ¯t®! BeØ e Jubjub bird, d д T èã BÂrsn ®!" He ok s vpal sÙ Ê@: Lg ÈØ e µnxo´ foe Ñht... (more) |
— | over 3 years ago |
| Comment | Post #279759 |
Ah, makes sense. (more) |
— | over 3 years ago |
| Comment | Post #279759 |
You seem to have used 1 already in the first solution though... (more) |
— | over 3 years ago |
| Comment | Post #279749 |
This is brilliant and makes me feel like I'm cheating with Japt, you have so many more single digit solutions than I thought possible, haha (I'm going to not take them even though that would increase my count by a ton just for fun and competition) (more) |
— | over 3 years ago |
| Edit | Post #279747 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279747 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279747 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Output 256 in many different ways Japt, 10 11 13 15 solutions ``` 256 ``` Works as you would expect. ``` 8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8--8 ``` Subtracting negative numbers. ``` 44 ``` Power. ``` 9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9... (more) |
— | over 3 years ago |
| Comment | Post #279659 |
I don't know about this... doesn't this tend to infinity? Say in python, print 'x'*10000000... each zero is ten times the length yet only +1 byte (more) |
— | over 3 years ago |
| Edit | Post #279643 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279643 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279643 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Reverse an ASCII string Laser, 9 bytes ``` c⌜ps \U# ``` My own language's showcase time! This is a 2D language with an instruction pointer initially pointing to the right. It takes implicit input as an array of characters. Explanation: ``` c⌜p repeat as long as the current stack (input) isn't empty: ... (more) |
— | over 3 years ago |
| Edit | Post #279641 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Reverse an ASCII string Japt, 1 byte w Uh... yeah. Probably similar solutions for many other golf langs. Try it (more) |
— | over 3 years ago |
| Comment | Post #279601 |
@Lundin No negative numbers, limit goes up to the int range in your language of choice (more) |
— | over 3 years ago |
| Edit | Post #279601 | Initial revision | — | over 3 years ago |
| Question | — |
Longest Increasing Subsequence Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the input was `[1, 5, 2, 4]`, the answer would be `3` for the subsequence `[1, 2, 4]`. More I/O Examples `... (more) |
— | over 3 years ago |
| Edit | Post #279482 | Initial revision | — | over 3 years ago |
| Article | — |
The Camelot Wheel [FINALIZED] Given a musical key, output its number and letter on the Camelot Wheel (shown below). Camelot Wheel Input A musical key. Format is flexible - you may take in a string, an array of [note, sharp/flat/none, major/minor], or similar. Output The number and letter, either as a string, tuple,... (more) |
— | over 3 years ago |
| Comment | Post #279376 |
@msh210 1. Random bot moves on - I think this is fine for balance because of the large number of rounds played. 2. Before, though it doesn't really matter I think, what I mean to express is 1 pt for first round, 2 for second, 4 for 3rd, etc. etc. (more) |
— | over 3 years ago |
| Edit | Post #279376 |
Post edited: |
— | over 3 years ago |