Youβre given a list of 100000 strings πΈπΈ. You are then given 104000 queries ββ (followed right after in input). Each query is a string, and the answer to that query πββοΈπββοΈπββοΈπββοΈ is the number of strings in the 100000 strings that are lexicographically smaller than or equal to the query. For every 1000 queries, calculate the sum ββ of those queries and mod the sum by 128. Then add the ASCII value of that number to a string. You should end up with a string with 104 characters. Submit what you find.
Test Data: