Connection Status:
Competition Arena > BearSong

BearSong

SRM 673 · 2015-10-30 · by Errichto

SRM 673 · 2015-10-30 · by Errichto · Simple Search, Iteration
Class Name: BearSong
Return Type: int
Method Name: countRareNotes
Arg Types: (vector<int>)
Problem Statement

Problem Statement

Bear Limak has recently learned about musical notes. He then listened to a song and noticed that some notes appeared less often than others. In fact, some notes were so rare that they appeared in the song only once!


Limak now wants to look for such notes in other songs. Write a program that will look for the rare notes.


You are given a int[] notes that describes a song. Each number in notes represents one note of the song. Different numbers represent different notes, equal numbers represent equal notes.


Compute and return the number of notes that occur exactly once in the given song.

Constraints

  • notes will contain between 1 and 50 elements, inclusive.
  • Each element in notes will be between 1 and 1000, inclusive.
Examples
0)
{9,10,7,8,9}
Returns: 3

The rare notes are the notes 7, 8, and 10. Each of these notes occurs exactly once in the whole song. The note 9 occurs twice, so it is not a rare note

1)
{8,8,7,6,7,3,5,10,9,3}
Returns: 4

Each of the notes 5, 6, 9, and 10 occurs exactly once in this song.

2)
{234,462,715,596,906}
Returns: 5
3)
{17}
Returns: 1
4)
{1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000,1000}
Returns: 0

Submissions are judged against all 35 archived test cases, of which 5 are shown here. Case numbers match the judge’s.

Coding Area

Language: C++17 · define a public class BearSong with a public method int countRareNotes(vector<int> notes) · 35 test cases · 2 s / 256 MB per case

Submitting as anonymous