满意答案
想问问专家01
2013.12.30
采纳率:56% 等级:9
已帮助:315人
python程序如下:
def HaveGongYue(a,b):
for i in range(a+1)[2:]:
if b % i == 0 and a % i == 0:
return True
return False
def test(l):
a = sorted(l)
la = len(a)
if la > 1 and a[0] == 0:
a = a[1:]
for i in range(la)[:-1]:
b = a[i]
for ii in range(i+1, la):
bb = a[ii]
if b == 1:
print "%d/%d" % (b,bb)
else:
if( not HaveGongYue(b, bb) ):
print "%d/%d" % (b, bb)
if __name__ == '__main__':
a = int(raw_input())
l = []
while a != 0:
l += [a]
a = int(raw_input())
test(l)
01分享举报