It seems that 黄志斌大师 hasn't solved it yet. Here are some hints, cheers t(O(2,1))=76 t(O(2,2))=5383 t(O(3,2))=456572 t(O(4,2))=??? t(O(5,2))=5691685328 t(O(6,2))=775853912569 t(O(7,2))=115551467563824
乐趣在于解的过程,不一定要成功??? Yes! Anyone can pick up a very difficult problem and say "the fun is in the process" and try to solve it until he find it's beyond his ability. How can you expect you can jump when you still can't walk? Come on! Guys! You should learn how to walk before you jump. Start with easier problems and learn some skills for harder problems. In my opinion, if you insist on doing hardest problems and say: "the fun is in the process". You are wasting your time.(Maybe you have lots of time to waste?)
There are two ways to solve it: (1).Dijkstra shortest path algorithm(rng_58 called it Modified dijkstra) (2). BFS Both can solve it, But I prefer BFS, BFS is a little faster than Dijkstra and easy to implement(in my opinion)
I think this problem is too difficult for you, also too difficult for 黄志斌, But if you want, you can find the answer easily in the internet. As everybody knows, there are already answers somewhere in the internet. Anyone can copy the answers to be a matser(大师) without being any good. Why don't you start with easier problems?
F(18!)=B6C074F459BE F(19!)=BABA68556078 F(20!)=??? F(21!)=478C38D4C058 F(22!)=DE7FA1331203