Convert codepoint to UTF-9
UTF-9 was an April Fool's Day RFC joke specifications for encoding Unicode suitable for 9-bit nonet platforms.
Challenge
Your task is to implement a program or a function or a subroutine that takes one integer, who represents the codepoint of a character, to return a se...
@Peilonrayz we don't have any standard or common greeting everyone just kinda says whatever
I think Wasif tends to use "hello everyone", Redwolf usually greets with the current time of day, and I usually don't reply to greetings and don't say anything when I enter just for the sake of it, but I occasionally will welcome users who are uncommon/new visitors to TNB
Redwolf: Good morning.
Lyxal: Good morning.
Razetime: Good morning.
caird: You all sound like robots, try spicing it up a bit.
user: MORNING MOTHERF*****S
@Peilonrayz maybe; I don't really know the culture of most rooms :P from what I can see (which is not too much to be fair) 2nd monitor seems to have a lot less activity (or a lot higher amount of bot activity at least) and not too many people - this room is one of if not the most active chat room on this network, and everyone saying greetings would get a bit too cluttered
i actually discourage announcing one's entrance or exit without good reason in the chatiquette though it's not very disruptive to just say "hi" and I don't want to seem like I hate fun or chatter - it's chat after all, and we can't really say TNB is productive xD
@cairdcoinheringaahing We used to have quite a few people. Enough to give TNB a run for your money... we also had quite a few memes like "lol" auto star. TSA and RSA for when you ran out of stars. Also monking trains... Staring culture seems very unique to each chat
@Peilonrayz Basically yes :P A once prominent chat user here (Downgoat) promoted the "supremacy" of goats until it became a meme. Combine that with poor spelling and you have gaot
There's even an esolang, Gaot++, on TIO (Dennis resisted adding it for years before giving in)
@SlamJammington that situation will not happen, since input is guaranteed to create a valid tree(it's an annoying special case in an already difficult challenge)
I am having a weird problem while creating te Snake lang: https://github.com/Detective-Wasif/Snake/blob/main/snake.py It parses double digit numbers properly But it cannot parse single digit ones So i have to annoyingly prepend 0 before each single digit number I have tried debugging a lot, but have no clue where the error happens Can you please help to find the bug?
Inspired by a Codingame challenge I tried (and failed at) about a month ago.
Given a binary tree of words, say:
HELLO
/ \
WORLD EATING
/ / \
ARCH IDAHO GUARD
/
DOOZY
/...
true (like caird said, this'd be a perfect use of dynamically updating ads, so hopefully we can get that developed soon)
we can just link to the tag or the nominations post and make it a generic ad... but i'd love to be able to change it monthy thematically based on the language
not quite majorly historically relevant but i am expecting it to be; it has a growing user base, active development, and is really competitive and i believe topping its direct competitor (or if not, soon will)
This is an ascii-art challenge where you will draw ascii-art showing a person "jumping" off the top of a building.
The building
Input given will be a group of rectangular buildings. You may assume buildings are not "stacked on top of each other", hence only one row of buildings. This is the stan...
I want to golf the SkiFree game in C++ but I want it as a Win32 application with a run time library. Can I? I am studying C++ from Charles Petzold. I love SkiFree and I hate console applications. I want the result to be the same as the original game. I have the bitmaps and icon.
I like a string t...
@PyGamer0 not remotely useful all can be done with exponentiation/multiplication for sqrt: x**.5, square: x*x, cube:x**3, scientific notation: n*(10**x)`, which are way shorter than builtins
here is the question:-
you're given an array, count the no of non-empty subsets such that product of numbers in that subset is of the form P1 x P2 x ....x Pk where P1 x P2 x ....x Pk are prime numbers.
Example:
A[4,2,3,15]
for subset[2]: product = 2
for subset[3]: product = 3
for subset[2,3]: pro...
Inspired by a Codingame challenge I tried (and failed at) about a month ago.
Given a binary tree of words, say:
HELLO
/ \
WORLD EATING
/ / \
ARCH IDAHO GUARD
/
DOOZY
/...
