lyxal/Chat Mini auto-Completion Secret

## Chat Mini auto-Completion
Anush: CMC Output all such lists for a given positive integer n
Neil: CMC: 1->15,17 2->16,18 4->19,21,22 6->20,23,24 8->25,27 9->26 Other single digits should return an empty list. Bonus brownie points for working out what the sequence is and extending it
caird coinheringaahing: CMC: Given an integer n, output the first n squares. You may not use any builtins to either square an integer or determine if an integer is square
user: CMC: Solve any NP-hard problem in constant time
rak1507: I have a really fun cmc but I can't do it because of the dyalog competition :( sad
Adám: CMC: Given N>1 and B>1, answer the smallest positive base-B integer whose digits add to N. Must handle at least N=1000 and B=36. You can answer using letters for digits after 9, or as a list of digit values.
Adám: CMC: Given N, answer the smallest positive integer whose digits add to N. (Must handle at least N=1000.)
Wezl: CMC: Remove comments from my programming language
A username: CMC: Find out what your username decompressed in Jelly is. Mine's Assuredly\ denotated Bothered aalborg.
Anush: Sounds like a CMC :)
Anush: CMC given a list of strings, output a histogram of the lengths of the words
user: CMC: Take a language and misinterpret what it's about based on its name popularity-contest
caird coinheringaahing: CMC: Given a string, output whether it is an "alive" command for NP/SP( (i.e. matches either of those two regexes) :P
A username: CMC: Create a bot that posts randomly generated CMCs every minute or so.
A username: CMC: Make a CMC generator.
pxeger: @Anush can obviously be done with eval as well, but I can't really think of any other approaches. (that's why I posted a CMC)
pxeger: CMC: segmentation fault the CPython interpreter in pure Python only (no ctypes/cffi)
caird coinheringaahing: CMC fastest-code: evaluate/execute a single character program. The program may not error. TIO works for timings. Fastest wins
pxeger: @Adám My first CMC using my TIO clone ATO: ato.pxeger.com/api/v0/…
Adám: CMC: Rickroll.
Bubbler: Well, the CMC is over :P
Bubbler: Revised CMC: I found a Jelly 17-byter for the dihedral group challenge. 200 rep bounty if anyone can ninja me while I'm writing the explanation for it
Bubbler: CMC: I found a Jelly 14-byter for the dihedral group challenge. 200 rep bounty if anyone can ninja me while I'm writing the explanation for it
caird coinheringaahing: CMC: Given a date within the last 127 years, output the ASCII character representing the age of someone born on that date, if they were alive now
pxeger: CMC: simulate running for (a.length of a) console.log(a) on a given JS array nope, I'm posting that as a full challenge
Bubbler: (Note that you can still answer previous CMCs by pinging the respective CMC)
Bubbler: and I allow mixing 0 and 1 indexings (because why not, it's just a CMC)
Redwolf Programs: CMC: A generator function (or list of some sort) that produces every float64 other than 13
user: CMC: Things to say to easily change the topic of any conversation
caird coinheringaahing: CMC: Given a lowercase character (one of abcdefghijklmnopqrstuvwxyz), output how many "ends" it has (using DejaVu Sans Mono font). For example, a has 1, k has 4, r has 2. This is the full mapping. In weird edge cases such as i, go by the values in that link
Neil: CMC: Score a Blackjack/Pontoon hand. Examples: "AA" -> 12, "AT" -> 21, "JJ" -> 20, "2468" -> 20, "3579" -> 24, "A357" -> 16, "A234" -> 20. Input can be a list of any 13 integers or ASCII code points between 50 and 205 inclusive e.g. 2-9TJQKA
pxeger: CMC: Braille-Unicode-Binary (reference implementation: Try it online!)
Anush: Let's change the CMC to have floats
Anush: CMC given an array of non negative weights, sample an index randomly proportional to its weight .
Anush: Or a CMC
pxeger: CMC: where on SE can you see users' unabbreviated reputation? I want every page that displays it
Wheat Wizard: CMC The golfed learning function.  When it takes 1 arg it doubles it when it takes two it adds them.
pxeger: CMC: what is the output of the following two python files?
pxeger: CMC: all messages must contain at least one capital letter for the rest of the hour
A username: cmc: no capitals for the rest of the hour
hyper-neutrino: CMC: given two sets, find their intersection (this is almost definitely a dupe)
--- Text after here is AI generated
A username: CMC: output the first million integers from 1 to 1,000,000 inclusive.
Anush: CMC given an integer N, and a list of strings L, output an array with all matching strings in L. If there is no such string, return an empty list
KOWAP: CMC Given a binary search tree T and a positive integer m find the minimum weight path from root to leaf so that T contains m elements.
Adám: CMC: Rickroll some more...
user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
Bubbler: I have one more problem for the day guys! How do I tackle this?
Anush: CMC: Given a list of strings, output all sets of strings that have the same length as each other.
user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
A username: CMC shortest-path Given a tree and a positive integer m, find the shortest path from root to leaf that contains m elements or less. The path must be a single list, and the length must be at least m. Bonus points for using a path that is not the longest length possible.
Bubbler: I can't do this!
Bubbler: the best code-length-estimator program for python yet - "Cannot run code"
Bubbler: CMC longest-path Given a tree and a positive integer m, find the longest path from root to leaf that contains m elements or more. The path must be a single list, and the length must be at least m. Bonus points if you use an infinite path (ones that go infinitely deep into the tree).
A username: CMC shortest-path Given a tree and a positive integer m, find the shortest path from root to leaf that contains n elements or less. The path must be a single list, and the length must be at least n. Bonus points if you use an infinite path (ones that go infinitely deep into the tree).
	Anush: CMC Output all such lists for a given positive integer n
	Neil: CMC: 1->15,17 2->16,18 4->19,21,22 6->20,23,24 8->25,27 9->26 Other single digits should return an empty list. Bonus brownie points for working out what the sequence is and extending it
	caird coinheringaahing: CMC: Given an integer n, output the first n squares. You may not use any builtins to either square an integer or determine if an integer is square
	user: CMC: Solve any NP-hard problem in constant time
	rak1507: I have a really fun cmc but I can't do it because of the dyalog competition :( sad
	Adám: CMC: Given N>1 and B>1, answer the smallest positive base-B integer whose digits add to N. Must handle at least N=1000 and B=36. You can answer using letters for digits after 9, or as a list of digit values.
	Adám: CMC: Given N, answer the smallest positive integer whose digits add to N. (Must handle at least N=1000.)
	Wezl: CMC: Remove comments from my programming language
	A username: CMC: Find out what your username decompressed in Jelly is. Mine's Assuredly\ denotated Bothered aalborg.
	Anush: Sounds like a CMC :)
	Anush: CMC given a list of strings, output a histogram of the lengths of the words
	user: CMC: Take a language and misinterpret what it's about based on its name popularity-contest
	caird coinheringaahing: CMC: Given a string, output whether it is an "alive" command for NP/SP( (i.e. matches either of those two regexes) :P
	A username: CMC: Create a bot that posts randomly generated CMCs every minute or so.
	A username: CMC: Make a CMC generator.
	pxeger: @Anush can obviously be done with eval as well, but I can't really think of any other approaches. (that's why I posted a CMC)
	pxeger: CMC: segmentation fault the CPython interpreter in pure Python only (no ctypes/cffi)
	caird coinheringaahing: CMC fastest-code: evaluate/execute a single character program. The program may not error. TIO works for timings. Fastest wins
	pxeger: @Adám My first CMC using my TIO clone ATO: ato.pxeger.com/api/v0/…
	Adám: CMC: Rickroll.
	Bubbler: Well, the CMC is over :P
	Bubbler: Revised CMC: I found a Jelly 17-byter for the dihedral group challenge. 200 rep bounty if anyone can ninja me while I'm writing the explanation for it
	Bubbler: CMC: I found a Jelly 14-byter for the dihedral group challenge. 200 rep bounty if anyone can ninja me while I'm writing the explanation for it
	caird coinheringaahing: CMC: Given a date within the last 127 years, output the ASCII character representing the age of someone born on that date, if they were alive now
	pxeger: CMC: simulate running for (a.length of a) console.log(a) on a given JS array nope, I'm posting that as a full challenge
	Bubbler: (Note that you can still answer previous CMCs by pinging the respective CMC)
	Bubbler: and I allow mixing 0 and 1 indexings (because why not, it's just a CMC)
	Redwolf Programs: CMC: A generator function (or list of some sort) that produces every float64 other than 13
	user: CMC: Things to say to easily change the topic of any conversation
	caird coinheringaahing: CMC: Given a lowercase character (one of abcdefghijklmnopqrstuvwxyz), output how many "ends" it has (using DejaVu Sans Mono font). For example, a has 1, k has 4, r has 2. This is the full mapping. In weird edge cases such as i, go by the values in that link
	Neil: CMC: Score a Blackjack/Pontoon hand. Examples: "AA" -> 12, "AT" -> 21, "JJ" -> 20, "2468" -> 20, "3579" -> 24, "A357" -> 16, "A234" -> 20. Input can be a list of any 13 integers or ASCII code points between 50 and 205 inclusive e.g. 2-9TJQKA
	pxeger: CMC: Braille-Unicode-Binary (reference implementation: Try it online!)
	Anush: Let's change the CMC to have floats
	Anush: CMC given an array of non negative weights, sample an index randomly proportional to its weight .
	Anush: Or a CMC
	pxeger: CMC: where on SE can you see users' unabbreviated reputation? I want every page that displays it
	Wheat Wizard: CMC The golfed learning function. When it takes 1 arg it doubles it when it takes two it adds them.
	pxeger: CMC: what is the output of the following two python files?
	pxeger: CMC: all messages must contain at least one capital letter for the rest of the hour
	A username: cmc: no capitals for the rest of the hour
	hyper-neutrino: CMC: given two sets, find their intersection (this is almost definitely a dupe)
	--- Text after here is AI generated
	A username: CMC: output the first million integers from 1 to 1,000,000 inclusive.
	Anush: CMC given an integer N, and a list of strings L, output an array with all matching strings in L. If there is no such string, return an empty list
	KOWAP: CMC Given a binary search tree T and a positive integer m find the minimum weight path from root to leaf so that T contains m elements.
	Adám: CMC: Rickroll some more...
	user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
	Bubbler: I have one more problem for the day guys! How do I tackle this?
	Anush: CMC: Given a list of strings, output all sets of strings that have the same length as each other.
	user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
	user: CMC fastest-code Find out how many times "Cannot run code" has been executed in CPython 3.6 in the last six months (it's on StackOverflow). Bonus points if you can figure out why it's not 1.
	A username: CMC shortest-path Given a tree and a positive integer m, find the shortest path from root to leaf that contains m elements or less. The path must be a single list, and the length must be at least m. Bonus points for using a path that is not the longest length possible.
	Bubbler: I can't do this!
	Bubbler: the best code-length-estimator program for python yet - "Cannot run code"
	Bubbler: CMC longest-path Given a tree and a positive integer m, find the longest path from root to leaf that contains m elements or more. The path must be a single list, and the length must be at least m. Bonus points if you use an infinite path (ones that go infinitely deep into the tree).
	A username: CMC shortest-path Given a tree and a positive integer m, find the shortest path from root to leaf that contains n elements or less. The path must be a single list, and the length must be at least n. Bonus points if you use an infinite path (ones that go infinitely deep into the tree).