有一个 X*Y 的网格,小团要在此网格上从左上角到右下角,只能走格点(也即格子的顶点)且只能向右或向下走。请设计一个算法,计算小团有多少种走法。给定两个正整数 int x , int y ,请返回小团的走法数目。
数据范围:
# codiing:utf-8 import sys x, y = list(map(int, input().split())) record = [[0 for i in range(y+1)] for i in range(x+1)] for i in range(x+1): for j in range(y+1): if i == 0 or j == 0: record[i][j] = 1 else: record[i][j] = record[i][j-1] + record[i-1][j] print(record[x][y])
import sys x, y = sys.stdin.readline().strip().split(' ') x = int(x) y = int(y) class a: def __init__(self): self.n = 0 def findpath(self, i, j): if i == x and j == y: self.n += 1 if i < x: self.findpath(i + 1, j) if j < y: self.findpath(i, j + 1) return self.n tt = a() print(tt.findpath(0, 0))
if __name__ == '__main__':
x, y = [int(x) for x in input().split()]
n, m = x+1, y+1
dp = [[0 for j in range(m)] for i in range(n)]
for i in range(n):
dp[i][0] = 1
for j in range(m):
dp[0][j] = 1
for i in range(1, n):
for j in range(1, m):
dp[i][j] = dp[i-1][j] + dp[i][j-1]
print(dp[i][j])