#include <stdio.h> int is_alternating_pattern(int *mem, int k) { if (k < 2) { return (*mem == 0 || *mem == 1) ? 1 : 0; } int *ptr1 = mem; int *ptr2 = mem + 1; while (ptr2 < mem + k) { if ((*ptr1 != 0 && *ptr1 != 1) || (*ptr2 != 0 && *ptr2 != 1)) { return 0; } if (*ptr1 == *ptr2) { return 0; } ptr1++; ptr2++; } 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; }
Test Cases
Test Results
Input
6 6 1 0 1 0 1 0
Expected Output
1