OJ Board

Hi, I think i know what might be the problem of your program. You declare 'p' as an unsigned long integer, but you print it with "%ld". This converts it to an singed long int, so it might end up as a negative value if it is above 2^31. You should print unsigned long int with "%lu"...

Thanks, i finally got accepted by parsing the numbers just until whitespaces. They seems so be seperated by whitespaces in the sample in. There are no test cases like .5.5 but always .5 .5 This makes this problem a lot easier, because the numbers in the inputs seems not just be of the form +1.2 but ...

can anyone who got accepted give me the output to:

Unfortunately i had no luck, even with your high number.
Has anyone mean test cases?

Hello, i have some problems with 482 . Acually it seems not very hard, but the lack of given sizes makes it a bit trickier. What i am doing to try to solve it: First i read every indices and store them in an array. Then i read the next line and parse every number and remember each start position in ...

Well, i solved it at last. It was just a stupid output problem. Remember that the output will be an unsigned 64bit integer. Stupid me .
It seems that some values will overflow a 64bit unsigned integer. But they wont have an influence on your result.

We had this problem at a local contest and we couldnt solve it in time. You can try a backtracking approach. But actually a friend of mine told me that there is even a closed formular for this problem.

Hello.
I am trying to solve the problem too, but i cant get it accepted.
Are there any tricky inputs? My programm can handle following input correctly:
Input:
Output: The length of my input line is 50000 and i handle up to 2048 different numbers.

Hello. I am trying to solve problem 10625 but i got wa a couple of times and cant figure out why. I use a simulating approach. I store the current number of each printable char and in every recursion step i add for every rule the number of the the char which i substitute to the number of the chars w...

I read this thread already, but it wasnt realy useful for me, because the discussion went in some other directions. So i started a new thread.

Hello. I am trying to solve problem 10625 but i got wa a couple of times and cant figure out why. I use a simulating approach. I store the current number of each printable char and in every recursion step i add for every rule the number of the the char which i substitute to the number of the chars w...