MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayThis Challenge is derived from GJam 2013 China Bad Horse partial of data set #2. Cody appears to have a testsuite size limit so only 32 of 100 cases are loaded. Brute force of 2^100 permutations may time out. 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 11 minutes, 707 out of 776 correct

19 correct solutions
10 incorrect solutions

Last solution submitted on Oct 14, 2013

1 Comment

Alfonso Nieto-Castanon
on 20 Sep 2013

note: this solution is not correct (e.g. {{'a','b'},{'b','c'},{'c','a'},{'d','e'}} should return 0)

1 Comment

Tobias SchÃ¤fer
on 19 Sep 2013

Elapsed time is 0.047208 seconds.
:-D

1 Comment

Alfonso Nieto-Castanon
on 19 Sep 2013

0.087544s

1 Comment

Alfonso Nieto-Castanon
on 19 Sep 2013

going for speed here (6 problems in 0.168566s)

3 Comments