Sane

No, sorry. But if you're worried because you think you might have misinterpreted a part of the problem, feel free to ask for clarification.

__________________
Waterloo's Canadian Computing Competition (CCC) - Stage 2 Problems, Solutions, and Test Data

mbd

i think i get it, but i just dont really want to invent my own boundary cases to test my solution. i am just going to submit what i have. do i really need to wait a month before i get any results?

Freaky Chris

Sane, if i have missed things it really wouldn't suprise me its the first time i've ever tried anything like this so and as for it being easy well yer it wasn't really lol although when i looked at the submission it did look suprisnly simple compared to what i originally though it was going to be. I may look back at it in a few days and see if there are changes I can find and change...although i doubt it lol. I did create a few tests myself but none seems to be incorrect.

I may take a look at Senior but i think i will have many problems with this as at a quick glance it looks significantly more complex hehe.

Ah well any submissions i do make are my best shots lol and i hope they work reasonable well. Btw when you release results will you be pointing out what is going wrong with our algorithms or mine at least since most peoples will be perfect hehe.

Chris

__________________
Who said i couldn't program
sarcasm = raw_input('Type in a sarcastic remark: ')
print sarcasm

Sane

Yeah, it's a lot of work to put all of this together, so once a month is all I can spare. If I were to score your submission early, it would make it more time consuming to moderate. Especially since I'm not perfect and will use everyone else's solutions to verify that all of the test files are correct. Additionally, it's a bonus for you if you can come back two weeks later, double check, and resubmit.


All solutions will actually be surprisingly simple. I will never make you code something larger than 100 lines (with the exception of Guru). Generally, the challenge comes in unravelling the logic behind the problem, and translating that into efficient code. It's not intended to be an uphill battle writing hundreds of lines of complicated code.


I've looked at your submissions and am sure you will do quite well. When I release the results, I won't explicitely state what everyone did wrong, but I will post the correct solutions and explain them. Hopefully from that, people can deduce their mistakes. If not, that's why we've got this thread (and hopefully more to come) to answer all of those questions.

And I doubt everyone will get perfect on junior or even beginner. I'm guessing a handful might, but often people forget to handle tiny things which proves to be problematic on tricky test files.

__________________
Waterloo's Canadian Computing Competition (CCC) - Stage 2 Problems, Solutions, and Test Data

Freaky Chris

Ye that works for me, it should provide enough aid to show where im going wrong.

Chris

__________________
Who said i couldn't program
sarcasm = raw_input('Type in a sarcastic remark: ')
print sarcasm

MiKuS

on the first question, i have working code but i'm wondering what is the largest we can expect k to be in the example input format?

Sane

That information is given to you in the "Input Format" section.

If you meant to ask about "n", then it may be any integer. And the answer will always be calculatable with a 32-bit signed integer.

__________________
Waterloo's Canadian Computing Competition (CCC) - Stage 2 Problems, Solutions, and Test Data

Sane

A Notice To All Those Doing Senior:

So far every submission to the senior problem has underestimated the complexity of the problem and scored maybe 40/100 points.

I'm not going to explain why. But here's a simple test case that exploits the major flaw in all submitted algorithms.

Sample Input #2:

Sample Output #2:

Explanation Of Sample Data #2:

This mistake is not so simple to fix either. You may have to rethink your approach to the problem. Notice the upper bound on the input (n <= 100). There's a good reason it's so small, but still not small enough for an brute force approach.

Good luck!

__________________
Waterloo's Canadian Computing Competition (CCC) - Stage 2 Problems, Solutions, and Test Data

BstrucT

Thanks for the cool section Sane, trying to get to grips with Beginner section, but looks very cool.

Word up for your effort man.

>BstrucT

__________________
"The truth is that if I had to meet any of my interrogators today, and knew I could get away with it, I'd slot them." - Andy Mc Nab - BRAVO TWO ZERO

Ooble

I shall find time to fix my Senior problem answer, I swear it.

__________________
Me :: You :: Them