OJ Board

Hi, please could someone give me a hint?? I haven't realized which is the pattern

Thanks in advance

I don't think there is any known formula for this sequence. You have to either do brute force or cheat and look on Mathworld or the EIS. :-)

Could anyone please tell me what the input format is? Is there just one number? Are there many numbers? What are these numbers separated by?

Also, could anyone say what the answer to the input 10 is? I think it should be 9189, but I'm getting WA.

Thanks.

I don't know what the input format is exactly, but scanf("%d",&n) until EOF works. There are >1 numbers. 9189 is the correct answer for input 10. Maybe your solution misses some corner cases, like 0? (I haven't checked if such input exists, though.)

Thank you. I got it accepted after guessing that the answer for the case 0 is 0, not 1.

Do you know what the input size is??

There are no inputs larger than 25.

All inputs are at most 15.

How to think about the problem?
Does it have any formula about the problem?
Please give me some hint....
Thanks in advance!

I think it a math problem.
And if you want to solve it, you might use DP
Or there are some strange solutions can solve it, like 10918.
I also haven't found out how to solve it.

Wei-Ming Chen wrote:I think it a math problem.
And if you want to solve it, you might use DP
Or there are some strange solutions can solve it, like 10918.
I also haven't found out how to solve it.

I solve 10918 to see the page as follow.
http://www.algorithmist.com/index.php/UVa_10918
You can read the page and find the formula.

I used brute force and got AC.

See this site:

http://mathworld.wolfram.com/Polyomino.html

Is there an efficient way to brute force this?