OJ Board

mhulboj wrote:Could someone provide a hint why this code yields WA?

If "2 3" was inputted, output should be "2 3 8".

By the way, you should remove your JUDGE_ID from your previous post by editing,
because there is danger to which your ID is misused by the third party.

Best regards.

Roby wrote:8 4 6 7 5 2
1 2 3 4 5
5 4 3 2 1
5 1 2 3 4

My output is :

8 4 6 7 5 2
1 4 2 5 3 4 5 0
1 2 3 4 5
0
5 4 3 2 1
1 0
5 1 2 3 4
1 2 0

Please check my previous post again.
And, we don't need to consider about the last 2 cases, as mosaick2 says.

Best regards.

I think your approach is correct. But the flips' ID is a bit funny. (.... you may have done it on purpose to explain plainly for us) :) Convert to "ID = (Number of pancakes) + 1 - ID". 8 4 6 7 5 2 -> 1 2 5 7 6 4 8 -> 4 7 5 2 6 4 8 -> 2 4 6 2 5 7 8 -> 5 6 4 2 5 7 8 -> 3 5 2 4 6 7 8 -> 4 4 2...

if(hasil[i]) { else printf("%3lld", hasil[i]); counter++; } In this part, 'else' is illegal then return compile error. By the way, there are already many many threads about problem 160. http://online-judge.uva.es/board/search.php Did you check all posts from here? There are a lot of test ...

newton wrote:may you check it please?
both of c and c++ compiler told me runtime error.
but why?

array[1000] -> array[3651]
day[3651] -> day[100]

After getting correct answer, please delete above your code.

Best regards.

I think the cause of WA is the little bugs in your code, but I can't analyze because I'm not good at C++.
I'll only give you critical test case. The answer is 10, but your output is 11.

Best regards.

Hi, jan_holmes.
Your code was failed in the following case. Correct output is : Best regards.

Try these test cases Both of thier answers are 12.

Best regards.

Hi,
your code didn't return N itself as a part of output, if N cannot be represented as the sum of two prime number.
Please check your output format carefully.

Best regards.

Hi, I'm trying to solve this problem, but got WA. I want to know the information about the problem description. Can anyone help me? 10 4 8 0 1 1 0 2 2 0 3 3 1 2 3 1 3 4 1 4 5 2 4 6 3 4 7 0 0 0 Can the train pass the station visited once? For example, in above test case, if the train can pass the sta...

I don't know what is wrong in your code, but please check this input. http://online-judge.uva.es/board/viewtopic.php?t=7804&start=15 4 29 1 -1 0 0 1 -1 -1 -1 1 1 0 1 -1 -1 -1 0 -1 -1 1 -1 1 0 0 -1 0 -1 1 1 0 -1 1 0 -1 -1 0 1 0 -1 -1 -1 -1 1 1 0 -1 -1 0 -1 -1 1 -1 1 0 -1 1 0 1 -1 0 0 1 0 -1 1 0 0...

Hi,
the range of N is 1 <= N <= 10000.
So, you have to assume the special case N = 1.

Best regards.

Hi, farzane. First of all, read problem again, then you'll found this description. New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. But, you wrote only 8 kinds of coins. And, the output may be very large value. For example, 20.00 2886726 30.0...

Hi, everyone. I have a question about the usage of this board. When I read/write or edit the post, I am troubled with the character(letter) at the end of line. For example, every line has an additional blank space in the end of line. But, if there are no characters except for '\n' (blank line) or an...

I got many WA, but I could solve finally. I missed out this part. Next lines contain integer number k and one message of ascii characters separated by one space . If you faced same problem as me, please try the following case. :) Input: 10 4 5 3 7 2 8 1 6 10 9 14 eccApted!! 12 Accepted! 16 hesAnTwer...