#include <stdio.h> int is_alternating_pattern(int *mem, int k) { // Write your pointer logic here int *start = mem; int *end = mem + k -2; int i = 0; while(start < end) { printf("*mem: %d *(mem+2): %d\n", *start, *(start+2) ); // if( (mem[i] == mem[i+2]) && (mem[i] != mem[i+1]) ) if( (*start == *(start+2)) && (*start != *(start+1)) ) { // return 1; } else{ return 0; } ++start; } 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