-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSubarray_Division.py
124 lines (81 loc) · 2.67 KB
/
Subarray_Division.py
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
# Two children, Lily and Ron, want to share a chocolate bar. Each of the squares has an integer on it.
# Lily decides to share a contiguous segment of the bar selected such that:
# The length of the segment matches Ron's birth month, and,
# The sum of the integers on the squares is equal to his birth day.
# Determine how many ways she can divide the chocolate.
# Example
# Lily wants to find segments summing to Ron's birth day, with a length equalling his birth month, . In this case, there are two segments meeting her criteria: and .
# Function Description
# Complete the birthday function in the editor below.
# birthday has the following parameter(s):
# int s[n]: the numbers on each of the squares of chocolate
# int d: Ron's birth day
# int m: Ron's birth month
# Returns
# int: the number of ways the bar can be divided
# Input Format
# The first line contains an integer , the number of squares in the chocolate bar.
# The second line contains space-separated integers , the numbers on the chocolate squares where .
# The third line contains two space-separated integers, and , Ron's birth day and his birth month.
# Constraints
# , where ()
# Sample Input 0
# 5
# 1 2 1 3 2
# 3 2
# Sample Output 0
# 2
# Explanation 0
# Lily wants to give Ron squares summing to . The following two segments meet the criteria:
# image
# Sample Input 1
# 6
# 1 1 1 1 1 1
# 3 2
# Sample Output 1
# 0
# Explanation 1
# Lily only wants to give Ron consecutive squares of chocolate whose integers sum to . There are no possible pieces satisfying these constraints:
# image
# Thus, we print as our answer.
# Sample Input 2
# 1
# 4
# 4 1
# Sample Output 2
# 1
# Explanation 2
# Lily only wants to give Ron square of chocolate with an integer value of . Because the only square of chocolate in the bar satisfies this constraint, we print as our answer.
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'birthday' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER_ARRAY s
# 2. INTEGER d
# 3. INTEGER m
#
def birthday(s, d, m):
# Write your code here
count=0
for i in range(len(s)-m+1):
temp=[]
for j in range(0,m):temp.append(s[i+j])
if sum(temp) == d:count+=1
return count
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
s = list(map(int, input().rstrip().split()))
first_multiple_input = input().rstrip().split()
d = int(first_multiple_input[0])
m = int(first_multiple_input[1])
result = birthday(s, d, m)
fptr.write(str(result) + '\n')
fptr.close()