100531: [AtCoder]ABC053 B - A to Z String

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:1 Solved:0

Description

Score : $200$ points

Problem Statement

Snuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string $s$ (that is, a consecutive part of $s$).

Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of $s$ that starts with A and ends with Z.

Constraints

  • $1 ≦ |s| ≦ 200{,}000$
  • $s$ consists of uppercase English letters.
  • There exists a substring of $s$ that starts with A and ends with Z.

Input

The input is given from Standard Input in the following format:

$s$

Output

Print the answer.


Sample Input 1

QWERTYASDFZXCV

Sample Output 1

5

By taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.


Sample Input 2

ZABCZ

Sample Output 2

4

Sample Input 3

HASFJGHOGAKZZFEGA

Sample Output 3

12

Input

题意翻译

题目大意: 输入一个字符串s,问从第一个A到最后一个Z之间有多少个字母(含A和Z)(包括A和Z,如:UYEAERTZUY,就是UYE AERTZ UY,A到Z之间有5个字符。数据保证了开头是A的末尾是Z的部分一定存在的。) 输入格式: 一个字符串s 输出格式: 从A到Z之间有多少个字母 感谢@Andysun06 提供的翻译

加入题单

上一题 下一题 算法标签: