-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.py
More file actions
53 lines (37 loc) · 1.04 KB
/
test.py
File metadata and controls
53 lines (37 loc) · 1.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
def series_sum(n):
sum = 0
if n == 1:
return format(float(n), ",.2f")
for i in range(1, n * 3 + 1, 3):
sum += 1 / i
return format(float(sum), ",.2f")
# Happy Coding ^_^
#print(series_sum(2))
def series_sum(n):
return '{:.2f}'.format(sum(1.0/(3 * i + 1) for i in range(n)))
def longest(s1, s2):
if len(s1)>len(s2):
return "".join((sorted(set(s1))))
return "".join((sorted(set(s2))))
def binaryToNumber(array):
return str(int(str("".join(array)), 2)) # your code
#print(int("".join([str(x) for x in [1, 0, 0, 1]]), 2))
#print("".join(str([1, 2, 3, 4])))
# TEST CSE
class Customer(object):
def __init__(self, name="", balance=0):
self.name = name
self.balance = balance
def withdraw(self, amount):
self.balance -= amount
murad = Customer();
print(murad.balance)
berdi = Customer("Berdi", 5000)
print(berdi.balance)
berdi.withdraw(2000)
print(berdi.balance)
def love6(a, b):
if 6 in [a, b] or sum([a, b]) == 6:
return True
return False
print(love6(4, 5))