专门开一个帖分享cs61a的答案

请问楼主每次使用ok test之后都要我登陆账号，有解决方法嘛

RayHL 发表于 2019-7-16 06:13
请问楼主每次使用ok test之后都要我登陆账号，有解决方法嘛

在最后加--local

lab03_extra

1. " Optional problems for Lab 3 """
   
2. 
   
3. from lab03 import *
   
4. 
   
5. ## Higher order functions
   
6. 
   
7. def cycle(f1, f2, f3):
   
8.     """Returns a function that is itself a higher-order function.
   
9. 
   
10.     >>> def add1(x):
    
11.     ...     return x + 1
    
12.     >>> def times2(x):
    
13.     ...     return x * 2
    
14.     >>> def add3(x):
    
15.     ...     return x + 3
    
16.     >>> my_cycle = cycle(add1, times2, add3)
    
17.     >>> identity = my_cycle(0)
    
18.     >>> identity(5)
    
19.     5
    
20.     >>> add_one_then_double = my_cycle(2)
    
21.     >>> add_one_then_double(1)
    
22.     4
    
23.     >>> do_all_functions = my_cycle(3)
    
24.     >>> do_all_functions(2)
    
25.     9
    
26.     >>> do_more_than_a_cycle = my_cycle(4)
    
27.     >>> do_more_than_a_cycle(2)
    
28.     10
    
29.     >>> do_two_cycles = my_cycle(6)
    
30.     >>> do_two_cycles(1)
    
31.     19
    
32.     """
    
33.     "*** YOUR CODE HERE ***"
    
34.     def take_arg_n(n):
    
35.         def take_arg_x(x):
    
36.             sum_res,i = x,0
    
37.             ori_ls = [f1,f2,f3]
    
38.             func_ls = ori_ls*(n//3) + ori_ls[0:n%3]
    
39.             if n == 0:
    
40.                 return x
    
41.             else:
    
42.                 while i<n:
    
43.                     sum_res = func_ls[i](sum_res)
    
44.                     i +=1
    
45.                 return sum_res
    
46.         return take_arg_x
    
47.     return take_arg_n
    
48. ## Lambda expressions
    
49. 
    
50. def is_palindrome(n):
    
51.     """
    
52.     Fill in the blanks '_____' to check if a number
    
53.     is a palindrome.
    
54. 
    
55.     >>> is_palindrome(12321)
    
56.     True
    
57.     >>> is_palindrome(42)
    
58.     False
    
59.     >>> is_palindrome(2015)
    
60.     False
    
61.     >>> is_palindrome(55)
    
62.     True
    
63.     """
    
64.     x, y = n, 0
    
65.     f = lambda: y*10+x%10
    
66.     while x > 0:
    
67.         x, y = x//10, f()
    
68.     return y == n
    
69. 
    
70. ## More recursion practice
    
71. 
    
72. def skip_mul(n):
    
73.     """Return the product of n * (n - 2) * (n - 4) * ...
    
74. 
    
75.     >>> skip_mul(5) # 5 * 3 * 1
    
76.     15
    
77.     >>> skip_mul(8) # 8 * 6 * 4 * 2
    
78.     384
    
79.     """
    
80.     if n == 2:
    
81.         return 2
    
82.     elif n == 1:
    
83.         return 1
    
84.     else:
    
85.         return n * skip_mul(n - 2)
    
86. 
    
87. def is_prime(n):
    
88.     """Returns True if n is a prime number and False otherwise.
    
89. 
    
90.     >>> is_prime(2)
    
91.     True
    
92.     >>> is_prime(16)
    
93.     False
    
94.     >>> is_prime(521)
    
95.     True
    
96.     """
    
97.     "*** YOUR CODE HERE ***"
    
98.     m = 1
    
99.     def div_by_divider(m):
    
100.         if n%m == 0:
     
101.             if m==n:
     
102.                 return True
     
103.             else:
     
104.                 return False
     
105.         else:
     
106.             return div_by_divider(m+1)
     
107.     return div_by_divider(m+1)
     
108. 
     
109. def interleaved_sum(n, odd_term, even_term):
     
110.     """Compute the sum odd_term(1) + even_term(2) + odd_term(3) + ..., up
     
111.     to n.
     
112. 
     
113.     >>> # 1 + 2^2 + 3 + 4^2 + 5
     
114.     ... interleaved_sum(5, lambda x: x, lambda x: x*x)
     
115.     29
     
116.     """
     
117.     "*** YOUR CODE HERE ***"
     
118.     def apply_odd_term(m):
     
119.         if m == n:
     
120.             return odd_term(m)
     
121.         else:
     
122.             return odd_term(m)+apply_even_term(m+1)
     
123. 
     
124.     def apply_even_term(m):
     
125.         if m == n:
     
126.             return even_term(m)
     
127.         return even_term(m) + apply_odd_term(m+1)
     
128.    
     
129.     def odd_then_even(n,od,ev):
     
130.         if n == 0:
     
131.             return 0
     
132.         else:
     
133.             return apply_odd_term(1)
     
134.         
     
135.     return odd_then_even(n,odd_term,even_term)
     
136. 
     
137.    
     
138. def ten_pairs(n):
     
139.     """Return the number of ten-pairs within positive integer n.
     
140. 
     
141.     >>> ten_pairs(7823952)
     
142.     3
     
143.     >>> ten_pairs(55055)
     
144.     6
     
145.     >>> ten_pairs(9641469)
     
146.     6
     
147.     """
     
148.     "*** YOUR CODE HERE ***"
     
149.     '''def count_appearance(x,n):#返回单个数字出现的次数
     
150.         while n:
     
151.             if n%10 == x:
     
152.                 return 1+ count_appearance(x,n//10)
     
153.             else:
     
154.                 return count_appearance(x,n//10)
     
155.         return 0
     
156. 
     
157.     def is_ten_pairs(x,n):#返回是否能够配对成10
     
158.         while n:
     
159.             if x+n%10 == 10:#只能返回一个pair,并且没有考虑重复
     
160.                 return True
     
161.             else:
     
162.                 return is_ten_pairs(x,n//10)
     
163.         return False
     
164.     def appeared(t):'''
     
165.     def return_tp(last,all_but_last):
     
166.         while last or n:
     
167.             while all_but_last:
     
168.                 if last + all_but_last%10 ==10:
     
169.                     return 1+return_tp(last,all_but_last//10)
     
170.                 else:
     
171.                     return return_tp(last,all_but_last//10)
     
172.             return ten_pairs(n//10)
     
173.         return 0
     
174.     return return_tp(n%10,n//10)
     

复制代码

exam_prep01

1. exampre01
   
2. def longest_increasing_suffix(n):
   
3.     m,suffix,k = 10,0,1
   
4.     while n:
   
5.         n, last = n//10, n%10
   
6.         if suffix == 0 or last <m*suffix//k:
   
7.             m, suffix, k =10, suffix + last*k, k*10  
   
8.         else:
   
9.             return suffix
   
10.     return suffix
    
11. 
    
12. def sandwich(n):
    
13.     tens,ones = (n//10)%10,n%10
    
14.     n = n//100
    
15.     while n:
    
16.         if n%10 == ones:
    
17.             return True
    
18.         else:
    
19.             tens, ones = n%10, tens
    
20.             n = n//10
    
21.     return False
    
22. 
    
23. def luhn_sum(n):
    
24.     def luhn_digit(digit):
    
25.         x = digit*multiplier
    
26.         return (x//10)+ (x%10)
    
27.     total, multiplier = 0, 1
    
28.     while n:
    
29.         n, last = n//10, n%10
    
30.         total += luhn_digit(last)
    
31.         multiplier = 3-multiplier
    
32.     return int(total)
    
33. 
    

复制代码

exam_prep02

1. exam_prep02
   
2. 
   
3. def kbonacci(n,k):
   
4.     if n<k - 1:
   
5.         return 0
   
6.     elif n == k-1:
   
7.         return 1
   
8.     else:
   
9.         total = 0
   
10.         i = 0
    
11.         while i < n:
    
12.             total = total +kbonacci(i,k)
    
13. 
    
14. def combine(left, right):
    
15.     """Return all of LEFT's digits followed by all of RIGHT's digits."""
    
16.     factor = 1
    
17.     while factor <= right:
    
18.         factor = factor * 10
    
19.     return left * factor + right
    
20. 
    
21. def reverse(n):
    
22.     """Return the digits of N in reverse.
    
23.     >>> reverse(122543)
    
24.     345221
    
25.     """
    
26.     if n < 10:
    
27.         return n
    
28.     else:   
    
29.         return combine(n%10 , reverse(n//10))
    
30. 
    
31. def remove(n, digit):
    
32.     """Return all digits of N that are not DIGIT, for DIGIT less than 10.
    
33.     >>> remove(243132, 3)
    
34.     2412
    
35.     >>> remove(remove(243132, 1), 2)
    
36.     433
    
37.     """
    
38.     removed = 0
    
39.     while n != 0:
    
40.         n, last = n//10, n%10
    
41.         if last != digit:
    
42.             removed = combine(removed,last)
    
43.     return reverse(removed)
    
44. 
    
45. 
    
46. square = lambda x: x * x
    
47. double = lambda x: 2 * x
    
48. def memory(x, f):
    
49.     def g(h):
    
50.         print(f(x))
    
51.         return memory(x,h)
    
52.     return g
    
53. 
    
54. lamb = lambda lamb: lambda: lamb + lamb
    
55. lamb(1000)() + (lambda b, c: b() * b() -c)(lamb(2), 1)
    

复制代码

赞楼主，刚刷到lab02，希望能够一起组队，共同刷题。

hw04 （没做extra question）

1. HW_SOURCE_FILE = 'hw04.py'
   
2. 
   
3. ###############
   
4. #  Questions  #
   
5. ###############
   
6. 
   
7. def intersection(st, ave):
   
8.     """Represent an intersection using the Cantor pairing function."""
   
9.     return (st+ave)*(st+ave+1)//2 + ave
   
10. 
    
11. def street(inter):
    
12.     return w(inter) - avenue(inter)
    
13. 
    
14. def avenue(inter):
    
15.     return inter - (w(inter) ** 2 + w(inter)) // 2
    
16. 
    
17. w = lambda z: int(((8*z+1)**0.5-1)/2)
    
18. 
    
19. def taxicab(a, b):
    
20.     """Return the taxicab distance between two intersections.
    
21. 
    
22.     >>> times_square = intersection(46, 7)
    
23.     >>> ess_a_bagel = intersection(51, 3)
    
24.     >>> taxicab(times_square, ess_a_bagel)
    
25.     9
    
26.     >>> taxicab(ess_a_bagel, times_square)
    
27.     9
    
28.     """
    
29.     "*** YOUR CODE HERE ***"
    
30.     return abs(street(a) - street(b)) + abs(avenue(a) - avenue(b))
    
31. 
    
32. def squares(s):
    
33.     """Returns a new list containing square roots of the elements of the
    
34.     original list that are perfect squares.
    
35. 
    
36.     >>> seq = [8, 49, 8, 9, 2, 1, 100, 102]
    
37.     >>> squares(seq)
    
38.     [7, 3, 1, 10]
    
39.     >>> seq = [500, 30]
    
40.     >>> squares(seq)
    
41.     []
    
42.     """
    
43.     "*** YOUR CODE HERE ***"
    
44.     ls = []
    
45.     for ele in s:
    
46.         ls += [ i for i in range(1,ele//2+2) if i*i==ele]
    
47.     return ls
    
48.             
    
49. 
    
50. def g(n):
    
51.     """Return the value of G(n), computed recursively.
    
52. 
    
53.     >>> g(1)
    
54.     1
    
55.     >>> g(2)
    
56.     2
    
57.     >>> g(3)
    
58.     3
    
59.     >>> g(4)
    
60.     10
    
61.     >>> g(5)
    
62.     22
    
63.     >>> from construct_check import check
    
64.     >>> check(HW_SOURCE_FILE, 'g', ['While', 'For'])
    
65.     True
    
66.     """
    
67.     "*** YOUR CODE HERE ***"
    
68.     if n <=3:
    
69.         return n
    
70.     else:
    
71.         return g(n-1)+2*g(n-2)+3*g(n-3)
    
72. 
    
73. def g_iter(n):
    
74.     """Return the value of G(n), computed iteratively.
    
75. 
    
76.     >>> g_iter(1)
    
77.     1
    
78.     >>> g_iter(2)
    
79.     2
    
80.     >>> g_iter(3)
    
81.     3
    
82.     >>> g_iter(4)
    
83.     10
    
84.     >>> g_iter(5)
    
85.     22
    
86.     >>> from construct_check import check
    
87.     >>> check(HW_SOURCE_FILE, 'g_iter', ['Recursion'])
    
88.     True
    
89.     """
    
90.     "*** YOUR CODE HERE ***"
    
91.     bs1,bs2,bs3 = 1,2,3
    
92.     gcase = 4
    
93.     total = 0
    
94.     if n ==1:
    
95.         return bs1
    
96.     elif n ==2:
    
97.         return bs2
    
98.     elif n ==3:
    
99.         return bs3
    
100.     else:
     
101.         while gcase <=n:
     
102.             new = 3*bs1+2*bs2+bs3
     
103.             bs1,bs2,bs3 = bs2,bs3,new
     
104.             gcase +=1
     
105.         return new
     
106.    
     
107. def pingpong(n):
     
108.     """Return the nth element of the ping-pong sequence.
     
109. 
     
110.     >>> pingpong(7)
     
111.     7
     
112.     >>> pingpong(8)
     
113.     6
     
114.     >>> pingpong(15)
     
115.     1
     
116.     >>> pingpong(21)
     
117.     -1
     
118.     >>> pingpong(22)
     
119.     0
     
120.     >>> pingpong(30)
     
121.     6
     
122.     >>> pingpong(68)
     
123.     2
     
124.     >>> pingpong(69)
     
125.     1
     
126.     >>> pingpong(70)
     
127.     0
     
128.     >>> pingpong(71)
     
129.     1
     
130.     >>> pingpong(72)
     
131.     0
     
132.     >>> pingpong(100)
     
133.     2
     
134.     >>> from construct_check import check
     
135.     >>> check(HW_SOURCE_FILE, 'pingpong', ['Assign', 'AugAssign'])
     
136.     True
     
137.     """
     
138.     "*** YOUR CODE HERE ***"
     
139.     def at_seven(k):
     
140.         if k == 0 :
     
141.             return False
     
142.         elif k%7==0 or has_seven(k):
     
143.             return True
     
144.         else:
     
145.             return False
     
146.     def change_sw(sw):
     
147.         return -sw
     
148. 
     
149.     def sum_up(n,sw):
     
150.         if n == 1:
     
151.             return 1
     
152.         elif n ==2:
     
153.             return sum_up(1,sw)+sw
     
154.         elif at_seven(n-1):
     
155.             return sum_up(n-1,change_sw(sw))+sw
     
156.         else:
     
157.             return sum_up(n-1,sw)+sw
     
158.    
     
159.     if len([i for i in range(1,n+1) if at_seven(i-1)])%2==0: #如果有双数个变方向的点
     
160.         return sum_up(n,1) #第n个前面的符号是+
     
161.     else:
     
162.         return sum_up(n,-1)
     
163.    
     
164. def has_seven(k):
     
165.     """Returns True if at least one of the digits of k is a 7, False otherwise.
     
166. 
     
167.     >>> has_seven(3)
     
168.     False
     
169.     >>> has_seven(7)
     
170.     True
     
171.     >>> has_seven(2734)
     
172.     True
     
173.     >>> has_seven(2634)
     
174.     False
     
175.     >>> has_seven(734)
     
176.     True
     
177.     >>> has_seven(7777)
     
178.     True
     
179.     """
     
180.     if k % 10 == 7:
     
181.         return True
     
182.     elif k < 10:
     
183.         return False
     
184.     else:
     
185.         return has_seven(k // 10)
     
186. 
     
187. def count_change(amount):
     
188.     """Return the number of ways to make change for amount.
     
189. 
     
190.     >>> count_change(7)
     
191.     6
     
192.     >>> count_change(10)
     
193.     14
     
194.     >>> count_change(20)
     
195.     60
     
196.     >>> count_change(100)
     
197.     9828
     
198.     """
     
199.     "*** YOUR CODE HERE ***"
     
200.     i = 0
     
201.     coin_ls = []
     
202.     while pow(2,i)<=amount:
     
203.         coin_ls += [pow(2,i)]
     
204.         i +=1
     
205.     def partition(n,coin):
     
206.         if n <= 0 :
     
207.             return 0
     
208.         elif n == 1:
     
209.             return 1
     
210.         elif n ==coin:#2+0+8这种情况
     
211.             return 1+partition(n,coin//2)
     
212.         elif coin not in coin_ls:
     
213.             return 0
     
214.         else:
     
215.             return partition(n-coin,coin)+partition(n,coin//2)
     
216.     return partition(amount,coin_ls[-1])
     
217. 
     
218. ###################
     
219. # Extra Questions #
     
220. ###################
     
221. 
     
222. from operator import sub, mul
     
223. 
     
224. def make_anonymous_factorial():
     
225.     """Return the value of an expression that computes factorial.
     
226. 
     
227.     >>> make_anonymous_factorial()(5)
     
228.     120
     
229.     >>> from construct_check import check
     
230.     >>> check(HW_SOURCE_FILE, 'make_anonymous_factorial', ['Assign', 'AugAssign', 'FunctionDef', 'Recursion'])
     
231.     True
     
232.     """
     
233.     return 'YOUR_EXPRESSION_HERE'
     

复制代码

请问这个hog的problem6 的OK测试1的line1 应该是是什么啊一直过不去

smoothiethu 发表于 2019-7-24 18:09
请问这个hog的problem6 的OK测试1的line1 应该是是什么啊一直过不去

在github上找，每一个都有答案
一个参考

lilirr 发表于 2019-7-27 10:55
在github上找，每一个都有答案
一个参考

谢谢！虽然我还是没找到test的答案= =