OJ Board

solon_aguiar

This input helped me figure out the solution.

1 1 1 10 10
2 1 1 10 10
5 3 18 10 46
100 50 50 69 69
0 2 3 4 5

Expected output:

Case 1:
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaaaaaaaaa
Case 2:
abbabbabba
b..b..b..b
b..b..b..b ...

solon_aguiar

Got it accepted. The following case was helpful in debugging:

Code: Select all

1
IF
ELSE
END_IF
S
S
S
IF
ELSE
IF
ELSE
END_IF
IF
ELSE
END_IF
S
S
S
S
S
IF
ELSE
END_IF
END_IF
ENDPROGRAM

Output is

Code: Select all

solon_aguiar

Does anybody have other valuable inputs? My code passes all the inputs in this topic, but still getting WA.

solon_aguiar

Thanks!
It was a silly mistake.
Got Accepted.

solon_aguiar

I keep getting WA.
Tryed all inputs.
Can you guys help me?

Code: Select all

Removed after AC

solon_aguiar

Hello guys,

I've searched on all inputs and outputs available here. My code seems to work on all of them, but I still get RE. Can you guys help me?
I'm using 0/1 knapsack.
Thank you very much

#include <cstdio>
#include <algorithm>
#define MAX 20000

using namespace std;

long long tracks[MAX ...

solon_aguiar

Hello guys. I've read all posts and done exclaty what I think you said, but I still can't figure out what's wrong with my code. I'd be glad you someone could help me (variable names are in Porguese, but I still think you guys can figure out what I'm doing. Sorry for that).

import java.io ...

OJ Board

Search found 7 matches

Re: 12155 - ASCII Diamondi

Re: 10854 - Number of Paths

Re: 10854 - Number of Paths

Re: 11805 - Bafana Bafana

Re: 11805 - Bafana Bafana

Re: 624 - CD

Re: 10991 - Region