OJ Board

The test cases I posted were in my post right before yours.

I see that my message there has been cut away (removed).

Maybe my posting of that information was not allowed :(

Ok, from memory I can offer only small advice, and that is to be sure to write test cases to check border conditions.

Hope ...

hi, Im yoshiro.

sorry, my problem was I sent an old version of my program to the judge by accident.

The program that passed millions of test cases of course got AC. I enjoyed writing that test case generator : )!!

I posted several critical test cases for this program challenge here, but I don't ...

hi, please identify the problem number & title that you are trying to solve.

I noticed that you are using file i/o in your program. This is not allowed by the 'Judge' program.

good luck!

Im sorry that you cannot understand it, but I cannot make it more clear than what I have already said. I hope someone else may be able to help you.

have a good day

The problem is not a big deal, but watch out that you use a good pi value.
I used 3.14159 from memory, but it was not good enough.

Pi is in math.h, and on MS compilers its ifdef'd out.
here it is: 3.14159265358979323846, u can borrow it :wink:

Maybe best to copy & paste it to a variable on such ...

Dynamic programming simply caches intermediate results whereas recursion does not.

When the recursive function returns, all of the intermediate results are lost.
So, for the same input twice you get to do all of the steps over again!
What do you think about that?

Adding a cache to your recursive ...

My 10427 code passed 41 million test cases by today.

So, I looked at Judge email and I see it is not the code I submitted to the Judge for the

I finished the server.
So, the table values are comparing with calculated values now on my WA code.

Its at 320,000 now and should be done in 92 hours.

I suspect the problem may be that the judge expected a space (or not) from the beginning, or maybe a bug on my part in higher numbers. Who knows ...

Im using C++.

The problem didn't say much about formatting, so I have no idea.
I made the output like in the problem, and expect PE if the Judge gets picky about spacing.

I finished the named-pipe server for my sequence db, and a client. So, tomorrow I will test my pgm on all possibilities if I ...

I wrote a program that writes the series (1,2,3,4,...,99999999) to a disk file.

I then access using "file.seekg(iIndex)".
So, I have all answers for the entire test range.

But after checking 50 random points there is no failure as yet.
It must be a very odd bug, to pass so many test cases and ...

My code passes all my present tests and all those posted on this site, yet I get WA:x

I had to reduce the largest number I could resolve to 99,999,999
so the Judge could compile it. Its ok, because 10427 says
"N<100,000,000".

But I can easily resolve the much larger test numbers found on this ...

nm.

fpavetic posted message is correct

What is this on AC code? I am unsure of some results here:



5768678


Thanks very much

I really like all of these programming problems.

Is there a method or procedure for submitting new problems?

thank you

I left reply with your other message, hope it helps you.

As for Windows XP Home, I don't know about it. I use XP Pro. My XP Pro can encrypt files all by itself.

This is how to encrypt files on XP Professional. Maybe it will work on your XP Home:

1. In Windows Explorer, Right click on the file or ...