# 方法一
i =1while i<=9:
j =1while j<=i:print('%d*%d=%d'%(i,j,i*j),end=' ')
j +=1print()
i +=1# 方法二for i inrange(1,10):for j inrange(1,i+1):print('%d*%d=%d'%(i,j,i*j),end=' ')print()
找出2-1000000的所有质数,优化算法,找过一次的不需要再反复判断
primes =[]
num =2
end_num =10000while num <= end_num:
flag =Truefor p in primes:if p <= num **0.5:# 设num是一个正整数,如果对于所有的素数p<=num**2,都有p不能整除num,那么num是一个素数if num%p ==0:
flag =Falsebreakelse:breakif flag:
primes.append(num)print(num,end=',')
num +=1
计算1!+2!+3!+…n!
# 计算1!+2!+3!+...n!
n =int(input('请输入一个正整数n'))
i =1
total =0while i <= n:
j =1
k =1while j <= i:
k *= j
j +=1
total += k
i +=1print(total)
import random
guess_nums =[]
num = random.randint(1,100)print('随机生成的数字是:',num)
flag =Truewhile flag:
guess =int(input('请输入您猜测的数字:'))
guess_nums.append(guess)if guess < num:print('小了')if guess > num:print('大了')if guess == num:
flag =Falseprint('恭喜你猜对了,您一共猜了%d次'%len(guess_nums))for i in guess_nums:print(i)break
打印9x9乘法表# 方法一i = 1while i<=9: j = 1 while j<=i: print('%d*%d=%d'%(i,j,i*j),end=' ') j += 1 print() i += 1# 方法二for i in range(1,10): for j in range(1,i+1): print('%d*%d=%d'%(i,j,i*j),end=' ') pr.