OJ Board

Nice to know you liked the problem!! :)

I was also thinking of a (binary search + greedy) solution but wasn't too sure about it. I basically wrote the judge solution with (binary search + network flow).

Can you share your greedy approach?
I am newbie in C++, so would you tell me please how could ...

First, generate the sequence x like the problem description
Then, generate the sequence s ,
where s = x[0] + x[1] + ... x
While computing, you can set s = (s[i-1] + x ) % m; , because we only deal with the remainder modulo m

For each 0<=r<m, count the number of s , so that s % m = r
That means ...

FAQ wrote:artie, try to avoid all 'runerror(200)' in your code

runerror would never execute if input and code is correct, so why it cause restricted function?

BTW, I removed it and got AC

I wish you to post some problems from UVA which could be solved using dynamic programming with profile. I couldn't find anything with http://shygypsy.com

In the contest I got AC, but in the oj I got restricted function. What should I do?

To those who feel bad about the "empty string" thing:

I don't see why you feel bad. Maybe you don't have time to read the problem statement carefully, but it has made everything clear. As for empty strings, from the problem description:

Here, we consider also the empty string as a palindrome ...

Hi. I am newcomer in c++ language. I got ac in the contest with pascal, but same algorithm in c++ got wa. I wish somebody explain me, what is wrong in c++ code:


Taking input is faulty..
I don't know exactly what it is.. but try this..


scanf("%d", &t);
gets(s);
while (t--) {
gets(s ...

Giorgi wrote:there is no critical input. what algorithm did you use?

Hi. I am newcomer in c++ language. I got ac in the contest with pascal, but same algorithm in c++ got wa. I wish somebody explain me, what is wrong in c++ code: