程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> CodeForces 151 B 結構體排序。

CodeForces 151 B 結構體排序。

編輯：C++入門知識

CodeForces 151 B 結構體排序。

E - 結構體又來了呦 Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 151B

Description

Winters are just damn freezing cold in Nvodsk! That's why a group of n friends prefers to take a taxi, order a pizza and call girls. The phone numbers in the city consist of three pairs of digits (for example, 12-34-56). Each friend has a phonebook of size s_i (that's the number of phone numbers). We know that taxi numbers consist of six identical digits (for example, 22-22-22), the numbers of pizza deliveries should necessarily be decreasing sequences of six different digits (for example, 98-73-21), all other numbers are the girls' numbers.

You are given your friends' phone books. Calculate which friend is best to go to when you are interested in each of those things (who has maximal number of phone numbers of each type).

If the phone book of one person contains some number two times, you should count it twice. That is, each number should be taken into consideration the number of times it occurs in the phone book.

Input

The first line contains an integer n (1?≤?n?≤?100) — the number of friends.

Then follow n data blocks that describe each friend's phone books. Each block is presented in the following form: first goes the line that contains integer s_i and string name_i (0?≤?s_i?≤?100) — the number of phone numbers in the phone book of the i-th friend and the name of the i-th friend. The name is a non-empty sequence of uppercase and lowercase Latin letters, containing no more than 20 characters. Next s_i lines contain numbers as "XX-XX-XX", where X is arbitrary digits from 0 to 9.

Output

In the first line print the phrase "If you want to call a taxi, you should call: ". Then print names of all friends whose phone books contain maximal number of taxi phone numbers.

In the second line print the phrase "If you want to order a pizza, you should call: ". Then print names of all friends who have maximal number of pizza phone numbers.

In the third line print the phrase "If you want to go to a cafe with a wonderful girl, you should call: ". Then print names of all friends who have maximal number of girls' phone numbers.

Print the names in the order in which they are given in the input data. Separate two consecutive names with a comma and a space. Each line should end with exactly one point. For clarifications concerning the output form, see sample tests. It is necessary that you follow the output form strictly. Extra spaces are not allowed.

Sample Input

Input

4
2 Fedorov
22-22-22
98-76-54

3 Melnikov
75-19-09
23-45-67
99-99-98
7 Rogulenko
22-22-22
11-11-11
33-33-33
44-44-44
55-55-55
66-66-66
95-43-21
3 Kaluzhin
11-11-11
99-99-99
98-65-32

Output

If you want to call a taxi, you should call: Rogulenko.
If you want to order a pizza, you should call: Fedorov, Rogulenko, Kaluzhin.
If you want to go to a cafe with a wonderful girl, you should call: Melnikov.

Input

3
5 Gleb
66-66-66
55-55-55
01-01-01
65-43-21
12-34-56
3 Serega
55-55-55
87-65-43
65-55-21
5 Melnik
12-42-12
87-73-01
36-04-12
88-12-22
82-11-43

Output

If you want to call a taxi, you should call: Gleb.
If you want to order a pizza, you should call: Gleb, Serega.
If you want to go to a cafe with a wonderful girl, you should call: Melnik.

Input

3
3 Kulczynski
22-22-22
65-43-21
98-12-00
4 Pachocki
11-11-11
11-11-11
11-11-11
98-76-54
0 Smietanka

Output

If you want to call a taxi, you should call: Pachocki.
If you want to order a pizza, you should call: Kulczynski, Pachocki.
If you want to go to a cafe with a wonderful girl, you should call: Kulczynski.

Hint

In the first sample you are given four friends. Fedorov's phone book contains one taxi number and one pizza delivery number, Melnikov's phone book only has 3 numbers of girls, Rogulenko's one has 6 taxi numbers and one pizza delivery number, Kaluzhin's one contains 2taxi numbers and one pizza delivery number.

Thus, if you need to order a taxi, you should obviously call Rogulenko, if you need to order a pizza you should call anybody of the following: Rogulenko, Fedorov, Kaluzhin (each of them has one number). Melnikov has maximal number of phone numbers of girls.

這題的題目還是比較好的，對結構體的掌握的要求挺高的。先講下題意。

直接看一個案例。

4
2 Fedorov
22-22-22
98-76-54
3 Melnikov
75-19-09
23-45-67
99-99-98
7 Rogulenko
22-22-22
11-11-11
33-33-33
44-44-44
55-55-55
66-66-66
95-43-21
3 Kaluzhin
11-11-11
99-99-99
98-65-32

Output

If you want to call a taxi, you should call: Rogulenko.
If you want to order a pizza, you should call: Fedorov, Rogulenko, Kaluzhin.
If you want to go to a cafe with a wonderful girl, you should call: Melnikov.

看這個案例。4代表4個人。

然後再輸入一個M 和名字。

M代表每個人有M個電話。

然後有一個規則。電話號碼相等的有的士服務，電話號碼降序排的有披薩服務。其他都是GIRL 服務。

然後輸出是先的士，再披薩，然後女孩（服務人的名字）。規則是電話號碼類型最多的輸出。

比如Rogulenko有6個的士的號碼，其他人就兩個，一個甚至沒有。所以的士只有Rogulenko。

看披薩的輸出。除了Melnikov，每個人都有一個披薩的類型的電話（降序的號碼），因為此時每個人擁有的相等，所以按順序輸出。（誰名字在前誰輸出）。

滿足以上規則之後。上代碼吧。

#include 
#include 
#include 
using namespace std;
struct node
{
	int di,pi,girl,haoma;  //用來統計的士類型的號碼幾個，披薩類型的號碼幾個，女孩類型的號碼幾個。haoma代表名字順序
	char name[666];  //名字
}
f[666];
bool  cmp1(node a,node b)
{
	if(a.di!=b.di)   //   每個人的士號碼的數量不等的話
		return a.di>b.di;  //降序排（因為大的先輸出）
	return a.haomab.pi; 
	return a.haomab.girl;
	return a.haomadh[1]&&dh[1]>dh[3]&&dh[3]>dh[4]&&dh[4]>dh[6]&&dh[6]>dh[7])  
					f[i].pi++;  //  滿足降序排的數字，披薩類型的號碼數量加已。
				else
					f[i].girl++;//其他全是女孩類型的號碼
			}
		}
		sort(f,f+n,cmp1);  // 結構體排序
        printf("If you want to call a taxi, you should call: %s",f[0].name);  //第一個人的號碼數量肯定最多，直接輸出
        for( i=1;i