Project Euler 15

1003 lab quiz2 is on his damn way.... shit...

must finish quickly.


this problem is easy. and again I am silly.


f = [[0 for i in range(21)] for j in range(21)]
f[0][0] = 1
for i in range(0, 21):
        f[i][0] = 1
        f[0][i] = 1
for i in range(1 , 21):
	for j in range(1 , 21):
		f[i][j] = f[i-1][j]+f[i][j-1]
for i in range(0, 20):
        print(f[i])
print(f[20][20])

no gcc for the lab computers

so python lah~


another thing is that this NOIP normal question took me more than 10mins....

brain is kind of

nothing right on the left part

and nothing left on the right part...

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值