题目 Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the gr
一、题目要求 二、参考代码 n=int(input())for i in range(n):s=input().split()if s[0]=='1':if int(s[1])<130:print('duo chi yu!',end=' ')elif int(s[1])==130:print('wan mei!',end=' ')else:print('ni li hai!',end=