count = 0
for num in range(101, 201):
# 判斷是否是素數(shù)
# x的范圍是2~num1
for x in range(2, num):
if num % x == 0:
# print(num, '不是素數(shù)')
# 只要在2~num-1之間找到一個能被num整除的數(shù),就說明num不是素數(shù)
break
else:
count += 1
print(num, '是素數(shù)')
print('101-200之間素數(shù)有:',count)
方法二:
for num in range(101, 201):
isprime = True # 取一個數(shù)就假設(shè)這個數(shù)是素數(shù)
for x in range(2, num):
if num % x == 0:
isprime = False # 當(dāng)在2~num-1之間找到了一個能夠被num整除的數(shù),就說明假設(shè)不成立
break
# 循環(huán)結(jié)束再判斷之前的假設(shè)是否成立
if isprime == True:
print(num,'是素數(shù)')
# 234 23 2 0
# 1234 123 12 1 0
# 規(guī)律: 一個整數(shù)是幾位數(shù),就看這個數(shù)整除10,除幾次后會變成0
num = int(input('請輸入一個整數(shù):'))
num2 = num
length = 0
while True:
num //= 10
length += 1
if num == 0:
break
print(length)
# 1234 4(123) 3(12) 2(1) 1(0)
for _ in range(length):
print(num2%10,end='')
num2 //= 10
print()
方法二
num=12345
num2=num
cont=0
for _ in range(100):
num //= 10
cont+=1
if num==0:
print(cont)
break
for _ in range(cont):
print(num2%10,end='')
num2 //= 10
print()
#while 循環(huán):
while True:
print(num2%10, end='')
num2//=10
if num2<1:
break