题号：NC226679
时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
In a room of 23 people, there is a 50-50 chance of at least two people having the same birthday; in a room of 75, there is a 99.9% chance of at least two people having the same birthday.
Given a set of birthdays (each in the form of mm/dd), determine how many different birthdays there are, i.e., duplicates should count as one. there are, i.e., duplicates should count as one.
输入描述:
The first input line contains an integer,n(1 ≤n≤ 50), indicating the number of birthdays. Each
of the nextninput lines contains a birthday in the form of mm/dd. Assumemmwill be between
01 and 12 (inclusive) andddwill be between 01 and 31 (inclusive). Also assume that these values
will be valid, e.g., there will not be 02/31 in the input. (Consider 02/28 and 02/29 as different days
even though people born on 02/29 usually celebrate their birthdays on 02/28.)
输出描述:
Print how many different birthdays there are.
示例2
输入
复制
7
10/20
11/22
10/20
10/22
11/20
10/20
11/22