OJ Board

Mushfiqur Rahman

Tahnks to Saman_saadi for your erly reply.

saman_saadi wrote:

The problem statement said that a horse can move atmost 1 movement so you shouldn't mark the squares that horse can reach with 'Z' if you do it then horse can move more than 1 movement so you must mark reachable squares by horse with ...

Mushfiqur Rahman

Try with this Input

Code: Select all

3
997!!!!!!!!!!!!!!!!!!!!
997!!!!!!!!!!!!!!!!!!!
997!!!!!!!!!!!!!!!!!!

Your program gives:

Code: Select all

Case 1: 140896402145280
Case 2: 15533828336517120
Case 3: 12524124635136000

But the actual Output will be:

Code: Select all

Case 1: 288555831593533440
Case 2: 994165013537095680
Case 3: Infinity

Mushfiqur Rahman

Can anyone help?.!
I'm getting WA

Heres my code.

Code: Select all

Removed after Accepted

Mushfiqur Rahman

I got it Acc
just change the eps. It was 1e-6 ( which got WA )
but my Accepted codes eps is 1e-11
eps 1e-10 also got WA

Mushfiqur Rahman

Any body help please.
I am getting wa
heres my code.

Code: Select all

removed after Accepted
to get accepted change your eps by 1e-11

/* this passed all the test cases given this thread*/

Mushfiqur Rahman

Masud Wrote

I assume that no leading or trailing space and no more than 2 space between 2 characters

I also assumed like u and got ac.
I think u should recode this problem or should change the approach.
Sometimes it works better.

Mushfiqur Rahman

Thanks for your reply.

Obviously that was the problem.

I caught it after just sending my previous post.

Mushfiqur Rahman

Goodwill wrote:

I believe that you have used the wrong angle.

thanks for your reply. But I thought a lot about my logic but yet not found any wrong. Can u give me some sample i/o so that i can justify my logic.

Mushfiqur Rahman

I got several times WA. Can anybody help?
I think my logic is correct.
My code passed the sample input and the inputs input which is given in the board.

Code: Select all

 Removed

Mushfiqur Rahman

Can anybody give some special ( tricky ) input for this problem?

Mushfiqur Rahman

A little speech about the problem:

I got at least 6 times WA for the given code ( in the previous post). I posted here bcz I didn't found any bug in my code. I hoped that I will get helped from the great helpers about my problem. But I failed to get help from others.

I think somebody ( cordial ...

Mushfiqur Rahman

Can there be any node in the input set whose value is more than 2^31-1. If not, then whats the problem with this code. I checked it but didn't found any mistake.

Removed after AC.

Important for others:

No, theres no node which value is more than 2^31-1, but there can be more than 30 nodes

I ...

Mushfiqur Rahman

Dear, andmej
I saw your approach but didn't found anyting wrong. Sometimes we face this problem, theres no error in the code and algorithm but judge giving WA.
In this circumstances we should re code the problem without opening the existing code.
If it fail then should leave it for few days. After ...

Mushfiqur Rahman

h_davary wrote
before i sent this code to online judge i had test it with dev4.9.9.2 and visual studio C++ 6.0 and worked well
but i dont know why it says it has "runtime error!" :

Emilio wrote
Why is your array size 100? It could be the reason

Yes this is the reason of getting u run time ...

Mushfiqur Rahman

Try with this cases
Input:

3
1 4
2 6
2 7
3
6 6
6 12
4 12
3
13 39
26 52
52 26
2
10 20
12 12
3
100 170
140 122
122 140
3
120 170
40 8
71 500
3
20 10
8 40
12 12
3
122 140
199 900
1 900
5
11111111 22222222
10000000 30000000
1 2
99999999 12345678
1048576 1048576
3
1 4
2 6
2 7
1
4 4
2
4 4
1 2
10
10 20 ...

OJ Board

Search found 56 matches

11352 - Crazy King