Submission #12,159

2024-12-05 13:52:37

python3

Accepted 50/50

50ms

5008 KiB

#befájl = open("be2.txt")
#n,k=map(int,befájl.readline().split())
n,k=map(int,input().split())
#rét = list(map(int,befájl.readline().split()))
rét = list(map(int,input().split()))
#print(n,k,rét)
virágokDb = 0
for i in range(n):
    if rét[i]==1:
        virágokDb += 1
eredmény =((virágokDb-k+1)*(virágokDb-k+2)//2)
if virágokDb<k:
    print(0)
else:
    print(eredmény)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	3120 KiB
		2	Accepted	0/0	16ms	3156 KiB
		3	Accepted	0/0	43ms	4916 KiB
		4	Accepted	2/2	16ms	2868 KiB
		5	Accepted	2/2	17ms	2872 KiB
		6	Accepted	2/2	16ms	2872 KiB
		7	Accepted	3/3	17ms	2972 KiB
		8	Accepted	3/3	16ms	3072 KiB
		9	Accepted	3/3	16ms	2944 KiB
		10	Accepted	2/2	17ms	2872 KiB
		11	Accepted	3/3	16ms	3148 KiB
		12	Accepted	2/2	14ms	3056 KiB
		13	Accepted	3/3	16ms	3136 KiB
		14	Accepted	2/2	48ms	4732 KiB
		15	Accepted	2/2	48ms	4568 KiB
		16	Accepted	3/3	46ms	4944 KiB
		17	Accepted	3/3	43ms	4636 KiB
		18	Accepted	3/3	50ms	4828 KiB
		19	Accepted	3/3	41ms	4820 KiB
		20	Accepted	3/3	48ms	4964 KiB
		21	Accepted	3/3	46ms	5008 KiB
		22	Accepted	3/3	50ms	4968 KiB