原题链接:蓝桥杯基础练习VIP-矩阵乘法
解题思路:
不知为何总是报输出超限43,思路应该是没问题的,有小伙伴晓得为啥的评论下让我看到谢谢。
参考代码:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 | n,m = map ( int , input ().split()) nums = [ list ( map ( int , input ().split())) for _ in range (n)] res = [[ 0 ] * n for _ in range (n)] k = 0 i,j = 0 , 0 for t in range ( 1 ,m): for i in range (n): for k in range ( 0 ,n): r = 0 for j in range (n): r + = nums[i][j] * nums[j][k] res[i][k] = r for i in range (n): for j in range (n): nums[i][j] = res[i][j] if m = = 0 : for i in range (n): for j in range (n): if i = = j: print ( "1" ,end = " " ) else : print ( "0" ,end = " " ) if i! = (n - 1 ): print () else : for i in range (n): for j in range (n): print (nums[i][j],end = " " ) if i! = (n - 1 ): print () |
0 分
0 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复