Inspired by problem 660.
Given n return two disjoint sets of integers A and B with same cardinality having following property:
for i = 1:n
Try to minimize sets cardinality.
assert(isequal(sum(A(:).^(1:n)), sum(A(:).^(1:n)))), makes it too basic.
I have no idea what I was thinking of when I wrote this. Thanks for pointing that out so quickly.
This solution is correct. The only reason it fails at test 4 is because the test suite can' t deal correctly with any sets that have elements that are bigger than 250.
This solution has an error that will only manifest when n >= 13. The corrected version is Solution 1200230.
Remove the air bubbles
High school cafeteria
Back to basics 9 - Indexed References
Number of 1s in a binary string
length of a vector
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
Calculate the Damerau-Levenshtein distance between two strings.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office