| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 2048 MB | 62 | 22 | 13 | 27.083% |
There are $r$ red, $g$ green, and $b$ blue balls. How many ways are there to arrange all these balls in a row such that any two adjacent balls have different colors? Since this number can be very large, output its remainder when divided by the prime number 998ドル,244円,353円$.
You are given three integers separated by spaces: $r,ドル $g,ドル and $b$. Each of the integers is from 1ドル$ to 10ドル^5$ inclusive.
Output a single integer: the required number of ways modulo 998ドル,244円,353円$.
1 1 1
6
4 1 1
0
1 1 2
6