{ "type": "code_options", "author": "csdn.net", "source": "solution.md", "exercise_id": "83ff4228dbc34fa3b8d9ebad0abda73b", "keywords": "算法初阶,基础知识,分治策略,证明主定理,对b的幂证明主定理", "title": "矩阵问题", "desc": [ { "content": "\n题目描述\n编写以下函数:\n(1)在一个二维数组中形成以下形式的n阶矩阵:\n[1 1 1 1 1\n2 1 1 1 1\n3 2 1 1 1\n4 3 2 1 1\n5 4 3 2 1]\n(2)去掉靠边的元素,生成新的n-2阶矩阵;\n(3)求生成的n阶矩阵主对角线上的元素之和;\n(4)以方阵形式输出数组。\n在main函数中调用以上函数进行测试。\n输入\n输入生成矩阵的阶数(n>=2)\n输出\n以方阵形式输出生成的n阶矩阵、去掉靠边的元素生成的新的n-2阶矩阵、以及生成的n阶矩阵主对角线上的元素之和,最后一行要回车\n样例输入\n5\n样例输出\nGenerated matrix:\n1 1 1 1 1\n2 1 1 1 1\n3 2 1 1 1\n4 3 2 1 1\n5 4 3 2 1\ndel the elements on the side:\n1 1 1\n2 1 1\n3 2 1\nThe sum of the diagonal:5", "language": "markdown" } ], "answer": [ { "content": "", "language": "cpp" } ], "prepared": [ [ { "content": "", "language": "cpp" } ], [ { "content": "", "language": "cpp" } ], [ { "content": "", "language": "cpp" } ] ], "template": { "content": "#include \nusing namespace std; \nint main() {\n\twhile(1){\n\t\tint a;\n\t\tcin>>a;\n\t\tint array[a][a];\n\t\tfor (int i=0;i= 1 ; i-- , j++)\n\t\t{\t\n\t\t\tsum+=array[i][j];\n\t\t}\n\t\tcout<<\"The sum of the diagonal:\"<