View Clarifications


[ Contest Page | Scoreboard | Submissions | Clarifications | Help | Stuff | 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?

Java class names?

Please use the following class names (make sure classes are public):

Problem A - public class A { ... }
Problem B - public class B { ... }
. . .
General Compilers?

gcc 4.8.5
javac 1.8.0_144
python 2.7.13
D - David's Digital Display Design please define horizontal symmetry

the image should be "equivalent" if you reflect across a vertical line in the middle
General Are the problems in order of difficulty?

NO
E - Eugene's Exceptional Escape the problem has three options resided/resides/will reside
so which one is it?
Does it suffice to output a year where eugene was but is no longer there?

No, you need to output where he is "right now"
D - David's Digital Display Design please define rotational symmetry

If you can rotate the image X degrees clockwise and get the same image
D - David's Digital Display Design does it mean we have the combination 1:1 4 times in case of X:X?

No. There is only one possible configuration of each digit.
E - Eugene's Exceptional Escape The given input does fit in limits, am I right ? ( a , b = both should be nonnegative integers <=50 )

The problem is interactive so those numbers are not given in input. But they are guaranteed to be non-negative integers in [0,50] as stated.
D - David's Digital Display Design 6:9 and 9:6 would be considered the same number?

Read the statement carefully.
E - Eugene's Exceptional Escape what happens if my program outputs stuff after the i find eugene

That should be fine, as long as you guess it correctly before the limit is exceeded.
F - Faul's Fall r1, c1 is supposed to be the bottom left corner and r2, c2 is supposed to be the top right corner.

In the sample, how is (1,2) the botoom left and (2,3) the top right?

Row numbers increase from the bottom to the top. Column numbers increase from left to right.
F - Faul's Fall If 2 pieces of Fried chicken are within reach but you have to go through the 1st fired chicken to get to the 2nd chicken then would Nasa poison both?

Like in the sample output if there was another chicken at 1 3 then would the output be 1 or 2?

Yes
F - Faul's Fall Are there more chickens than can be fit on the board? (More than one chicken per cell?)

Each cell that is not covered by one of the two obstacles can contain any number of chickens.
G - Greg's Gardening Grief Is it guaranteed to always be possible?

_(ツ)_/
E - Eugene's Exceptional Escape Can you remove my duplicate wrong submissions on E because I forgot to sftp the file

no
G - Greg's Gardening Grief Does the plant consume healing power? Eg. Gi = 10, Gi' = 5, Healing_in= 5, Healing_out = 0

Plants do not consume healing power; a pill contributes same healing power to all plants downstream from the pill.
G - Greg's Gardening Grief Can a non-terminal junction contain germs, and if so, will water with healing power passing through these junctions kill those germs?

A non-terminal junction contains no ginseng and no germs.
E - Eugene's Exceptional Escape Correct me if any of this is wrong.

I output a guess (in years) of when Eugene is currently at. Currently Eugene's time is...
"Currently" = 3017AD + a + b * program runtime

In otherwords, Eugene moves in time while the program is running?

After each guess you make, Eugene moves forward by b years.
E - Eugene's Exceptional Escape Is Eugene's time travel continuous or does he jump an entire 'b' number of years each second without visiting the years in between?

He jumps exactly b, not visiting the years in between.
C - Coach's Cypress Conquest can daniel gondola down from some stop?

No.
C - Coach's Cypress Conquest The question says : " Coach Daniel can take the gondola to any one of the n stops, where he will get off and begin skiing downhill. "
. So in this case he can start his skiing from some middle stop ( one that is not at the very top e.g. is not the summit ) and ski down the hill up until some another stop and the total relaxation will be the sum of the relxations of the stops that he passed while skiing , is it right ?

Coach Daniel can start skiing at any stop and stop at any stop he reaches by skiing downhill. His relaxation is the distance skied.
G - Greg's Gardening Grief What if junction 1 has nonzero number of germs? Then water never has the healing power to kill these germs?

Read the statement carefully. (Hint: 1 will never have ginseng.)
B - Bird Bork's Battle If he only burns calories with change in elevation, then he would burn the same amount regardless of where the books are. So how does the coach maximize the calories?

"If he only burns calories with change in elevation, then he would burn the same amount regardless of where the books are." is not true.
D - David's Digital Display Design "the image should be "equivalent" if you reflect across a vertical line in the middle"

shouldn't this be vertical symmetry?

No.
F - Faul's Fall if there are 2 chicken on a tile Fasa will use 2 units of poison right?

Yes, if Faul can reach that chicken.
C - Coach's Cypress Conquest If there are n stops are there always n-1 ski runs ?

yes


Ultra Cool Programming Contest Control Centre v1.8
Copyright (c) 2005-2010 by Sonny Chan