Dictionary solution codeforces – The Berland language consists of words having exactly two letters. Moreover, the first letter of a word is different from the second letter. Any combination of two different Berland letters (which, by the way, are the same as the lowercase letters of Latin alphabet) is a correct word in Berland language.
[Solution] Dictionary solution codeforces
The Berland dictionary contains all words of this language. The words are listed in a way they are usually ordered in dictionaries. Formally, word 𝑎a comes earlier than word 𝑏b in the dictionary if one of the following conditions hold:
- the first letter of 𝑎a is less than the first letter of 𝑏b;
- the first letters of 𝑎a and 𝑏b are the same, and the second letter of 𝑎a is less than the second letter of 𝑏b.
So, the dictionary looks like that:
- Word 11: ab
- Word 22: ac
- …
- Word 2525: az
- Word 2626: ba
- Word 2727: bc
- …
- Word 649649: zx
- Word 650650: zy
You are given a word 𝑠s from the Berland language. Your task is to find its index in the dictionary.
[Solution] Dictionary solution codeforces
The first line contains one integer 𝑡t (1≤𝑡≤6501≤t≤650) — the number of test cases.
Each test case consists of one line containing 𝑠s — a string consisting of exactly two different lowercase Latin letters (i. e. a correct word of the Berland language).
For each test case, print one integer — the index of the word 𝑠s in the dictionary.
7 ab ac az ba bc zx zy
Dictionary solution codeforces
1 2 25 26 27 649 650