OJ Board

Notice the sorting order(STAR FIRST!!), and there's one tricky input is the schedule may be in two different years!!

I think you may try enlarge your buf[] array size to:
[c]
char buf[1000002];
[/c]
instead of 1000000, the reason we need two more space is because you need one char to store the ending char '\0', and the other one, since you use fgets, will store the end line char '\n'

I'm working with this problem now. I did use method similar with 2-SAT problem, I first construct a graph use following way: Let each street and each avenue be two vertecies, one means the positive direction and the other means the negative direction. And then for each route (s1, a1, s2, a2), if s1 ...

my recurrence is:

Please, see the previous articles in this Volumn.
Joe Smith has provided a great way to solve the problem and the complexity is O(n^2)

indeed...by definition
f(-1) = 1 / 0 should be NaN instead of Inf

lim 1 / n is Inf
n->0+

my solution uses no combination numbers.
I just maintain an array table[101],
which table means how many solutions in i coins.
Find the recurrence and use dynamic programming skills to solve the problem. The recurrence contains terms represented as power of 2, think of it.

I've solved acm137 already, but not this one...
That's why I posted here to seek help.

Do I need to do convex hull in this problem?

But, you can solve it in O(n^2)... you only need to fill a 300x300 array, where A [j] is the # of ways of getting $i total dollars where all the coins are of value at most j. I have a problem... I did use O(n^2) space complexity, but although I maintain A[300][300], I still need to use O(n^3) time ...

whenever I got a TLE reply, first of all, RETHINK the problem's algorithm...although it seems like a waste of time, but it may be the only way to truly solve the problem. Only few (really few) problems I've written can be solved by just optimized my code. (there's one...10304) By the way, if you sur...

quite thanks

yes, probably the test data was chosen...
but after I got several WA and test my program several times...
I think I should check it out if there's any mistake judge made.

In the problem description it said:
"If there is more than one solution, any will do. "
but the icon of the problem shows that it doesn't use special judge...
may any adms tell me what's going on?