OJ Board

Can anyone tell me whats the problem with the following code? Why it gets WA?? [cpp][c] /* 10493 : Cats, with or without Hats */ /* Discrete Math :Rosen - page 536 */ #include<stdio.h> #include<math.h> void main() { long ary,leaf; double total,fraction,integer; while(scanf("%ld%ld",&ar...

I am getting WA in this problem.
I found a formula in a discrete math book for this
and i used that one. I handled the case 1 1 specially as "multiple" and
"Impossible" if total number of node is fraction.
Can anyone help me with some special input/output?

Can anyone help me with some critical input output?
I donno why i am getting WA.

What does "leading zeros must be considered as significant. " mean?

Bye

Here goes a hint - Square root the number , it has some special property, think of it.
bye

Somebody told me that 15 puzzle is a very good program to learn IDA* Search.I read about IDA* Search in a book but found no way to code it. Can somebody plz send me a solution of 15 puzzle using IDA* Search in C or C++? My email address is <laboni_inobal@yahoo.com> I would be very very grateful if a...

Suman,

Thank u very much for the code.
I hope this would work for me.
Thanks again.

Bye

Laboni

If anyone have problem sending bellman ford in this board but wants to send me personally - requested to mail me <laboni_inobal@yahoo.com>

bye
Laboni

hi! I read the Bellman-ford algorithm but just can't code it. I need the code very very much. I know it is not good to ask for source codes here, and in fact i should not ask for it , but i have little time in hand i need a source code for BELLMAN-FORD algorithm to find the shortest path in a graph ...

Hi!

Can anyone provide me some critical input/output for this problem.
I tested with different types of inputs and found my program working.
But OJ says WA. May be your iput will help me to fix the error.
Thanks for reading my post.

Bye

this problem is a nightmare! P is Such a big number!!
There must be some easy algorithm in number theory to solve such problem.Can anyone help me plz?

I read everything with gets & got AC now.
still thanks for your advice.

Hey! My program solves the problem correctly but it does not take more than one input.It takes only the first set of input, gives correct result, but then exist. Can u plz find out why? here is the code in C: [c] //greedy gift giver:119 #include<stdio.h> #include<string.h> char name[100][200]; long ...