OJ Board

Some problem makes a lots of fun with me, like this one...

Yah thats true i got accepted by this way
but can anyone let me know how it works.
Thanks in advance...
- Tanu

I got it in O^3 Floid Warshall.
in 0.059 sec...

all programmer have to spend some time with big integer...
it is the earlier step of them...
actually the problem is not upto 500!
the limit is 1000!
consider the number as string back to the child age and
use the way we learn to multyply....
use array for storing answers...
hope it helps...

you dont have to initiate all array through...
make it declare as global...
Taht will make just u want all zero...
there may be enough reason for wrong anwer...
to avoid wa i take input as string...
removed the . (decimal point) to get integer....
the range goes to long long...
it is safe to avoid ...

I found 3-4 wrong answer for this problem...
I used this algo...
k is initialized as 1...
find the k th root m of 1st number...
decrement to get z = m-1...
p = pow(z , k)
if (fabs(p-second number))
calculate results using k ...

I used
c = getchar() for this problem

what is the wrong with my code...
I save the indexes and checked for n, is the position if n+1 and n+2 is greater than position of n...
is there anything wrong understanding with my code...
plz help...

#include<stdio.h>
#include<string.h>
long in[10005],pos[10005];
main()
{
char s[15];
long len ...

check your id information...
If your automatic mail is on then there have an mail attaching code
& another with result...
In case of Compiler error the line number of error will be mentioned
Check this

select any fuction name and press ctrl+F1 if the function is unix supported then it will also be ...

I know the N^2 algorithm...
I'm trying to do it in nlog(n) time...
I learn it from my friend but my code is so useful to make it implemented...
help anyone to solve this problem in better...
Is there any post about it...
Referrence is needed...
Thanx dear IRA...
...Tanu

I'm trying to solve it in nlog(n) time ...
here is my code...
Plz help...


#include<stdio.h>
#include<string.h>
#define inf 4294967295
#define MAX 1000000
unsigned long res[MAX],in[MAX];
long top;
long binarySearch(unsigned long key )
{
long low = 0;
long high = top- 1; //zero based array
long ...

I have no scope here to compile my code in this time...
I think for input 1 output must be 1...
This is my algo ...
Compare Yourself...
1. 1st find all the divisor of the given input.Save in array and sort.
{

the way may recursive
or->
a loop i:from 2 to sqrt(N)
if(N%i == 0)
then add both i and N ...

Check private massage

Think about the prime input...

439 was my first try in bfs....
Many solvers solved it in 0.016 sec but it is possible to make the time faster...
Think it easily as a simmetric matrix....
if u can go from board[a] to board[c][d] in x step then possibilities:
1. board[c][d] to board[a] will take the same step.
2. I think board[n ...