Dictionary Codeforces Solution | Codeforces Problem Solution 2022

Dictionary Codeforces Solution | Codeforces Problem Solution 2022

B. Dictionary

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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 Click Below:-  CLICK HERE

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$.

Number Transformation Codeforces Solution

Remove Directed Edges Codeforces Solution

Desktop Rearrangement Codeforces Solution

Dictionary Codeforces Solution

Breaking the Wall Codeforces Solution

A-B-C Sort Codeforces Solution

Infinite Replacement Codeforces Solution 

So, the dictionary looks like that:

• Word 1$1$: ab
• Word 2$2$: ac
• ...
• Word 25$25$: az
• Word 26$26$: ba
• Word 27$27$: bc
• ...
• Word 649$649$: zx
• Word 650$650$: zy

You are given a word 𝑠$s$ from the Berland language. Your task is to find its index in the dictionary.

Input

The first line contains one integer 𝑡$t$ (1≤𝑡≤650$1\le t\le 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).

Output

For each test case, print one integer — the index of the word 𝑠$s$ in the dictionary.

Join Now for Solution:-