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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
| from operator import add, sub
def a_plus_abs_b(a, b):
"""Return a+abs(b), but without calling abs.
\>>> a_plus_abs_b(2, 3)
5
\>>> a_plus_abs_b(2, -3)
5
\>>> a_plus_abs_b(-1, 4)
3
\>>> a_plus_abs_b(-1, -4)
3
"""
if b < 0:
f = add
b=-b
else:
f = add
return f(a, b)
def a_plus_abs_b_syntax_check():
"""Check that you didn't change the return statement of a_plus_abs_b.
\>>> # You aren't expected to understand the code of this test.
\>>> import inspect, re
\>>> re.findall(r'^\s*(return .*)', inspect.getsource(a_plus_abs_b), re.M)
['return f(a, b)']
"""
\
def two_of_three(i, j, k):
"""Return m*m + n*n, where m and n are the two smallest members of the
positive numbers i, j, and k.
\>>> two_of_three(1, 2, 3)
5
\>>> two_of_three(5, 3, 1)
10
\>>> two_of_three(10, 2, 8)
68
\>>> two_of_three(5, 5, 5)
50
"""
return i*i+j*j+k*k-(max(i,j,k)*max(i,j,k))
def two_of_three_syntax_check():
"""Check that your two_of_three code consists of nothing but a return statement.
\>>> # You aren't expected to understand the code of this test.
\>>> import inspect, ast
\>>> [type(x).__name__ for x in ast.parse(inspect.getsource(two_of_three)).body[0].body]
['Expr', 'Return']
"""
\
def largest_factor(n):
"""Return the largest factor of n that is smaller than n.
\>>> largest_factor(15) # factors are 1, 3, 5
5
\>>> largest_factor(80) # factors are 1, 2, 4, 5, 8, 10, 16, 20, 40
40
\>>> largest_factor(13) # factor is 1 since 13 is prime
1
"""
"*** YOUR CODE HERE ***"
i=2
max_factor=1
while i<n:
if (n%i==0):
if(i>max_factor):
max_factor=i
i=i+1
return max_factor
def hailstone(n):
"""Print the hailstone sequence starting at n and return its
length.
\>>> a = hailstone(10)
10
5
16
8
4
2
1
\>>> a
7
\>>> b = hailstone(1)
1
\>>> b
1
"""
"*** YOUR CODE HERE ***"
sum=1
print(n)
while n!=1:
if(n%2==0):
n=n/2
else:
n=n*3+1
n=int(n)
sum=sum+1
print(n)
return sum
|