-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathbus
More file actions
60 lines (50 loc) · 1.62 KB
/
bus
File metadata and controls
60 lines (50 loc) · 1.62 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
54
55
56
57
58
59
60
from random import randint
#busstop = 0
stops = [value for _ in range(4) for value in [(randint(4, 8), randint(0, 8))]]
riders_history =[]
riders = 0
ridersavg = []
done = 0
i = 0
print (stops)
#while riders < maxriders & riders +(stops[i][0])-(stops[i][1]) < maxriders:
for i in range(len(stops)):
# busstop += 1
riders += ((stops[i][0])-(stops[i][1]))
if (riders<0):
riders = 0
i += 1
ridersavg.append(riders)
print('number of riders at stop ',busstop,' is ',riders)
riders_history.append(riders)
print('the number of stop on this route is ',len(stops))
print('AVG = ', sum(ridersavg)/len(ridersavg))
import numpy
print ('SD = ',numpy.array(ridersavg).std())
print('amount of riders at each stop :',riders_history,'. the maximum amount is :',max(riders_history))
# other code, don't pay attention
from random import randint
busstop = 0
stops =[value for _ in range(randint(0, 20)) for value in [(randint(4, 8), randint(0, 6))]]
maxriders = 15
riders = 0
ridersavg = []
done = 0
i = 0
while busstop != len(stops):
if riders < maxriders & riders +(stops[i][0])-(stops[i][1]) < maxriders:
busstop += 1
riders += ((stops[i][0])-(stops[i][1]))
i += 1
print('number of riders at stop ',busstop,' is ',riders)
elif riders < maxriders | riders +(stops[i][0])-(stops[i][1]) >= maxriders:
busstop += 1
riders += ((stops[i][0])-(stops[i][1]))
i += 1
print('bus is full')
elif riders > maxriders & riders +(stops[i][0])-(stops[i][1]) <= maxriders:
busstop += 1
riders += ((stops[i][0])-(stops[i][1]))
i += 1
print('number of riders at stop ',busstop,' is ',riders)
print('terminus')