When performing a time consuming operation, such as downloading files from the web, can use a process or thread. What is the difference between them and what are their advantages?
CJam, 53 52 47 bytes
l~"X 0'ò"2/Dfb+:%"gÇâì6Ô¡÷Ç8nèS¡a"312b2b=
There's unprintables, but the two strings can be obtained by
[88 9 48 5 39 5 29 1 242]:c
[8 103 199 226 236 54 212 15 161 247 199 56 110 232 83 161 97]:c
respectively. This also shows that the code points are below 256.
This...
Don't you hate it when you're trying to roughly sort a list based on user data, but you have to poll the user for thousands of comparisons?
Hate no more, because the answers to this challenge are (going to be) here!
Method
To poorly sort a list, you must sort it at least 75% of the way. How is...
The task
Given the set
$$S = \left[{1,2,3,4,5,6,7,8}\right]$$
and an integer
$$0 \leq N < 2^{|S|}$$
find the Nth subset.
Input/Output
N is given as an unsigned integer on stdin. You must print the Nth subset in a format suitable for your language (this may include [1,2,3],{1,2,3},[1, 2, 3...
Sequences that sum to n
code-golf random sequence arithmetic
Barely too late for Fibonacci Day :(
Given a positive integer n, your challenge is to output a sequence of 1 and 2 that adds to n. For example, for input 8, acceptable outputs include 11111111, 2222, and 121211.
It's not quite that ...
Peg solitaire is a popular game usually played alone. The game consists of some number of pegs and a board which is divided into a grid - usually the board is not rectangular but for this challenge we will assume so.
Each valid move allows one to remove a single peg and the goal is to play in a ...
Given a set/array of permission queries, return whether the permission is allowed (boolean).
Input
This takes two inputs.
Queries
An array/list/whatever of strings that are valid permission queries, which can be sets of lowercase a-z or * separated by . (always return false if invalid).
* ma...
Given element count, minimum GCD and maximum LCM, compute the number of distinct integer arrays
Inspired by a question in Turkish National Computing Olympiad.
You are given 3 numbers: n, x and y.
Compute the number of distinct integer arrays with n elements whose GCD is greater than x and lcm ...
Brain-Flak, 338 bytes
([]){(({})[()]<([{}][])([][()]){({}[()]<(({}<(({})(())){({}[()]<([{}]())>)}>{})<({}{})((){[()](<{}<>((((()()()()){}){}){})<>>)}{}){{}(({})<>)(<>)}{}(({})(())){({}[()]<([{}])>)}{}>{}<({}<(([])<{{}({}<>)<>([])}{}<>>)<>>)<>{({}[()]<({}<>)<>>)}{}<>>)>)}{}{}<>((()()()()()){})<>>...
