View Clarifications


[ Contest Page | Scoreboard | Submissions | Clarifications | Help | Log In ]


ProblemClarification
General I/O?

Please use standard in and standard out!

Input --
Java: Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
C: scanf("%d %d", &integer1, &integer2);
C++: int x; cin >> x;

Output --
Java: System.out.println("asdf");
C: printf("%d %d", integer1, integer2);
C++: int x = 5; cout << x << endl;
General Java class names?

Please use the following class names:

Problem A - public class A { ... }
Problem B - public class B { ... }
. . .
B - Blackboard Bonanza Should the file name be A.{java,c,cpp} or B.{java,c,cpp}??

Sorry, it was a typo - should be B.{...}
C - Calculator Conundrum Is the first sample correct? I get 6.

No. Problem statement should say "when the number overflows only the first N digits are displayed". Then the answer will make sense.

Please use "first N digits" when solving.

Problem statement is fixed now. Firefox users might not know that.
C - Calculator Conundrum Does the max number include the original k itself?

What does the problem statement say? Is it maybe implied? I shouldn't be like this... yes, it includes k.
General how long does our program get to run

10 secs per submission.
G - Grid Game Can Alice only move only on rows, and Bob only on columns?

Yes.
General Is it okay to print debug statements to standard error? If I leave these debug statements in the submission, will it get marked incorrect?

If you leave the debug statements, the solution will most probably judged as Incorrect (it gets into a file that we use to check for correctness).
B - Blackboard Bonanza What is 1 turn?

Is 1 turn a play by Alice or Bob alone or is 1 turn a play by Alice AND also the play by Bob??

In second example, Alice wins nothing in her first turn and Bob can win 2 candies in his first turn. If there was a third word and Alice could win 3 candies, the answer would be 3, not 5. Is that what you are asking?
B - Blackboard Bonanza In example 2 of Problem B, shouldn't the second player get 2 candies because he/she can do this to make "BC" align:

ABCB
*BCAB

This gives him a score of 2!

I thought that was what the sample output was showing... what file are you reading?
B - Blackboard Bonanza I did not meant the output, I meant the green picture - the second one.

... or they can be aligned as in the example on the last board (same words, if you pay attention). I guess looking at pretty pictures (thanks, Sean!) can help solve some problems.
B - Blackboard Bonanza For a case with > 2 words, are we supposed to consider all possible word combinations? (I.E. find try matching word 1 with word 3) or are the words in the list "in order" and only one word can be checked against the previous?

I see no reason why word 3 cannot be drawn out of the bag after word 1 (or the other way around).
D - Demanding Dilemma if N is 1, then M is bounded between 1 and 0, so can we assume that N is not 1?

Assume that the problem statement is wrong and that N can be 1 in which case M is 0. Sorry about that.
D - Demanding Dilemma Are there allowed to be lines that are not incident to any vertices? So, a column of only 0s? Or would that be an illegal entry in the incidence matrix?

This is what the problem asks.
G - Grid Game What does it mean by "play optimally." How do they choose which column/row they are going to pick?

"Playing optimally" means "playing in such way to maximize gain (or minimize loss if gain is not possible)". That is how they pick columns/rows. The problem is, basically, asking you to find that way of playing.
D - Demanding Dilemma If someone missed it:
if N=1, M must be 0, right?

There are cases where N=1 and M=0 contrary to the problem statement. It is still true that M>0 for N>1.
E - Experienced Endeavour "The integer r is the number of times these operations are to be repeated on a list before returning the result."

Each time you repeat the operations, do you repeat them with the original list as inputs, or do you use the previously generated list as inputs?

Every time you use the newly generated list. Can you get sample output some other way?
D - Demanding Dilemma Sorry, I may just be being impatient, but I just want to make sure this is correct. If M=0 in D, then we are expecting 1 line with 0 integers, correct?

let me check the input file, I'll tell you exactly what's going on.
E - Experienced Endeavour What are the bounds on the x's?

They are bound by n. As in, they do not have repeated numbers if that's what you are asking.
D - Demanding Dilemma How does N=1,M=0 work in the input?

There is a line with no integers on it following the line with N=1,M=0.

Sorry again about this. Problem statement is updated to allow M=0. So, you would get N lines with 0 integers.
H - Hapless Hedonism Is the problem specific about the type of triangle that is constructed (isoceles, right-angle, scalene)?

No, any triangle will do. Just make sure it is really a triangle.


University of Calgary Programming Contest Control Centre v1.6
Copyright (c) 2005-2007 by Sonny Chan