(Apr-17-2018, 02:26 AM)scidam Wrote: Try this:I tried, but the programm failed at 5 test. Looks strange, didn't it?
def find_i(a, m, k): n = len(a) for i in range(n - k): if sum(a[i:i + k + 1]) == m: return i return 0
Yes, I found it!!! This is the corect code:
n, k, m = (int(x) for x in input().split()) a = [int(x) for x in input().split()] rez=0 for i in range(n-k): if sum(a[i:i+k+1])==m: rez+=i+1 break print(rez if rez else 0)