hushhw的博客

请写出一个程序，接受一个以N/D（0一些转化的例子：1/3=.(3) 22/5=4.4 1/7=.(142857) 3/8=.375 11/59= .(1864406779661016949152542372881355932203389830508474576271)  45/47=.(9574468085106382978723404255319148936

题目内容： 一个从里向外逆时针转出来的螺旋n*n的矩阵 输输入描述矩阵的规模，0~50，如5表示5行5列的矩阵输出描述矩阵的规模，0~50，如5表示5行5列的矩阵，每个数占5位输入样例5输出样例25    24   23   22    2110     9    8    7    2011     2    1    6  

Crashing BalloonTime Limit: 2 Seconds      Memory Limit: 65536 KB On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The rule is very simple.  On

Fibonacci NumbersTime Limit: 2 Seconds      Memory Limit: 65536 KBA Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1

Matrix Chain MultiplicationTime Limit: 2 Seconds      Memory Limit: 65536 KBMatrix multiplication problem is a typical example of dynamical programming.Suppose you have to evaluate an expr