OJ Board

Hi...

Can anybody give me few test cases ? I need to check the outputs with mine.

Thankx in advance..

It was my mistake:when the maximum no of box is 1... I printed 0 wronlgly...
Did u check this input....

U forget to print '\n'....u print 'n'
another matter, i used dfs taking each node as starting node....I can't remember why i used so...if u get WA, u may modify it.....

Pls check the output for input=6, output should be 1.563.
I also got WA before handling specially this input.

chang

Hi Pochmann !
Would u pls give some hints how to handle the 2nd part,i.e. how to prevent the loops by bool-array. As a beginner, I couldn't find out any other way except linear-checking that would be judged as TimeLimitExceeded.
Thanks in advance.

U should use 'long long' data type. It gives u 8 byte. And change the line :
tmp %= 100
with
tmp %= 100000 ( or, tmp%=1000000)

I suggest u to change a single line as follows:
while ( gets(B) && strlen(B) > 0 )
instead of
while ( gets(B) != NULL )

Hope u'll get it AC...

Ivan, I'm facing some problem! I tried as follows: I generated first 22000 prime numbers & then used the formula:fib(n)=pow((1+sqrt(5))/2,n)/sqrt(5). But the 22000'th prime is about 250000. So fib(n) is so big... Then how I can get the first 9 digits ! Pls tell how it's possible. By the by,I couldn'...

Ivan , Thanks for ur reply. But still I've few problems: first, I know Fib(n)=(pow(a,n)-pow(b,n))/sqrt(5).Here a,b are 2 constants. But it's an approximate value. Then how it could be correct? second, I got it from rank list that Fib(n) and Fib(m) are relative prime if & only if n and m are relative...

Hi !
I'm so interested in this problem. But I don't understand how it can be solved efficiently. Pls inform me about it.
Thanks in advance.

Hi !
Can any body inform how this problem could be solved ! What's the main idea behind it? I tried a lot, but failed tired to find a solution.
Thanks in advance.

chang

Hi !
I've no idea about 'Warnsdorff rule' && 'euclidean distance'. Can any body help me writing the idea here or better give any web-reference to know about it.
Thanks in advance for ur kind response.

Hey Adrin/10153EN ,

Would u pls clarify the bug in details. I can't understand ur topic. So pls give that special input that u mentioned & the outputs that ur code gives.
Thanks in advance for ur help.

Chang

Hey ..

Would u pls tell how u derive that formula by induction procedure? I'm really so curious to know it. I've the idea of induction, but I can't find out the way of thinking.
Thanks in advance.

Hey Even!

Thanks for ur reply.
Oh! my recurrence was wrong. But I can't detect how the recurrence can be built. Would u please inform how built up ur recurrence,Or is there any direct formula to solve this one?
Thanks in advance.