OJ Board

Are there multiple runs? So, what is the input format? What is the exact format if numPatients = 100? 100 won't fit into two columns, but two columns for patient ID number is what is shown in sample I/O. I have the same questions. The problem description states expressly that there is only one inpu...

Once you have all of the basic gates set up properly, the thing to check is to make sure you handle chained outputs. Input: 1 12i 22 .. 22! 33 .. 33& 53 .. 16i 33 .. 53o 63 .. 63o .. end 3 01 11 00 Output: 11 00 00 If you don't chain outputs properly, you'll wind up with 10 as an answer ot the first...

I think the test cases for this problem actually uncover literally every precision problem that you can have with floating point numbers. NaNs from subtracting two non-NaN floats, negative 0's...this was quite a party! Also, remember that a point is a degenerate circle. So, you have to cover the cas...

I was certain that the test data was improperly formatted on this one. SURPRISE, it's not! When you expand the numbers to text, don't use any 'ands' between the numbers. So, 101 is ONE HUNDRED ONE, and NOT ONE HUNDRED AND ONE And even though the number to text expansion seems easy, I had to write a ...

I'm confused on this one.
Couldn't the answer to the first input be any number greater than 90?

1 1 1 1 1 1 1 1 1 9
2 4 6 8 10 12 14 16 18 90

9 = 9 % N
90 = 90 % N

Doesn't every integer greater than 90 satisfy both of these?
So why is the expected output for this one "impossible"?

If anyone wants to try this one in Java, there is a Java implementation of the crypt() function here : https://cseweb.ucsd.edu/classes/wi14/cse130-a/homeworks/hw5/Crypt.java Just in case that link breaks, it's also below. (Note that C/C++ users are allowed to link to the library with the crypt comma...

Possibly helpful test case :

In: Out:

The tricky ( annoying ) thing about this one is that how to compute "longest record with team" is underspecified. Is it total years across all stints with team, or player with the longest spread of years ( possibly not continuous ) in his history with team? I tried it both ways - figure out total ye...

In Java, BigDecimal can make some computations easier, but it's incredibly slow. So, use native doubles on this one. Also, you will be tempted to use String.format( ) to output your native double results. However, in Java, String.format() is incredibly slow. So, try writing your own custom formatter...

What in the problem statement allows us to assume that the lines are drawn through the middle point of the input sequence?

How can this possibly be done with Floyd Warshall?
That has a cubic big-O run time, so with up to 500 vertices, that could amount to 125,000,000 iterations for a single problem instance.

Does the judge input not match the problem spec? I've tried parsing the input numerous ways: 1) multiple words and scores can appear on the same line 2) word on one line and score one next 3) word on line only ( assume score is 0 ) 4) number on line only ( assume word is empty string ). I can't get ...

Some I/O In: 125 5 7 +---+---+---+---+---+---+---+ + + + * + + + + + +** +** + * + + **+ + **+ + * + * + * + + * + + * + +---+---+---+---+---+---+---+ + + + + * + + * + * + + + +** +** +** +** +** + + + + * + + * + + + +---+---+---+---+---+---+---+ + + * + + + + + + +** +** + **+***+ **+ **+***+ + *...

If you use the UHunt cached version of the pdf, it directs you to fill to the 40th column and start the double of the multiplicand in the 41st.
The actual statement at UVA directs you to fill to 34 and start in 35 for multiplicand.
Use the UVA version of the statement!!!!

How can the answer to the 4th test case: 2 2 2 2 3 0 possibly be: Nr values = 5: 4.000000 0.000000 Since there are 4 2's followed by a three, I see 5 "up" series of length 1, 2, 3, 4, 5. So, given that there are 5, shouldn't the average length be 3?? Since so many have gotten this one, and no one is...