#include <stdio.h>
int is_alternating_pattern(int *mem, int k) {
// Write your pointer logic here
int *base = mem; // pointer to first element
int *p = mem; // scanning pointer
// Traverse only the first k elements
while (p < base + k) {
int offset = p - base; // pointer difference gives index
int expected = (*base + offset) % 2;
if (*p != expected) {
return 0; // mismatch → not alternating
}
p++; // move pointer to next element
}
return 1;
}
int main() {
int n, k, arr[100];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int res = is_alternating_pattern(arr, k);
printf("%d", res);
return 0;
}
Input
6 6 1 0 1 0 1 0
Expected Output
1