提交时间:2026-01-04 15:24:36

运行 ID: 80627

#include <iostream> using namespace std; int n, m; long long f[35][35]; int main() { cin >> m >> n; f[0][1] = 1; for ( int i = 1 ; i <= n ; ++ i ) { for ( int j = 1 ; j <= m ; ++ j ) { int l = (j == 1 ? m : j - 1); int r = (j == m ? 1 : j + 1); f[i][j] = f[i - 1][l] + f[i - 1][r]; } } cout << f[n][1] << endl; return 0; }