Contracts....
2S W 24
1S W 1
2C N 1
2S E 1
2S W cascade kermit
2S W Flycycle/Wackojack
2S W Codo-Fluffy
2S W tylere / bid_em_up
2S W Siegmund/MSchmahl
2S W jlall/hanp
2S W CanadaGrl/Gerardo
2S W zasanya/ravia6
2S W rogerClee/cherdano
2S W jdonn/gib
2S W ant590 - crayzeejim
2S W mohitz/akjq
2S W karlson/threenobob
2S W peachy/lg62
2S W elianna/awm
2S W mbodell - javabean
2S W gnasher/catch22
2S W East4Evil/sohcahtoa
2S W bluecalm/redds
2S W Hrothgar/Free
2S W helene_t-agusaris
2S W kristen33/jillybean
2S W kfay/jchiu
2S W tlgoodwin/timg
2S E lobowolf/bkjswan
2C N sallyally/joylson
1S W olegru - driver733
NA 0 j0i/gwnn
NA 0 Tomi2-JHDW
NA 0 Vampyr/Lamford

Help

North opens 1♦, south responds 1♥. If EW enter the bidding at this point, north passes. If they do not, north rebids 2♣ which ends their bidding
A lot of complaints on this one that it wasn't even a problem, and why was it included? Yet not a single pair reached the optimal contracts of 2♣x.
Maybe this easiest problem turned into the hardest problem, or maybe for some reason it wasn't fair. Not sure which.
2CxN-=10, 1Sw=7, 2Sew=6, 2CN-=1