OJ Board

Still your code generates incorrect output for the sample input.

Why did you ignore the spaces in the first column?

All you have to ignore are the spaces redundant at the end of the line.

This line may help you: Keep working:)

You should print '\n' after each line.

Also I'm not sure if a buffer with a size of 1000 would be enough..

Hi, try this case(replace the asterisks with blank spaces): *ABC**DEF***GHIJK**** My AC solution gives me: *CBA**FED***KJIHG**** Where your code gives: CBA*FED*KJIHG* Also, you need a bigger buffer for the problem description didn't mention how long the input will be. An array with size of 90000 wou...

Hi, your solution don't even pass the sample test cases. In the sample output we have: "R Ie *n te h* iD ne kc ,a *r tt he es r eo fn oc re e *s Ia *i ad m, . " where I replaced the blanks with asterisks. But your code gives: "R Ie *n te h* iD ne kc ,a *r tt he es r* eo fn oc re e* *s...

I changed and changed my algorithm for several times, but none of them succeeded to solve the problem

Can I have some hints?

This is driving me crazy!!

It may fail in some cases. For example, if you have the following graph: 3 nodes and these directed edges: <1, 2> <2, 1> and <3, 2> If you start the DFS at node 1 you will visit nodes 1 and 2. Then you will also knockdown tile 3, with total score 2 (Tiles 1 and 3). But the best solution is to just ...

Hi, I have been given constant WAs for the problem. First of all, I consider the dominos a directed graph. And I tried to approach the problem by DFS-ing through the nodes with no in-edge, and then DFS the nodes that are not visited , and then print the numbers of dominos knocked down by hand. I pas...

I've used 1e-15 as my epislon, but the online judge system keeps give me constant WA. Can somebody check my code? I choose Bisection as my algo. #include<iostream> #include<cmath> #define e ( 1e-15 ) using namespace std; double L,n,C,S,S2,theta,r; inline double ABS( double x ) { return( x>0 ? x : -x...

I used STL to implement the stack. And for some reasons, my code is getting WA again and again; I wonder why...

Here's my code:
Wow, thanks for Jan's help.

But why can't I use the stack<char> one?

I tried to solve the problem with DFS and some branch and bound, but it keeps give me WA. Could somebody help me? #include<iostream> #include<math.h> #define N 10 #define INF 214748647 #define Dist(i,j) sqrt( (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]) ) using namespace std; int n,x[N],y[N]; int...

I got AC for problem 478, I'm using the same algo but it keeps WA, here's my code, it can't even pass the sample input, but it seems correct logically, can anyone help me??
Any comment is appreciated.

I've tried a lot of inputs without no incorrect outputs. Can somebody give me some critical inputs or correct my code? I appreciate that. Code removed after AC. Missed the lines: L = the lower boundary value in the sequence H = the upper boundary value in the sequence Thanks for Rio's help!! :oops:

I sumitted my code by it gave me CE with error:

g++: Internal compiler error: program as got fatal signal 25

Huh? Signal 25?

Can somebody please help me?

Any help is appreciated^^

Thanks a LOT!!
I found my Prime() function cannot deal with the number 1, so I used another recursive GCD().

I got AC eventually, THANKS!!

Here's my code......
It gave me the correct outputs for the inputs in the fourm, but still WA......
Can somebody help me please?
I appreciate that.
Thank you Jan!!