\u4e00\u3001STRASSEN\u7b97\u6cd5
#include<iostream.h>
#include<math.h>
#include<memory.h><\/p>\n
\/\/enum error {wrong,right,overflow};<\/p>\n
void mutrixMul(int **a,int **b,int **c,int n);
void main(void)
{
int n;<\/p>\n
cout<<"please intput the demi of matrix:"<<endl;
cin>>n;
int *a=new int[n*n];
int *b=new int[n*n];
int *c=new int[n*n];
\/\/\u521d\u59cb\u5316
cout<<"Input the elements of the first:"<<endl;
for(int counter=0;counter<n*n;counter++)
{
cin>>a[counter];
}
\/\/\u9700\u8981\u6e05\u7a7a\u3001\uff01\uff01\uff01
cout<<"your intput is:"<<endl;
for(counter=0;counter<n*n;counter++)
{
if(counter%n<n\/2)
cout<<endl;
cout<<a[counter]<<" ";
}<\/p>\n
cout<<endl<<"Input the elements of the secong:"<<endl;
for(counter=0;counter<n*n;counter++)
{
cin>>b[counter];
}
cout<<"your intput is:"<<endl;
for(counter=0;counter<n*n;counter++)
{
if(counter%n<n\/2)
cout<<endl;
cout<<b[counter]<<" ";
}<\/p>\n
mutrixMul(&a,&b,&c,n);<\/p>\n
cout<<endl<<"the answer is:"<<endl;
for(counter=0;counter<n*n;counter++)
{
if(counter%n<n\/2)
cout<<endl;
cout<<c[counter]<<" ";
}
cout<<endl;
}
void mutrixMul(int **a,int **b,int **c,int n)
{
if(n==1)
{
\/\/ **c=2;
(*c)[0]=(*a)[0]*(*a)[0];
}
else
{
int *a1=new int[n*n\/4];
int *a2=new int[n*n\/4];
int *a3=new int[n*n\/4];
int *a4=new int[n*n\/4];
\/\/\u4e3aa\u7533\u8bf7\u56db\u90e8\u5206\u52a8\u6001\u7a7a\u95f4\u3002<\/p>\n
int *b1=new int[n*n\/4];
int *b2=new int[n*n\/4];
int *b3=new int[n*n\/4];
int *b4=new int[n*n\/4];
\/\/\u4e3ab\u7533\u8bf7\u3002<\/p>\n
int *c1=new int[n*n\/4];
int *c2=new int[n*n\/4];
int *c3=new int[n*n\/4];
int *c4=new int[n*n\/4];
int *c5=new int[n*n\/4];
int *c6=new int[n*n\/4];
int *c7=new int[n*n\/4];
int *c8=new int[n*n\/4];<\/p>\n
int a1counter,a2counter,a3counter,a4counter;
a1counter=a2counter=a3counter=a4counter=0;
int b1counter,b2counter,b3counter,b4counter;
b1counter=b2counter=b3counter=b4counter=0;
int c1counter,c2counter,c3counter,c4counter;
c1counter=c2counter=c3counter=c4counter=0;
int c5counter,c6counter,c7counter,c8counter;
c5counter=c6counter=c7counter=c8counter=0;<\/p>\n
\/\/\u628aa\u7ec6\u5206\u5230a1,a2,a3,a4\u56db\u4e2a\u77e9\u9635;
for(int i=0;i<n*n\/2;i++)
{
if(i%n<n\/2)
{
a1[a1counter]=(*a)[i];
a1counter++;
}
else
{
a2[a2counter]=(*a)[i];
a2counter++;
}
}
for(i=n*n\/2;i<n*n;i++)
{
if(i%n<n\/2)
{
a3[a3counter]=(*a)[i];
a3counter++;
}
else
{
a4[a4counter]=(*a)[i];
a4counter++;
}
}
\/\/\u628ab\u7ec6\u5206\u5230b1,b2,b3,b4\u56db\u4e2a\u77e9\u9635;
for(i=0;i<n*n\/2;i++)
{
if(i%n<n\/2)
{
b1[b1counter]=(*b)[i];
b1counter++;
}
else
{
b2[b2counter]=(*b)[i];
b2counter++;
}
}
for(i=n*n\/2;i<n*n;i++)
{
if(i%n<n\/2)
{
b3[b3counter]=(*b)[i];
b3counter++;
}
else
{
b4[b4counter]=(*b)[i];
b4counter++;
}
}
mutrixMul(&a1,&b1,&c1,n\/2);
mutrixMul(&a2,&b3,&c2,n\/2);<\/p>\n
mutrixMul(&a1,&b2,&c3,n\/2);
mutrixMul(&a2,&b4,&c4,n\/2);<\/p>\n
mutrixMul(&a3,&b1,&c5,n\/2);
mutrixMul(&a4,&b3,&c6,n\/2);<\/p>\n
mutrixMul(&a3,&b2,&c7,n\/2);
mutrixMul(&a4,&b4,&c8,n\/2);<\/p>\n
\/\/
for(i=0;i<n*n\/2;i++)
{
if(i%n<n\/2)
{
(*c)[i]=c1[c1counter]+c2[c2counter];
c1counter++;
c2counter++;<\/p>\n
}
else
{
(*c)[i]=c3[c3counter]+c4[c4counter];
c3counter++;
c4counter++;
}
}
for(i=n*n\/2;i<n*n;i++)
{
if(i%n<n\/2)
{
(*c)[i]=c5[c5counter]+c6[c6counter];
c5counter++;
c6counter++;
}
else
{
(*c)[i]=c7[c7counter]+c8[c8counter];
c7counter++;
c8counter++;
}
}<\/p>\n
delete a1,a2,a3,a4,b1,b2,b3,b4;
delete c1,c2,c3,c4,c5,c6,c7,c8;
}
}
\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/
\u4e8c
*\u6b64\u7a0b\u5e8f\u4e3a\u7528\u6539\u8fdbStrassen\u5206\u6cbb\u6cd5\u6765\u89e3\u51b3\u77e9\u9635\u4e58\u6cd5*\/
\/*\u65b0\u589e\u529f\u80fd\uff1a\u80fd\u7981\u6b62\u5bf9\u9636\u6570\u4e3a\u975e2\u7684N\u6b21\u65b9\u7684\u77e9\u9635\u8fdb\u884c\u8fd0\u7b97*\/
#include<stdio.h>
#define M 100
struct matrix
{
int m[32][32];
};<\/p>\n
int Judgment(int n) \/*\u5224\u65ad\u662f\u5426\u4e3a2\u7684N\u6b21\u65b9\u7684\u51fd\u6570*\/
{
int flag,temp=n;
while(temp!=1 && temp%2==0)
{
if(temp%2==0) temp\/=2;
else flag=1;
}
if(temp==1) flag=0;
return flag;
}<\/p>\n
void Divide(matrix &d,matrix &d11,matrix &d12,matrix &d21,matrix &d22,int n)
\/*\u5c06\u4e00\u4e2a\u5927\u77e9\u9635\u62c6\u5206\u6210\u56db\u4e2a\u5c0f\u77e9\u9635\u7684\u51fd\u6570*\/
{
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
d11.m[i][j]=d.m[i][j];
d12.m[i][j]=d.m[i][j+n];
d21.m[i][j]=d.m[i+n][j];
d22.m[i][j]=d.m[i+n][j+n];
}
}<\/p>\n
matrix Merge(matrix a11,matrix a12,matrix a21,matrix a22,int n)
\/*\u5c06\u56db\u4e2a\u5c0f\u77e9\u9635\u5408\u5e76\u6210\u4e00\u4e2a\u5927\u77e9\u9635\u7684\u51fd\u6570*\/
{
int i,j;
matrix a;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
a.m[i][j]=a11.m[i][j];
a.m[i][j+n]=a12.m[i][j];
a.m[i+n][j]=a21.m[i][j];
a.m[i+n][j+n]=a22.m[i][j];
}
return a;
}<\/p>\n
matrix AdhocMatrixMultiply(matrix x,matrix y) \/*\u9636\u6570\u4e3a2\u7684\u77e9\u9635\u4e58\u6cd5\u51fd\u6570*\/
{
int m1,m2,m3,m4,m5,m6,m7;
matrix z;<\/p>\n
m1=(x.m[1][1]+x.m[1][2])*y.m[1][1];
m2=x.m[1][2]*(y.m[2][1]-y.m[1][1]);
m3=(x.m[2][1]+x.m[2][2])*y.m[2][2];
m4=x.m[2][1]*(y.m[1][2]-y.m[2][2]);
\n
m5=(x.m[1][2]+x.m[2][1])*(y.m[1][1]+y.m[2][2]);
m6=(x.m[2][1]-x.m[1][1])*(y.m[1][1]+y.m[1][2]);
m7=(x.m[1][2]-x.m[2][2])*(y.m[2][2]+y.m[2][1]);
z.m[1][1]=m1+m2;
z.m[1][2]=m5-m1+m4-m6;
z.m[2][1]=m5-m3+m2-m7;
z.m[2][2]=m3+m4;<\/p>\n
return z;
}<\/p>\n
matrix MatrixPlus(matrix f,matrix g,int n) \/*\u77e9\u9635\u52a0\u6cd5\u51fd\u6570*\/
{
int i,j;
matrix h;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
h.m[i][j]=f.m[i][j]+g.m[i][j];
return h;
}<\/p>\n
matrix MatrixMinus(matrix f,matrix g,int n) \/*\u77e9\u9635\u51cf\u6cd5\u51fd\u6570*\/
{
int i,j;
matrix h;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
h.m[i][j]=f.m[i][j]-g.m[i][j];
return h;
}<\/p>\n
matrix MatrixMultiply(matrix a,matrix b,int n) \/*\u77e9\u9635\u4e58\u6cd5\u51fd\u6570*\/
{
int k;
matrix a11,a12,a21,a22;
matrix b11,b12,b21,b22;
matrix c11,c12,c21,c22,c;
matrix m1,m2,m3,m4,m5,m6,m7;
k=n;
if(k==2)
{
c=AdhocMatrixMultiply(a,b);
return c;
}
else
{
k=n\/2;
Divide(a,a11,a12,a21,a22,k); \/\/\u62c6\u5206A\u3001B\u3001C\u77e9\u9635
Divide(b,b11,b12,b21,b22,k);
Divide(c,c11,c12,c21,c22,k);<\/p>\n
m1=MatrixMultiply(MatrixPlus(a11,a12,n\/2),b11,k);
m2=MatrixMultiply(a12,MatrixMinus(b21,b11,k),k);
m3=MatrixMultiply(MatrixPlus(a21,a22,k),b22,k);
m4=MatrixMultiply(a21,MatrixMinus(b12,b22,k),k);
m5=MatrixMultiply(MatrixPlus(a12,a21,k),MatrixPlus(b11,b22,k),k);
m6=MatrixMultiply(MatrixMinus(a21,a11,k),MatrixPlus(b11,b12,k),k);
m7=MatrixMultiply(MatrixMinus(a12,a22,k),MatrixPlus(b22,b21,k),k);
c11=MatrixPlus(m1,m2,k);
c12=MatrixPlus(MatrixMinus(m5,m1,k),MatrixMinus(m4,m6,k),k);
c21=MatrixPlus(MatrixMinus(m5,m3,k),MatrixMinus(m2,m7,k),k);
c22=MatrixPlus(m3,m4,k);<\/p>\n
c=Merge(c11,c12,c21,c22,k); \/\/\u5408\u5e76C\u77e9\u9635
return c;
}
}<\/p>\n
void main()
{
int i,j,n;
matrix A,B,C={0};
while(n!=0)
{
printf("\u8bf7\u8f93\u5165\u77e9\u9635\u7684\u9636\u6570N:\\n");
scanf("%d",&n);
if(n==0) break;
else
if(Judgment(n)==0) \/\/\u5224\u65ad\u77e9\u9635\u7684\u9636\u662f\u5426\u4e3a2\u7684N\u6b21\u65b9
{
printf("\u8bf7\u8f93\u5165\u77e9\u9635A:\\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&A.m[i][j]);
printf("\u8bf7\u8f93\u5165\u77e9\u9635B:\\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&B.m[i][j]);
if(n==1) C.m[1][1]=A.m[1][1]*B.m[1][1]; \/\/\u77e9\u9635\u9636\u6570\u4e3a1\u65f6\u7684\u7279\u6b8a\u5904\u7406
else C=MatrixMultiply(A,B,n);<\/p>\n
printf("\u77e9\u9635C\u4e3a:\\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
printf("%8d%c",C.m[i][j],j==n?'\\n':' ');
}
else printf("\u77e9\u9635\u7684\u9636\u6570\u4e0d\u662f2\u7684N\u6b21\u65b9\uff01\\n\\n\\n");
}
}
\/*\u6b64\u7a0b\u5e8f\u7528\u9012\u5f52\u5206\u6cbb\u6cd5\u89e3\u51b3\u77e9\u9635\u4e58\u6cd5\u95ee\u9898\u3002
\u5f53N=2\u65f6\uff0c\u77e9\u9635\u53ef\u76f4\u63a5\u8ba1\u7b97\u51fa\u6765\u3002
\u5f53N>2\u65f6\uff0c\u53ef\u4ee5\u7ee7\u7eed\u5c06\u77e9\u9635\u5206\u5757\uff0c\u76f4\u5230\u5b50\u77e9\u9635\u7684\u9636\u964d\u4e3a2\u3002*\/<\/p>\n","protected":false},"excerpt":{"rendered":"
\u4e00\u3001STRASSEN\u7b97\u6cd5 #include<…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_lmt_disableupdate":"","_lmt_disable":"","footnotes":""},"categories":[100],"tags":[],"class_list":["post-284","post","type-post","status-publish","format-standard","hentry","category-nothing"],"_links":{"self":[{"href":"https:\/\/fanhaijun.com\/index.php?rest_route=\/wp\/v2\/posts\/284","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fanhaijun.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fanhaijun.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fanhaijun.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fanhaijun.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=284"}],"version-history":[{"count":0,"href":"https:\/\/fanhaijun.com\/index.php?rest_route=\/wp\/v2\/posts\/284\/revisions"}],"wp:attachment":[{"href":"https:\/\/fanhaijun.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=284"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fanhaijun.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=284"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fanhaijun.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=284"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}