Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 6a2d3fc

Browse files
added codes for day 3
1 parent 52b9ec4 commit 6a2d3fc

File tree

4 files changed

+113
-0
lines changed

4 files changed

+113
-0
lines changed

‎Day 3/fibo-and-prime-series-2.py

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
primes = [2]
2+
3+
4+
def is_prime(x):
5+
i = 0
6+
while primes[i] <= x//2:
7+
if x % primes[i] == 0:
8+
return False
9+
i += 1
10+
return True
11+
12+
13+
def generate_prime():
14+
n = primes[-1] + 1
15+
while True:
16+
if is_prime(n):
17+
primes.append(n)
18+
return
19+
n += 1
20+
21+
22+
def fib():
23+
a, b = 0, 1
24+
yield a
25+
while 1:
26+
yield b
27+
a, b = b, a + b
28+
29+
30+
n = int(input("Enter the number of terms - "))
31+
32+
33+
f = fib()
34+
for i in range(n):
35+
if(i % 2 == 0):
36+
print(next(f))
37+
else:
38+
generate_prime()
39+
print(primes[-2])
40+

‎Day 3/fibo-and-prime-series.py

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
primes = [2]
2+
3+
4+
def is_prime(x):
5+
i = 0
6+
while primes[i] <= x//2:
7+
if x % primes[i] == 0:
8+
return False
9+
i += 1
10+
return True
11+
12+
13+
def generate_prime():
14+
n = primes[-1] + 1
15+
while True:
16+
if is_prime(n):
17+
primes.append(n)
18+
return
19+
n += 1
20+
21+
22+
n = int(input("Enter the number of terms - "))
23+
24+
a, b = 1, 1
25+
for i in range(n):
26+
if(i % 2 == 0):
27+
print(a)
28+
a, b = b, a + b
29+
else:
30+
generate_prime()
31+
print(primes[-2])
32+

‎Day 3/primes-sum.py

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]
2+
3+
def get_sum(n, k, sum_=0):
4+
if k < 0:
5+
return False
6+
if sum_ > n:
7+
return False
8+
if n == sum_:
9+
return True
10+
for prime in primes:
11+
val = get_sum(n, k-1, sum_+prime)
12+
if val:
13+
return True
14+
return False
15+
16+
17+
print(get_sum(10, 2))
18+
print(get_sum(1, 6))
19+
print(get_sum(60, 12))
20+
21+
22+
def climb(n, i=0, path=''):
23+
if i > n:
24+
return
25+
if i == n:
26+
print(path)
27+
climb(n, i+1, path+'1 ')
28+
climb(n, i+2, path+'2 ')

‎Day 3/small-large-list.py

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
l = list(map(int, input('Enter a list of numbers: ').split()))
2+
3+
l.sort()
4+
new_list = list()
5+
n = len(l)
6+
7+
for i in range(n//2 + 1):
8+
new_list.append(l[i])
9+
if i == n//2 and n%2 != 0:
10+
break
11+
new_list.append(l[-(i + 1)])
12+
13+
print(new_list)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /