A7890 | Indian Summer
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked.
输入格式
The first line contains an integer $n$ ( $1<=n<=100$ ) — the number of leaves Alyona has found. The next $n$ lines contain the leaves' descriptions. Each leaf is characterized by the species of the tree it has fallen from and by the color. The species of the trees and colors are given in names, consisting of no more than $10$ lowercase Latin letters. A name can not be an empty string. The species of a tree and the color are given in each line separated by a space.
输出格式
Output the single number — the number of Alyona's leaves.
输入输出样例
输入 #1
5 birch yellow maple red birch yellow maple yellow maple green
输出 #1
4
输入 #2
3 oak yellow oak yellow oak yellow
输出 #2
1
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted