矩阵的乘法操作

矩阵相乘：

#include
   
   
    
    
#include
    
    
     
     
int main()
{
	printf("please input one number\n");
	int n;
	scanf("%d",&n);
	int *p,*s;
	p = (int *)malloc(sizeof(int)*n*n);
	s = (int *)malloc(sizeof(int)*n*n);
	//input data
	for(int i=0;i
     
     
    
    
   
   

矩阵的幂：

#include
    
    
     
     
#include
     
     
      
      
int main()
{
	printf("please input one number present the number of count\n");
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,k;
		scanf("%d%d",&n,&k);
		int *p,*s;
		p = (int *)malloc(sizeof(int)*n*n);
		s = (int *)malloc(sizeof(int)*n*n);
		//input data
		for(int i=0;i
      
      
       
       2)
		{
			sum = 0;
			int *tt;
			tt = (int *)malloc(sizeof(int)*n*n);
			k = k-2 ;
			while(k--){
				for(int i=0;i