我正在努力应对以下挑战:
我的解决方案:
import sys
test_cases = open(sys.argv[1], 'r')
sum_track=0
index_track = 0
for test in test_cases:
test = test.split()
test = [int(x) for x in test]
max_num = max([test[max([0,index_track])],test[min([len(test)-1,index_track+1])]])
print "adding
我是OZ莫扎特的新手,我正在尝试写一个三角形序列,但编程不起作用。
declare
fun {Sequence N R}
fun {Help I}
if I < N
sum = {Int.toFloat(N*(N+1)/2.0)}
%I + 1
case R of nil then {Append [sum] nil}
[] H|T then sum|H|T
end
I+1
end
end
in
{Help 0}
end
declare
{Browse {Sequence 5 nil}
因此,对于我目前的大学论文,我们应该创建一个Sierpinksi三角形,并递归地在里面画出新的三角形。
我们得到的原始代码是:
import sys, pygame
# a function that will draw a right-angled triangle of a given size anchored at a given location
def draw_triangle(screen, x, y, size):
pygame.draw.polygon(screen,white,[[x,y], [x+size,y], [x,y-size]])
#####