Algorithm training of Quantum team (20191012)

A - Neverending competitions
There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name “snookah”)! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back.

Jinotega’s best friends, team Base have found a list of their itinerary receipts with information about departure and arrival airports. Now they wonder, where is Jinotega now: at home or at some competition far away? They know that:

this list contains all Jinotega’s flights in this year (in arbitrary order),
Jinotega has only flown from his hometown to a snooker contest and back,
after each competition Jinotega flies back home (though they may attend a competition in one place several times),
and finally, at the beginning of the year Jinotega was at home.
Please help them to determine Jinotega’s location!

Input
In the first line of input there is a single integer n: the number of Jinotega’s flights (1 ≤ n ≤ 100). In the second line there is a string of 3 capital Latin letters: the name of Jinotega’s home airport. In the next n lines there is flight information, one flight per line, in form “XXX->YYY”, where “XXX” is the name of departure airport “YYY” is the name of arrival airport. Exactly one of these airports is Jinotega’s home airport.

It is guaranteed that flights information is consistent with the knowledge of Jinotega’s friends, which is described in the main part of the statement.

Output
If Jinotega is now at home, print “home” (without quotes), otherwise print “contest”.

Examples
Input
4
SVO
SVO->CDG
LHR->SVO
SVO->LHR
CDG->SVO
Output
home
Input
3
SVO
SVO->HKT
HKT->SVO
SVO->RAP
Output
contest
Note
In the first sample Jinotega might first fly from SVO to CDG and back, and then from SVO to LHR and back, so now they should be at home. In the second sample Jinotega must now be at RAP because a flight from RAP back to SVO is not on the list.

#include"bits/stdc++.h"
typedef long long ll;
using namespace std;
struct A {
	char a[1100];
	char b[1100];
} a[110]; //只需要判断一下在家机场出去的次数与回家乡机场次数是否相同即可
int main() {
	int i,j,k,n,m,x,y,d,e,t;
	char b[110],c[110];
	while(scanf("%d %s",&n,b)!=EOF) {
		x=0;
		y=0;
		for(i=0; i<n; i++) {
			scanf(" %s",c);
			for(j=0; j<3; j++)
				a[i].a[j]=c[j];
			a[i].a[3]=0;
			for(j=0; j<3; j++)
				a[i].b[j]=c[j+5];
			a[i].b[3]=0;
		}
		for(i=0; i<n; i++)

		{
			if(strcmp(b,a[i].a)==0)
				x++;
			if(strcmp(b,a[i].b)==0)
				y++;
		}
		if(x==y)
			printf("home\n");
		else
			printf("contest\n");
	}
	return 0;
}
/*
4
SVO
SVO->CDG
LHR->SVO
SVO->LHR
CDG->SVO
*/

C - Towers
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

Input
The first line contains an integer N (1 ≤ N ≤ 1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

Output
In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.

Examples
Input
3
1 2 3
Output
1 3
Input
4
6 5 6 7
Output
2 3

#include"bits/stdc++.h"
typedef long long ll;
using namespace std;

using namespace std;
int main() {
	map<int, int>m;
	int i,n,a, cnt;
	while(scanf("%d",&n)!=EOF) {
		cnt=0;
		m. clear();
		for(i=1; i<=n; i++) {
			scanf("%d",&a);
			m[a]++;
		}
		map<int, int>:: iterator it;
		int maxl=-1;
		for(it=m. begin(); it!=m. end(); it++) {
			cnt++;
			if((* it). second>maxl)
				maxl=(* it). second;
		}
		printf("%d %d\n", maxl, cnt);
	}
	return 0;
}
/*
3
1 2 3
*/