SRM 673, D2, 250-Pointer (BearSong)
James S. Plank
Tue Aug 30 00:47:32 EDT 2016
This is a map problem. Create a map whose key is the pitch, and whose value is
the number of times that you see the pitch. Your first step is to run through the
pitches, and create/update the elements in the map.
Your second step is to traverse the map and count the number of entries whose
second field equals one.