OJ Board

I am getting number of PEs. I have tried to skip the line full of spaces, removing the leading spaces, removing the trailing space, etc.

What's the trick? Any example? Thanks.

I think I am using the Greedy approach as described above. However, I got WAs.

Any tricky input or traps I am missing? Thanks.

I am keeping WA for more than 10 times. I have checked the conditions 2-7 to be right. The only condition 1 puzzled me. What's the logic I should detect if the first string is empty? Also, any critical inputs? Below please find my codes. #include <stdio.h> #include <stdlib.h> #include <string.h> #in...

I am puzzled for many WA. Would someone kindly please check with my I/O? Input: 25 2#10##111111111# 2#10##10##10##111111111# 2#101##20##16##12345abcdf# 2#101##20##11##12345a# 2#101##20##11##12345ab# 2#101##20##17##12345ab# 2#101##20##0##12345ab# 2#101##20##2##101# 2#101##20###2##101# 16#f##e##d##c##...

After someone taught me, I've the following For n-bit, you can fix 1st bit, 2nd bit, ..., n-th bit. After each bit fixed, you can have G(n-1) ways to generate the upper half, and G(n-1) ways to generate the lower half. I have no idea on the meaning of "upper half" and "lower half&quo...

Hi all,

I am trying this problem. The way I do it is similar to the mentioned one. Also, the program has produced the same outputs for sample cases and some special cases of testing out of the land.

Would anyone kindly tell more special logics or checkings I missed out?

Thanks a lot.

Hi, I am getting WA though passing the test cases posted here. The way I do the question is similar. Would anyone give me a hand to tell if there's anything wrong? Thanks a lot in advance. #include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> int main(int argc, char **argv) { ...