Problem 1881. GJam 2013 China Event: Happy Teams
This Challenge is derived from GJam 2013 China Bad Horse. The problem is codified using a cell array of names.
The Challenge involves creating two teams with no pair of individuals on either team having a conflict. The input is a list of pairs of individuals who can not be placed on the same team. The Challenge is to determine if two teams can be created that do not have any players with conflicts.
Input: conflicted name pairs (cell array of pairs of names)
Output: TF (TF=1 if two Good teams are possible, 0 if Happy teams are non-producible)
Competition Summary: Best Time of 9 minutes, 789 out of 1984 correct
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15368 Solvers
-
Calculate the Levenshtein distance between two strings
1367 Solvers
-
the fly, the train, the second train, and their Zeno's paradox
68 Solvers
-
Generate a string like abbcccddddeeeee
258 Solvers
-
461 Solvers
More from this Author294
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!