def square_of_sum(L):
return sum([i*i for i in L])
列表解析式太爽了
return sum([i*i for i in L])
列表解析式太爽了
2017-02-15
最赞回答 / 慕粉154916279
针对汉诺塔：一位美国学者发现一种出人意料的简单方法，只要轮流进行两步操作就可以了。首先把三根柱子按顺序排成品字型，把所有的圆盘按从大到小的顺序放在柱子A上，根据圆盘的数量确定柱子的排放顺序：若n为偶数，按顺时针方向依次摆放 A B C；若n为奇数，按顺时针方向依次摆放 A C B。⑴按顺时针方向把圆盘1从现在的柱子移动到下一根柱子，即当n为偶数时，若圆盘1在柱子A，则把它移动到B；若圆盘1在柱子B，则把它移动到C；若圆盘1在柱子C，则把它移动到A。⑵接着，把另外两根柱子上可以移动的圆盘移动到新的柱子上。即...
2017-02-15
months = set(["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"])
x1 = 'Feb'
x2 = 'Sun'
if x1 in months:
print 'x1: ok'
else:
print 'x1: error'
if x2 in months:
print 'x2: ok'
else:
print 'x2: error'
x1 = 'Feb'
x2 = 'Sun'
if x1 in months:
print 'x1: ok'
else:
print 'x1: error'
if x2 in months:
print 'x2: ok'
else:
print 'x2: error'
2017-02-15
sum = 0
x = 0
while True:
x = x + 1
if x > 100:
break
if not x % 2 == 0:
sum += x
continue
print sum
x = 0
while True:
x = x + 1
if x > 100:
break
if not x % 2 == 0:
sum += x
continue
print sum
2017-02-15
sum = 0
x = 1
n = 1
while True:
sum += x
x *= 2
n += 1
if n > 20:
break
print sum
x = 1
n = 1
while True:
sum += x
x *= 2
n += 1
if n > 20:
break
print sum
2017-02-15
# -*- coding: utf-8 -*-
d = {
'Adam': 95,
'Lisa': 85,
'Paul': 75,
'Bart': 59
}
str=input ('Enter the scorce\n')
for i in d:
if d[i] == int(str):
print 'The person is',i
break
else:
print ( 'can not find the person')
d = {
'Adam': 95,
'Lisa': 85,
'Paul': 75,
'Bart': 59
}
str=input ('Enter the scorce\n')
for i in d:
if d[i] == int(str):
print 'The person is',i
break
else:
print ( 'can not find the person')
2017-02-15
L = ['Adam', 'Lisa', 'Bart', 'Paul']
for index, name in enumerate(L):
print index + 1, '-', name
for index, name in enumerate(L):
print index + 1, '-', name
sum = 0
x = 1
while x <= 100:
if not x % 2 == 0: #x%2==0，x为偶数，取反加not，得奇数
sum += x
x += 1 #变量是1~100
print sum
x = 1
while x <= 100:
if not x % 2 == 0: #x%2==0，x为偶数，取反加not，得奇数
sum += x
x += 1 #变量是1~100
print sum
2017-02-15
已采纳回答 / 一醉且纵歌
a，b这里是变量如果输入顺序是（b,c,a)1. print a,'-->'b==> b,'-->',c2. print 'a--->b' %% 'a--->b' 是一个字符串==> 'a--->b'
2017-02-15