The 2002 ACM North Central North America
Regional Programming Contest
November 9, 2002


Problem Clarifications

Last Updated: 11/10/2002 04:46 AM


Problem 1  
  No clarifications
Problem 2  
  No clarifications
Problem 3  
 
  • The binary search trees will never have nodes with duplicate key values.
Problem 4  
  No clarifications
Problem 5  
  No clarifications
Problem 6  
 
  • The problem has two contradictory statements in the
     output specifications:
         "display the identity of the individuals in each group, one
        line per
    group"
    and
      
       "output lines must be no longer than 79 characters."

    Interpret the problem statement as follows:
       You may split the output into multiple lines. Each line must
       be no longer
    than 79 characters, but may be shorter as
       you see fit.
  • In the event multiple pairs of points could be used to form the initial (two) groups (group 1 and group 2), choose the first (earliest in the input) pairs to form a group.
 
Problem 7  
  No clarifications
Problem 8  
  No clarifications