[알고리즘] 16. Birthday Chocolate

Lily has a chocolate bar that she wants to share it with Ron for his birthday. Each of the squares has an integer on it. She 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. You must determine how many ways she can divide the chocolate.

Consider the chocolate bar as an array of squares, . She 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. It should return an integer denoting the number of ways Lily can divide the chocolate bar.

birthday has the following parameter(s):

• s: an array of integers, the numbers on each of the squares of chocolate
• d: an integer, Ron's birth day
• m: an integer, Ron's birth month

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 ()

Output Format

Print an integer denoting the total number of ways that Lily can portion her chocolate bar to share with Ron.

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:

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:

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.

def birthday(s, d, m):

count = 0

for i in range(0,len(s)):

if sum(s[i:i+m]) == d:

if len(s) > 1:

count+=1

if len(s) == 1:

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()))

dm = input().rstrip().split()

d = int(dm[0])

m = int(dm[1])

result = birthday(s, d, m)

fptr.write(str(result) + '\n')

fptr.close()

길이가 1인 부분만 조심해서 연속적인 숫자의 합이 목표치와 같은 갯수를 골라내는 문제였다.