May the odds be ever omitted
code-golf
Input
[ An integer n | Two integers n and d ]
Output
The integers from 1 to n inclusive whose decimal representations contain an even number of [ 3s | ds ]
Tsim Sha Tsui (Chinese: 尖沙咀/尖沙嘴; Cantonese pronunciation: [tsiːm˥ saː˥ tsɵy˨˥]), often abbreviated as TST, is an urban area in southern Kowloon, Hong Kong. The area is administratively part of the Yau Tsim Mong District. Tsim Sha Tsui East is a piece of land reclaimed from the Hung Hom Bay now east of Tsim Sha Tsui. The area is bounded north by Austin Road and in the east by Hong Chong Road and Cheong Wan Road.
Geographically, Tsim Sha Tsui is a cape on the tip of the Kowloon Peninsula pointing towards Victoria Harbour, opposite Central. Several villages had been established in this location before...
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion.
== Description ==
Each...
In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled "New Foundations for Mathematical Logic"; hence the name. Much of this entry discusses NFU, an important variant of NF due to Jensen (1969) and exposited in Holmes (1998). In 1940 and 1951 Quine introduced an extension of NF sometimes called "Mathematical Logic" or "ML", that included classes as well as sets.
New Foundations has a universal set, so it is a non well founded...
In the ASCII art world, there is water, hash walls and letter mechanisms.
You are in a room made up of hash walls (# signs):
#######
# #
# #
# #
# ### #
# #
#######
You install an S water source (S sign) and an E water tank (E sign) which can receive water from any direction, ...
Your task is to write a program, that given a list of chat messages, count how many times each person gets pinged, so I can know how popular everyone is. But, since I have to do it surreptitiously, I need it to be as small as possible so I can hide the code.
Specs
The input comes in a list of...
20
Increase the "Ask Question" Privilege Threshold to +2
I should note that I'm not convinced that this is a good idea but I figure I'll mention it to see how others feel.
On Q&A sites, the point of posting a question is to get help, to ask a question and get an answer. There shouldn't be a barrie...
There's always some question or another on hold with a few downvotes on main, and they are usually created by users with 1 reputation. So if there was a small reputation requirement (eg 10) for making a question, this would be fixed. Would this be a good idea?
