博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
c语言:矩阵相乘-矩阵相加 新手练习1
阅读量:4593 次
发布时间:2019-06-09

本文共 1076 字,大约阅读时间需要 3 分钟。

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<string.h>
void main()
{
    
int a[4][4];
    
int b[4][4];
    
int c[4][4];
    
int i,j,k,s,t,m,n;
    
srand(time(0));
    
for(i=0;i<=3;i++)
        
for(j=0;j<=3;j++)
            
a[i][j]=rand()%20+1;
                
printf("a is \n");
                
for(i=0;i<=3;i++)
                
{
                 
                    
for(j=0;j<=3;j++)
                         
                         
                            
printf("%5d",a[i][j]);
                                
printf("\n");
                                    
printf("\n");
            
}
                         
                            
for(i=0;i<=3;i++)
                            
for(j=0;j<=3;j++)
                                
b[i][j]=rand()%20+1;
                                
printf("b is \n");
                                            
for(i=0;i<=3;i++)
                                            
{
                                             
                                            
for(j=0;j<=3;j++)
                                             
                                                 
                                                
printf("%5d",b[i][j]);
                                                    
printf("\n");
                                                        
printf("\n");
                                            
}
                                                
for(i=0;i<=3;i++)
                                                    
for(j=0;j<=3;j++)
                                                        
c[i][j]=a[i][j]+b[i][j];
                                                            
printf("c is \n");
                                                             
                                                                
for(i=0;i<=3;i++)
                                            
{
                                             
                                            
for(j=0;j<=3;j++)
                                             
                                                 
                                                
printf("%5d",c[i][j]);
                                                    
printf("\n");
                                                        
printf("\n");
                                            
}
                                            
int z;
                                            
z=0;
                                    
printf("a is \n");
                                        
for(i=0;i<=3;i++)
                
{
                 
                    
for(j=0;j<=3;j++)
                         
                         
                            
printf("%5d",a[i][j]);
                                
printf("\n");
                                    
printf("\n");
            
}
 
                            
int my=0;
                            
int sb=0;
                            
k=0;
                            
int jsq=0;
                                                            
printf("my is : \n");
                                    
for(k=0;k<=3;k++)
                                    
{
                                        
for(i=0;i<=3;i++)
                                    
{
                                     
                                    
for(j=0;j<=3;j++)
                                    
{
                                 
                                    
sb=a[k][j]*b[j][i];
                                    
my=my+sb;
                                     
                                    
}
                                    
c[k][i]=my;
         
                                    
printf("%5d",c[k][i]);
                                    
jsq++;
                                    
if(jsq%4==0)
                                    
printf("\n");
                                    
my=0;
                                
}
                            
}
                                    
                
                             
}

转载于:https://www.cnblogs.com/jx3ajmd/articles/9610385.html

你可能感兴趣的文章
深入理解DIP、IoC、DI以及IoC容器
查看>>
赋值文件
查看>>
Vue 数组 字典 template v-for 的使用
查看>>
蓝牙模块选择经验谈
查看>>
java中==和equals
查看>>
CCActionPageTurn3D
查看>>
python random
查看>>
esp32-智能语音-cli(调试交互命令)
查看>>
netty与MQ使用心得
查看>>
关于dl dt dd 文字过长换行在移动端显示对齐的探讨总结
查看>>
swoolefy PHP的异步、并行、高性能网络通信引擎内置了Http/WebSocket服务器端/客户端...
查看>>
Python学习笔记
查看>>
unshift()与shift()
查看>>
使用 NPOI 、aspose实现execl模板公式计算
查看>>
行为型模式:中介者模式
查看>>
How to Notify Command to evaluate in mvvmlight
查看>>
33. Search in Rotated Sorted Array
查看>>
461. Hamming Distance
查看>>
Python垃圾回收机制详解
查看>>
{面试题1: 赋值运算符函数}
查看>>