蘑菇街

输入第一行一个字符串，如：“1234567890”
输入第二行一个数字是n，如5

def func(s,step):
	for i in range(len(s)-step+1):
		print(s[i:i+step],end=" ")
if __name__ == '__main__':
	s = input("")
	step = int(input(""))
	if step<0 or step>len(s):
		print(-1)
	else:
		func(s, step

有一个X*Y的网格，小团要在此网格上从左上角到右下角，只能走格点且只能向右或向下走。请设计一个算法，计算小团有多少种走法。给定两个正整数int x,int y，请返回小团的走法数目

def path(visted):
	for i in range(len(visted[0])):
		visted[0][i]=1
	print(visted)
	for i in range(len(visted)):
		visted[i][0]=1
	for i in range(1,len(visted)):
		for j in range(1,len(visted[0])):
			visted[i][j] = visted[i-1][j] +visted[i][j-1]
	return visted[-1][-1]

if __name__ == '__main__':
	s = input().split(" ")
	x,y = s
	x,y = int(x),int(y)
	visted = [[0 for _ in range(y+1)] for _ in range(x+1)]
	print(visted)
	print(path(visted))