// 稀疏矩陣.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <stdlib.h>
#include <stdio.h>
#include<malloc.h>
#include<iostream.h>
#define OVERFLOW -1
#define ERROR 0
#define OK 1
#define MAXSIZE 10000
#define MAXRC 100
typedef int ElemType;

typedef struct
{	
    int i;
	int j;
	ElemType e;
}Triple;

typedef struct
{
	Triple data[MAXSIZE+1];
	int rpos[MAXRC+1];
	int mu;
	int nu;
	int tu;
}RLSMatrix;

void PrintSMatrix(RLSMatrix);



void CreateSMatrix(RLSMatrix &M,int m,int n)
{

	
	cout<<"輸入矩陣的值"<<endl;
	 M.tu=0;
	int k=1;
    int p=1;
	int num[100];
	int i,j;
	ElemType e;
	M.mu=m;
	M.nu=n;
    
	for(int z=1;z<=100;z++)num[z]=0;
	for(cin>>i>>j>>e;i!=0;cin>>i>>j>>e)
	{M.data[k].j=j;
	M.data[k].i=i;
	M.data[k].e=e;
	k++;
		}//for
	M.tu=k-1;
    M.rpos[1]=1;
	for(int a=1;a<=M.tu;++a)++num[M.data[a].i];
	
	for(int b=2;b<=M.mu;++b)M.rpos[b]=M.rpos[b-1]+num[b-1];



}//CreateSMatrix


bool MultSMatrix(RLSMatrix M,RLSMatrix N,RLSMatrix &Q)
{

	int ctemp[100];

	int tp,t,ccol,brow,p,q,arow,lie;

	if(M.nu!=N.mu)return ERROR;

	Q.mu=M.mu;

	Q.nu=N.nu;

	Q.tu=0;

	if(M.tu*N.tu!=0)
	{
	for(arow=1;arow<=M.mu;++arow)
	{
       int w=arow;
            
		for(lie=1;lie<=N.nu;++lie)
			
			ctemp[lie]=0;
	
		  Q.rpos[arow]=Q.tu+1;
	
		 
			  if(arow<M.mu)tp=M.rpos[arow+1];

		  
		  else {tp=M.tu+1;}

		  
        

		  for(p=M.rpos[arow];p<tp;++p)
		  {
		      
			  
			  brow=M.data[p].j;
		
	  
		   if(brow<N.mu)t=N.rpos[brow+1];
	
		      else {
				  t=N.tu+1;
			  }//else

	    for(q=N.rpos[brow];q<t;++q)
		{
		  ccol=N.data[q].j;
	     
		  ctemp[ccol]+=M.data[p].e*N.data[q].e;
	
		}//for q;

			
	
		  }//for p;求得Q中第crow（＝arow）行的非零元

			  
		  
	//壓縮存儲(chǔ)
	for(ccol=1;ccol<=Q.nu;++ccol)

		if(ctemp[ccol])
		{
			Q.tu++;

			if(Q.tu>MAXSIZE)return ERROR;
		      
			   Q.data[Q.tu].i=arow;
		         
			     Q.data[Q.tu].j=ccol;

		           Q.data[Q.tu].e=ctemp[ccol];
		
		}//if

	
	
	}//for arow
	
	}//if

return OK;
}//MultSMatrix


void Rmove(RLSMatrix &M,int p)

{for(int a=M.tu+1;a>=p;a--)

{M.data[a].e=M.data[a-1].e;

M.data[a].i=M.data[a-1].i;

M.data[a].j=M.data[a-1].j;}

}


void Lmove(RLSMatrix &M,int p)

{for(int a=p;a<M.tu;a++)

{M.data[a].e=M.data[a+1].e;

M.data[a].i=M.data[a+1].i;

M.data[a].j=M.data[a+1].j;
}
}



bool PlusSMatrix(RLSMatrix &M,RLSMatrix N)
{


	int tp,t,p,q,arow,e;

	if(M.mu!=N.mu&&M.nu!=N.nu)return ERROR;

	
	if(M.tu*N.tu!=0)
	{
	for(arow=1;arow<=M.mu;++arow)
	
	{
       	
		  if(arow<M.mu)
			  
		  {
		   tp=M.rpos[arow+1];
		  
		   t=N.rpos[arow+1];
		  
		  }

		  else 
		  {tp=M.tu+1;
		   
		  t=N.tu+1;
		  }

		  for(p=M.rpos[arow],q=M.rpos[arow];p<tp||q<t;)

		  {
			  if(p==tp)

				  {Rmove(M,p);

		  M.data[p].e=N.data[q].e;

		  M.data[p].i=N.data[q].i;

		  M.data[p].j=N.data[q].j;

		  M.tu++;q++;

		  }

			  if(q==t)p++;
			  
			  int a=M.data[p].j;

		  int b=N.data[q].j;

		  if(a<b)p++;

		  else if(a>b)

		  {Rmove(M,p);

		  M.data[p].e=N.data[q].e;

		  M.data[p].i=N.data[q].i;

		  M.data[p].j=N.data[q].j;

		  M.tu++;

		  }

		  else 
		  
		  {e=M.data[p].e+N.data[q].e;
		  
		  if(e==0)
		  
		  { Lmove(M,p);q++;M.tu--;continue;}

		 
		  else M.data[p].e=e;

		  p++;
		  
		  q++;}//else 

		  		 		  
		  }//for q,p

		 

		  }//for arow
	}//if
			
return OK;
}	


bool SubSMatrix(RLSMatrix &M,RLSMatrix N)
{


	int tp,t,p,q,arow,e;

	if(M.mu!=N.mu&&M.nu!=N.nu)return ERROR;

	
	if(M.tu*N.tu!=0)
	{
	for(arow=1;arow<=M.mu;++arow)
	
	{
       	
		  if(arow<M.mu)
			  
		  {
		   tp=M.rpos[arow+1];
		  
		   t=N.rpos[arow+1];
		  
		  }

		  else 
		  {tp=M.tu+1;
		   
		  t=N.tu+1;
		  }

		  for(p=M.rpos[arow],q=N.rpos[arow];p<tp||q<t;)

		  {
              

			  if(p==tp)

				  {Rmove(M,p);

		  M.data[p].e=0-N.data[q].e;

		  M.data[p].i=N.data[q].i;

		  M.data[p].j=N.data[q].j;

		  M.tu++;q++;continue;

		  }

			  if(q==t){p++;continue;}
			  
			  int a=M.data[p].j;

		  int b=N.data[q].j;

		  if(a<b)p++;

		  else if(a>b)

		  {Rmove(M,p);

		  M.data[p].e=0-N.data[q].e;

		  M.data[p].i=N.data[q].i;

		  M.data[p].j=N.data[q].j;

		  M.tu++;

		  }

		  else 
		  
		  {e=M.data[p].e-N.data[q].e;
		  
		  if(e==0)
		  
		  { Lmove(M,p);q++;M.tu--;continue;}

		 
		  else M.data[p].e=e;

		  p++;
		  
		  q++;}//else 

		  		 		  
		  }//for q,p

		 

		  }//for arow
	}//if
			
return OK;
}	
		  





ElemType Search(RLSMatrix M,int i,int j)
{
	
	for(int k=1;k<=M.tu;k++)
		if(M.data[k].i==i&&M.data[k].j==j)
			return M.data[k].e;
		return 0;
}



void PrintSMatrix(RLSMatrix M)
{   

	
	ElemType Search(RLSMatrix ,int ,int);
	for(int i=1;i<=M.mu;i++)
	{for(int j=1;j<=M.nu;j++)
		{ElemType e=Search(M,i,j);
   printf("%d ",e);}
	cout<<endl;}

}



	


void main(int argc, char* argv[])
{
	RLSMatrix M,N,Q;
	int m,n;
    char  d='y';
	cout<<"歡迎用本程序進(jìn)行矩陣運(yùn)算!"<<endl;
	
    while(1)
	{cout<<"按q以退出,按其他任意鍵繼續(xù)"<<endl;
	cin>>d;
		if(d=='Q'||d=='q')break;
	cout<<"請(qǐng)輸入第一個(gè)矩陣，先輸入行數(shù)m再輸入列數(shù)n"<<endl;
	cout<<"m=";
	cin>>m;
	cout<<"n=";
	cin>>n;
	CreateSMatrix(M,m,n);
    cout<<"第一個(gè)矩陣為："<<endl;
	PrintSMatrix(M);
	cout<<"請(qǐng)輸入第二個(gè)矩陣，先輸入行數(shù)m再輸入列數(shù)n"<<endl;
	cout<<"m=";
	cin>>m;
	cout<<"n=";
	cin>>n;
	CreateSMatrix(N,m,n);
	cout<<"第二個(gè)矩陣為："<<endl;
	PrintSMatrix(N);
    cout<<"請(qǐng)選擇矩陣運(yùn)算的類(lèi)型："<<endl;
	cout<<"(A)加法"<<endl<<"(B)減法"<<endl<<"(C)乘法"<<endl;
	char c;
	cin>>c;
	switch (c)
	{case 'a':cout<<"M+N的結(jié)果為："<<endl;
	              PlusSMatrix(M,N);
				  PrintSMatrix(M);break;
	case 'b':cout<<"M-N的結(jié)果為："<<endl;
	         SubSMatrix(M,N);
	      	PrintSMatrix(M);break;
	case 'c':
	MultSMatrix(M,N,Q);
	cout<<"運(yùn)算結(jié)果為："<<endl;
    PrintSMatrix(Q);break;}


	}
	
	
    cout<<"press any key to contine:"<<endl;
    cin.get();
   
}