Sort 6 Discussions, By:
Please Login in order to post a comment
The answer to Test Sample 0, query 3 is wrong.
For the Test Sampel 0, Expected output is:
While it should be:
The 7 palindromic string for input abc, abc are:
Any tips on this one, can't figure out how to write a program that could cope with the size of the possible problem set.
Can anyone explain 3rd sample test case? why answer is 9?
Why does the question request modulo(10^9 + 7) ?
"print the number of ways of choosing non-empty subsequences, modulo 10^9 + 7"
unless the number exceeds (10^9+7) the answer will be the same.
I'm not seeing why this sentence exists in the problem description. What am I missing?
Seens I am first post :)
I found this problem description tricky and wording could do with improvement.
The first line contains a single integer, q, denoting the number of queries. The subsequent lines describe each query in the following format:
The first line contains an integer, n, denoting the size of the list.
Each line of the subsequent lines contains a non-empty string describing ai.
change above wording to
A- first line is an int nominating the number (X) of data sets to follow.
B- 2nd line is an int, nominating the number of n lines of text to follow.
C- next n lines are text
repeat B & C X times.
obvious once spotted. :)