Feeds
답변 있음
Datetime with variable format
Hi Winston, As Peter Perkins mentioned, it is not recommended to use "datenum" as a workaround. If you are looking for examples...
Datetime with variable format
Hi Winston, As Peter Perkins mentioned, it is not recommended to use "datenum" as a workaround. If you are looking for examples...
1년 초과 전 | 0
| 수락됨
문제를 풀었습니다
Numbered lottery balls into cells
You are running a lottery, and have a number of different balls numbered 1 to N. Your job is to figure out how many different w...
3년 초과 전
문제를 풀었습니다
N-th permutation.
Let write some permutations of positive integers. 1: 1 2 3 4 5 6 ... 2: 2 1 3 4 ... 3: 1 3 2 4 ... ...
3년 초과 전
문제를 풀었습니다
Possible Outcomes of American Roulette
The payout for American roulette can be calculated by: payout = (38/n)-1 where n is the number of squares the bet covers. ...
3년 초과 전
문제를 풀었습니다
Put m balls into n boxes (again)
According to <http://www.mathworks.com/matlabcentral/cody/problems/1516-put-m-balls-into-n-boxes Cody Problem 1516>, if I put 3 ...
3년 초과 전
문제를 풀었습니다
Get ranking of a combination looking for speed.
I have the numbers pulled without replacement from the set [1 2 3 4 5 6 7 8 9 10 11 12 13]; They are then ordered from least to...
3년 초과 전
문제를 풀었습니다
Which permutation is it?
Let write some permutations of positive integers. 1: 1 2 3 4 5 6 ... 2: 2 1 3 4 ... 3: 1 3 2 4 ....
3년 초과 전
문제를 풀었습니다
A (wrong) place for everything, and everything in its (wrong) place
You have an equal number of cups and balls, each labelled from one to N. You randomly place one ball in each cup. Determine th...
3년 초과 전
문제를 풀었습니다
Put m balls into n boxes
Can you find all the cases where, if I put 3 balls into 2 boxes the case is 1 1 1 1 1 2 1...
3년 초과 전
문제를 풀었습니다
Usage of java.math : N Choose K with unlimited precision
Calculate the binomial coefficient nchoosek with full accuracy. This challenge may use the wonderful word of java.math that allo...
3년 초과 전
문제를 풀었습니다
NCHOOSEK - Time Optimization
*Input* * *V* —— Set of all choices, a vector of N, 1 < N < 100 * *K* —— Number of selected choices, a scalar, 0 <= K <=...
3년 초과 전
문제를 풀었습니다
Combinations without using nchoosek
You have to generate a matrix with all possible combinations of n elements *taken 2* at a time, *without using nchoosek(1:n,2)* ...
3년 초과 전
문제를 풀었습니다
Create Combination
Motivation: In many problems, we need to create combinations with the function nchoosek. In some cases, however, choices are lim...
3년 초과 전
문제를 풀었습니다
Next lexicographic - permutation
Find next lexicographic - permutation (permutations as it would occur in a dictionary order). E.g: nextP('ABCD') = ABDC If you...
3년 초과 전
문제를 풀었습니다
Repopulate the City
For any population p of positive integers between pmin and pmax, we can calculate histogram count n for a list of evenly dividin...
3년 초과 전
문제를 풀었습니다
Get ranking of a combination
I have the numbers pulled without replacement from the set [1 2 3 4 5 6 7 8 9 10 11 12 13]; They are then ordered from least to...
3년 초과 전
