Skip to content

Commit 8b1018a

Browse files
committed
第一章作业
1 parent 5117001 commit 8b1018a

File tree

4 files changed

+43
-0
lines changed

4 files changed

+43
-0
lines changed

Diff for: Homework/ryl/lz_episode_01/fibonacci.py

+9
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# 输出小于100的斐波那契数列
2+
# 代码学习: 这里的b相当于是当前位置的数,而a每次都保存了前一次的值
3+
print('小于100的斐波那契数列')
4+
a = 0
5+
b = 1
6+
while b < 100:
7+
print(b, end = " ")
8+
a, b = b, a + b
9+

Diff for: Homework/ryl/lz_episode_01/geometrically.py

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
# 求整数的几何级数
2+
# 等比数列求和公式: Sn = a(1-q**n)/(1-q)
3+
4+
print('几何级数')
5+
a = int(input('a:'))
6+
q = int(input('q:'))
7+
n = int(input('n:'))
8+
9+
sum = a*(1-q**n)/(1-q)
10+
11+
print(sum)

Diff for: Homework/ryl/lz_episode_01/prime_number.py

+23
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
# 暴力求解:质数只有1和本身是自己的因数,所以从2到本身减一去全部试探一遍
2+
# 搜索到i**0.5就可以了
3+
4+
import time
5+
import math
6+
print('100万以内的质数')
7+
start = time.time()
8+
num = int(input('number:'))
9+
ret = []
10+
l = [2, 3, 5, 7, 9]
11+
for i in range(2, num+1):
12+
for a in l:
13+
if i%a == 0:
14+
continue
15+
16+
for j in range(2, int(i**0.5)):
17+
if i%j == 0:
18+
break
19+
else:
20+
ret.append(i)
21+
22+
print('Counts:', len(ret))
23+
print('Time:', time.time()-start)

Diff for: Homework/ryl/lz_episode_01/作业截图.jpg

40 KB
Loading

0 commit comments

Comments
 (0)