Logo
(追記) (追記ここまで)

31526번 - Rampant Growth 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 2048 MB15211810178.906%

문제

Eddy is planning his garden, which can be represented as a grid. He wants his garden to have exactly one plant in each column. To make sure that plants do not compete for resources, if two plants are in adjacent columns, they must be in different rows.

Compute the number of different ways he can place plants in his garden to respect the above conditions. Two ways are different if one square has a plant in one arrangement but does not have a plant in the other. Because the number of ways may be large, output the number of ways modulo 998ドル,244円,353円$.

입력

The single line of input contains two space-separated integers $r$ and $c$ $(1 \leq r,c\leq 50),ドル where $r$ is the number of rows in Eddy's garden grid, and $c$ is the number of columns.

출력

Output a single integer, which is the number of ways Eddy can place plants in his garden, modulo 998ドル,244円,353円$.

제한

예제 입력 1

3 2

예제 출력 1

6

예제 입력 2

1 5

예제 출력 2

0

예제 입력 3

42 25

예제 출력 3

722210361

힌트

출처

ICPC > Regionals > North America > Mid-Central Regional > 2023 Mid-Central USA Programming Contest A번

ICPC > Regionals > North America > South Central USA Regional > 2023 South Central USA Regional Contest > Division 2 G번

ICPC > Regionals > North America > Mid-Atlantic Regional > 2023 Mid-Atlantic USA Regional Contest > Division 2 G번

ICPC > Regionals > North America > Southeast USA Regional > 2023 Southeast USA Regional Programming Contest > Division 2 G번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /