OJ Board

This problem is quite easy. The cases you might want to check are boundary cases, like N=3650, P=1, P=100 etc., and those when a hartal occurs on the last day of the simulation or the day after the last. This input 6 1 1 1 3650 1 1 20 1 20 21 1 21 21 1 22 22 1 22 should give this output: 1 2608 0 0 ...

Try this input data (first line is T): Output should be 0 (why?).

Hope this helps.

Yahoo, this part is dubious: [c]while(1) { r=scanf("%d" ,&n); if(r==EOF) break; [/c] You should not try to read until EOF. According to the specification, "The first line of the input consists of a single integer T giving the number of test cases to follow. " Read the number ...

Try a case which gives one carry operation, for example

Try this input, and you'll see:
Also, there should be no blank line before the first output case, and after the last output case. There should only be blank lines between the output cases.

Try this case:
Output should be 1279.

You should check the existing thread about this problem ( http://acm.uva.es/board/viewtopic.php?t=1805 ). It's a multiple input problem (blue check mark). You should read http://acm.uva.es/problemset/minput.html to find out what the input and output should look like. The first line of input contains...

TWEmp, try this case, which your program doesn't handle correctly: The sum of two 9-digit numbers fits in a long int, but the product of a 9-digit number and 10 does not always fit.

It's a multiple input problem (blue check mark). You should read http://acm.uva.es/problemset/minput.html to find out what the input and output should look like. The first line of input contains the number of cases, and there should be a blank line between each output case.

You could try to make a solution that doesn't care about missing blank lines between cases. My solution ignores blank lines, so I don't know if the input has blank lines or not. You could also try to make the buffer bigger, if there are really long lines, since the maximum length of a city name is n...

Try this input:
Output should be 2608, not 2607.

Using fflush is wrong. fflush is only used for ensuring that all data written to a stream is really written to disk (or at least to kernel buffers...). You cannot use fflush to consume the newline character after the number on the first line. Instead, you could simply do [c]gets(line);[/c] right aft...

Using long int works fine, since the sum of two 9-digit numbers is less than 2000000000 which fits in a long int, and in this case the sum is not even calculated.

There is another error error in the program.

Try the case
The answer should be 2, not 3.

Your program doesn't produce the correct output for k=3. Output should be 2 (1+2 = 3) but your program answered 5 when I tried it.

The output for your test cases is correct. However, did you notice that this is a multiple input-problem (blue check mark)? Your program should accept input like this: 2 0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 ...