5
birch yellow
maple red
birch yellow
maple yellow
maple green
4
3
oak yellow
oak yellow
oak yellow
1
题目大意:每行的开始是一个n,表示一下有 n 行的数据,每行有两个字符串;
目的就是判断除去重复的组还剩余多少组;
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<string>
#include<cmath>
#include<map>
using namespace std;
int main()
{
int T,n;
string s1,s2;
map< pair<string,string> ,int >a;
while(cin>>n)
{ int ans = 0;
for(int i=0; i<n; i++)
{
cin>>s1>>s2;
if(a[make_pair(s1,s2)] == 0)
{
a[make_pair(s1,s2)]=1;
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}
还可以
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<string>
#include<cmath>
#include<map>
using namespace std;
map<string ,int >a;
int main()
{
int n;
string s;
while(cin>>n)
{ int ans = 0;
getchar();
for(int i=0;i<n;i++)
{
getline(cin,s);
if(a[s] == 0 )
{
a[s]=1;
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}