a,n=map(int,input().split())
t=list(map(int,input().split()))
NbC=0
for i in range(a):
D=abs(n-1-i)
if n-1>i:
if t[i] and n-1+D<a and t[n-1+D]:
NbC+=1
elif t[i] and (n-1+D>=a or i==n-1):
NbC+=1
else:
if t[i] and n-1-D>-1 and t[n-1-D]:
NbC+=1
elif t[i] and (n-1-D<0 or i==n-1):
NbC+=1
print(NbC)#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,cnt=0;
cin>>n>>a;
int c[n];
int l=a-2,r=a;
for(int i=0;i<n;i++) cin>>c[i];
while(r<n || l>=0)
{
if(l>=0 && r<n && c[l]==1 && c[r]==1)
cnt+=2;
else if(l>=0 && c[l]==1 && r>=n) cnt++;
else if(r<n && c[r]==1 && l<0) cnt++;
l--;
r++;
}
if(c[a-1]==1) cnt++;
cout<<cnt;
return 0;
}
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |