| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 2048 MB | 47 | 26 | 22 | 53.659% |
Let $s$ be a nonempty string consisting entirely of base-10ドル$ digits (0-9). If the length of $s$ is $n,$ number the digits 1,ドル 2, 3, \ldots, n$ from left to right, and for 1ドル \leq i \leq j \leq n,$ let $s[i,j]$ denote the substring consisting of the digits from position $i$ to position $j,ドル inclusive. (It follows that we are only considering nonempty substrings.) Assign a value to each substring that is simply equal to the largest digit in the substring. What is the average value of the substrings of $s$?
Note that two different substrings may be identical (as strings), but for the purposes of this problem they are treated as distinct. For example, if $s = $1010, then $s[1,2] = s[3,4] = $10 are distinct substrings (both with value 1ドル$).
The input is a single nonempty string, $s,$ of base-10ドル$ digits. The length of $s$ is at most 200ドル,000円$.
Output a line containing the average value of the substrings of $s$. If the average is an integer, print the integer. If the average is a proper fraction, i.e., is equal to $a/b,ドル where $a$ and $b$ are positive integers and $a < b,ドル print this fraction in lowest terms, with a '/' symbol separating the numerator and denominator. If the average is greater than 1ドル$ and does not simplify to an integer, print the whole part followed by the proper fractional part, separated by a space, with the proper fractional part in lowest terms and formatted as described in the previous sentence.
123
2 1/3
4084
6
1010
4/5
00000
0
ICPC > Regionals > North America > East Central North America Regional > 2024 East Central NA Regional Contest B번
ICPC > Regionals > North America > Greater New York Region > 2024 Greater New York Regional Contest B번
ICPC > Regionals > North America > Northeast North America Regional > 2024 Northeast North America Regional Contest B번