# SRM 670 div2 A BearSong

 Problem Statement

Problem Statement for BearSong

### 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.

### Definition

 Class: BearSong Method: countRareNotes Parameters: int[] Returns: int Method signature: int countRareNotes(int[] notes) (be sure your method is public)

### 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

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.

This problem was used for:
Single Round Match 673 Round 1 - Division II, Level One

#include
#include
#include
#include
using namespace std;

class BearSong
{
public:
int countRareNotes(vector  notes)
{
int ans = 0;
int i;
int flag[2001];
for(i = 0; i < notes.size(); i++)
{
int val = notes[i];
if(!flag[ val ])
{
flag[ val ] = 1;
ans++;
}
else if(flag[ val ] == 1)
{
flag[ val ] = 2;
ans--;
}
}
return ans;
}
};

• 本文已收录于以下专栏：

## SRM 670 div2 A

Problem Statement   Two players are playing a cooperative game. At the beginning of the...
• ZZ_AC
• 2015年10月11日 19:38
• 222

## SRM 649 div2 1000

• slowlight93
• 2015年02月12日 18:31
• 500

## SRM 670 div2 B BearSlowlySorts

Problem Statement    Problem Statement for BearSlowlySorts Pro...
• ZZ_AC
• 2015年11月19日 22:11
• 221

## TC SRM 670 Div2 1050 Treestrat

Problem StatementTwo players are playing a game with some tokens on a tree.Player A has one or more ...
• Liao_Jingyi
• 2015年10月14日 18:35
• 249

## SRM 633 DIV2 A

Problem Statement   Here at [topcoder], we call a contestant a "target" if their rating is 3000 ...
• chaoweilanmao
• 2015年02月10日 12:15
• 599

## Topcoder SRM 636 Div2 A

• huayunhualuo
• 2016年06月02日 21:42
• 186

## 【SRM 717 div2 A】 NiceTable

Problem StatementYou are given a vector t that describes a rectangular table of zeroes and ones. Ea...
• harlow_cheng
• 2017年07月01日 11:13
• 139

## TopCoder SRM 637 Div2 A

• huayunhualuo
• 2016年06月07日 19:38
• 165

## TopCoder SRM 670 Div2 Problem 1050 - Treestrat (floyd)

RT
• u014247806
• 2015年10月11日 10:00
• 511

## 猫抓老鼠 floyd SRM 670 Div2 Problem 1050 - Treestrat

• ACM_10000h
• 2015年10月12日 13:09
• 459

举报原因： 您举报文章：SRM 670 div2 A BearSong 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)