Banana Queries

Description

algo/banana-queries (by Turtlez200) | 441 points

nc banana-queries.hsctf.com 1337

Downloads: banana-queries.pdf

Solution

array_size = 1000 # Value from challenge
array = [ ... ]   # Value from challenge
  
biggest_subarray = 0
for i in range(array_size + 1):
    for j in range(i + 1, array_size + 1): 
        subarray_len = j - i # Calculate length
        if subarray_len < biggest_subarray: # Ignore subarray which length 
            continue                        # is less then already biggest

        subarray = array[i:j] # Extract subarray
        if sum(subarray) % subarray_len == 0:
            biggest_subarray = subarray_len 
        
        print(f"{i=}\t{j=} ", end='\r') # Progress Bar

print()
print(f"Biggest Subarray Length: {biggest_subarray}")

➜ py .\banana-queries.py
...
Biggest Subarray Length: {LENGTH}

➜ ncat banana-queries.hsctf.com 1337
...
...
Output:
{LENGTH}
flag{REDACTED}

Note: Commands are run in windows. py -> python3, ncat -> nc