
int check_sin(int *sin_array) {
    //int arr[9];
    int i;
    int sum = 0;
    if (sin_array[0] == 0) {
        return 1;
    }

    for (i = 1; i <= 8; i += 2) {
        sin_array[i] = sin_array[i] * 2;
        if (sin_array[i] > 9) {
            int x = sin_array[i] % 10;
            int y = sin_array[i] / 10;
            sin_array[i] = x + y;
        }
    }

    for (i = 0; i < 9; i++) {
        sum += sin_array[i];
    }
    
    if (sum % 10 == 0) {
        return 0;
    } 
    
    return 1;
}

multiply every two index by two then add all the elements in the array if it is divisible by 10 then return 0