OJ Board

can anybody give me some critical input & output???

should i consider negative value??
can it be n=1??
i've solved this problem using stl queue.....but getting wa

There is no negative values for n. But n can be 1.

You can try the following input output set.

Input: Output: Hope it helps.

thanks Jan. i didn't consider for n=1. now got acc

Greetings!

The following operation is performed as long as there are at least two cards in the deck:
Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck.

Your task is to find the sequence of discarded cards and the last, remaining card.

I believe input n = 1 is contradictory to the statement of the problem.
They ask you to find a sequence of discarded cards, and a remaining card. With n = 1 there is no sequence of discarded cards, therefore there can be no remaining card, and also, you should work this problem with "at least two cards".
It's only my opinion.

Keep posting!

According to MathWorld, a sequence is an ordered set, and a set can be empty, so a sequence can be empty. So, IMO, n=1 is perfectly valid, leading to an empty sequence and a remaining card.

Can anyone help me? I get PE. I've tried handling the output if the input is n = 1.

Here's my code:
Thanks.

To Steven Luck

u done a simple mistake..the problem says that to print new line after every test case that is u not done..u print new line after every test case but except the last case...
correct it & i think then it will ok.....

btw:remove ur code after correction...

GOOD LUCK
Rocky

I thought I've tried that one - printing a new line after each problem - but it didn't work. But then, after seeing your post, I try printing a new line again, and it worked!

Thanks, Rocky.

i am getting PE but the output seems to be in order..... please help!!

For n=1 the output should be
Hope it helps.

Thanks a lot.... got AC!

_.B._ wrote:Greetings!

The following operation is performed as long as there are at least two cards in the deck:
Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck.

Your task is to find the sequence of discarded cards and the last, remaining card.

I believe input n = 1 is contradictory to the statement of the problem.
They ask you to find a sequence of discarded cards, and a remaining card. With n = 1 there is no sequence of discarded cards, therefore there can be no remaining card, and also, you should work this problem with "at least two cards".
It's only my opinion.

Keep posting!

I agree with U absolutely!

Jan wrote:There is no negative values for n. But n can be 1.

You can try the following input output set.

Input:

Code: Select all

1
10
11
17
0

Output:

Code: Select all

Discarded cards:
Remaining card: 1
Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8
Remaining card: 4
Discarded cards: 1, 3, 5, 7, 9, 11, 4, 8, 2, 10
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 4, 8, 12, 16, 6, 14, 10
Remaining card: 2

Hope it helps.

thanks jan vai

This is the output for n = 50. If you got W.A. on this problem, you can test this.