Problem A. Arrangement of Contest

题目连接：

http://codeforces.com/gym/100269/attachments

Description

Little Dmitry and little Petr want to arrange a contest. Their little friends submitted several task

proposals and now Dmitry and Petr want to select some of them for the contest. As they are just little

boys, they cannot estimate quality of tasks, but they know for sure that in good contest title of the first

problem starts with A, the title of the second one — with B, and so on.

Given titles of the proposed tasks, help little brothers to determine the maximal number of problems in

a good contest they can arrange.

Input

The first line contains single integer n — the number of problem proposals received by the little

brothers (1 ≤ n ≤ 100).

Next n lines contain titles of proposed problems, one per line. The length of each title does not exceed

30 characters. Each title starts with an uppercase letter and contains only English letters, digits and

underscores.

Output

Output a single number — the maximal number of problems in a good contest. In case there is no good

contest that may be arranged, output 0.

Sample Input

12

Arrangement of Contest

Ballot Analyzing Device

Correcting Curiosity

Dwarf Tower

Energy Tycoon

Flight Boarding Optimization

Garage

Heavy Chain Clusterization

Intellectual Property

J

Kids in a Friendly Class

Lonely Mountain

Sample Output

12

Hint

题意

问这些句子的首字母最长连接到什么位置……

题解：

阅读题

代码

#include<bits/stdc++.h>

using namespace std;

int num = 0;

int ans = 0;

string s;

int vis[30];

int main()

{

    freopen("arrange.in","r",stdin);

    freopen("arrange.out","w",stdout);

    int n;

    scanf("%d",&n);

    for(int i=1;i<=n;i++)

    {

        cin>>s;

        vis[s[0]-'A']=1;

    }

    for(int i=0;i<27;i++)

        if(vis[i]==0)

        {

            cout<<i<<endl;

            return 0;

        }

}