FIXING MISTAKES

Problem Mistakes   Warnings   Multiple inputsFixedDate
101 The Output Section description has been changed in order to clarify it.
A new input file has been used to rejudge all the submissions
html, ps 06/04/00
102 The total number of bottles will never exceed 2^31.
A new input file has been used to rejudge all the submissions
html 08/04/00
103 If more than one solution exists, only the lexicographically smallest is accepted   25/02/99
104 As there is a specific jugde for it, any good sequence is accepted html, ps 05/03/99
106 The problem should specify x < y < z. The limit for the value of N is now 100000, to prevent people from sending just a table. input, output 18/07/00
110 In order to write a correct solution think about the relative order of the letters in the input   25/02/99
111 Sample Output 2 and output file were wrong
Read carefully the description and consider the difference between 'ordering' and 'ranking'.
html, output
 
01/06/00
113 Output file was wrong. input, output 15/06/00
115 There were query-pairs with two equal names. They are not more
Parent-child pairs in the input file, really are child-parent pairs
input, output
 
15/02/99
116 The number of rows in the input file is between 1 and 10 inclusive html, ps 15/02/99
120 There was a test case with two equal diameter pancakes. It is not the case now.
There is a new specific judge for it. Since, any correct solution is accepted
input, output
 
02/03/99
124 The output specification is wrong. Output file have not whitespaces between characters in a line   25/02/99
125 Problem description was wrong. The example graph have a lot more paths that the ones described in the past. html 04/01/00
128 The final # was missing in the input file
Input file has blank lines to codify
input
 
15/02/99
129 Each line in the output file has 16 groups (if there are more) html, ps 15/02/99
149 It seems that the output file was not correct. Please, try with the new one output 18/02/99
164 Output specification was wrong. I'm sorry html, ps 09/03/99
165 When a test case have more than one optimum solution, the judge only allows the sorted last (the "largest")   27/02/99
185 The initial table was not correct, because it had only a column html, ps 15/02/99
194 We have changed the output specification and the output file to a six decimal places fixed-point format. html, output 27/04/00
197 The solution must be lexicographically ordered to be accepted   27/02/99
201 Sample input and output were wrong. Look at the output description. I'm sorry. html 22/04/00
232 Output file was wrong. I'm sorry.
Output description has been fixed.
output
html
08/05/00
264 The input file may have more than 30 numbers. html 27/11/99
270 Test cases are now in the multiple input format. Modify your codes and try again, please input, output 10/03/99
273 Test cases are now in the multiple input format. Modify your codes and try again, please input, output 13/03/99
274 Test cases are now in the multiple input format. Modify your codes and try again, please
Room numbers start at 1 (instead of 0)
There are pairs of equal positive integers
input, output
 
 
14/11/99
276 Output specification was wrong. I'm sorry html11/04/00
277 Test cases are now in the multiple input format. Modify your codes and try again, please input, output 23/03/99
302 The description of this problem has been fixed. "Round trip does not exist." must end in a period
Junction may connect much more than 44 streets. John lives in the 1st street input.
html 17/04/00
357 In a penny, nickel, dime, quarter and half-dollar there are 1, 5, 10, 25 and 50 cents respectively   28/03/00
361 You should also consider 3 collinear points as a triangle.   23/02/00
369 The test input file had values below 5, and test output file was wrong. I'm sorry.
The same problem extended to the sample input values.
input, output
html
22/06/00
398 Output file has been changed in order to match the exact specification and sample output. html,output 24/04/00
449 There was a typing mistake. We have fixed C/Bb to C/B# in the background description. html 28/06/00
469 Diagonal cells are considered to be adjacent. html 13/04/00
474 The description of this problem has been changed.
It uses now a input file. Modify your codes and try again, please.
html,ps
input, output
05/04/00
495 Input numbers are <= 5000. input, output 02/08/00
500 Test cases are in the multiple input format. Modify your codes and try again, please   14/04/00
501 Test cases are now in the multiple input format. Modify your codes and try again, please
Write only a number per line in the output
input, output
 
17/06/99
506 Assume that the order of the dependency list is important. That is, if TELNET depend on TCPIP and NETCARD, we must first try to install TCPIP and then NETCARD (for removing, they are removed in the reverse, i.e., NETCARD and then TCPIP in this example).   28/04/00
603 Test cases are now in the multiple input format. Modify your codes and try again, please input, output 31/07/00
604 First letter may be a vowel. Each word contains exactly 2 vowels  09/11/99
607 The formula was wrong html, ps 06/04/99
623 Keep in mind that, in the paper or screen, big numbers will seem broken every 80 characters, but your program must write them on a single line each one   28/03/00
640 Output limit has been increased to a million. output 02/08/00
688 The number of antennas may be 1. The output file was wrong.
The area may be 0.00
output
 
09/11/99
711 Test output file was wrong. We have changed also the input file for a smaller one input, output 17/07/00
721 The bus stops are numbered from 1 to P.   08/04/00
750 Test cases are now in the multiple input format. Modify your codes and try again, please input, output 24/03/00

Back to ACM Contest Problem Set