n=[]
m=[]
def f():
t=[]
a=input()
a=a.split(" ")
if int(a[0])==0 and int(a[1])==0:
for o in range(0, len(n)):
fo = 0
for i in range(1, n[o]):
for k in range(i+1, n[o]):
if (i ** 2 + k ** 2 + m[o]) % (i * k) == 0:
fo = fo + 1
print('case',str(o+1) + ':' + str(fo))
if int(a[1])>0 or int(a[1])<=100:
n.append(int(a[0]))
m.append(int(a[1]))
f()
f()
HDU 1017 A Mathematical Curiosity Python实现
猜你喜欢
转载自blog.csdn.net/lunzi3775/article/details/80727154
今日推荐
周排行