学步园

囧rz...取的这都是什么破题目啊...

前几日闲来无事，复习线代时对于计算表示鸭梨很大。于是果断写了一个计算行列式的小代码。

算法是用递归实现的最暴力的行列式计算方法。

/*<br /> It's just a tool to calculate the matrix.<br /> Made by :Kymin.Yu<br /> Mail :kymin.yu@gmail.com<br /> */</p> <p>#include<stdio.h><br /> FILE *fin;<br /> FILE *fout;<br /> int ans=0;<br /> void print(int n,int f[][100]);<br /> void perm(int n,int *temp,int series[],int f[][100],int boo[]);<br /> int dist(int n,int f[]);</p> <p>int main(){<br /> //--------------------initialization-------------<br /> fin=fopen("Matrix.txt","r");<br /> int n,i,j,f[100][100];<br /> fscanf(fin,"%d/n",&n);<br /> for(i=0;i<n;i++){<br /> for(j=0;j<n;j++)<br /> fscanf(fin,"%d",&f[i][j]);<br /> fscanf(fin,"/n");<br /> }<br /> fout=fopen("Matrix.txt","w");<br /> print(n,f);<br /> //-----------------------------------------------<br /> int boo[100]={0},series[100]={0},t=0;<br /> perm(n,&t,series,f,boo);<br /> fprintf(fout,"%d/n",ans);<br /> return 1;<br /> }</p> <p>void print(int n,int f[][100]){<br /> int i,j;<br /> fprintf(fout,"%d/n",n);<br /> for(i=0;i<n;i++){<br /> for(j=0;j<n;j++)<br /> fprintf(fout,"%d ",f[i][j]);<br /> fprintf(fout,"/n");<br /> }<br /> fprintf(fout,"The answer of this matrix is ");<br /> }<br /> void perm(int n,int *temp,int series[],int f[][100],int boo[]){<br /> int i,j,flag=1,t;<br /> t=*temp;<br /> if(t<=n-1)<br /> for(i=0;i<n;i++)<br /> if(!boo[i]){<br /> flag=0;<br /> boo[i]=1;<br /> series[t]=i;<br /> t++;<br /> perm(n,&t,series,f,boo);<br /> t--;<br /> boo[i]=0;<br /> }<br /> int k=1;<br /> if(flag){<br /> for(i=0;i<n;i++)<br /> k*=f[i][series[i]];<br /> if(dist(n,series))ans+=k;<br /> else ans-=k;<br /> }<br /> }<br /> int dist(int n,int f[]){<br /> int i,j,k=0;<br /> for(i=0;i<n;i++)<br /> for(j=0;j<i;j++)<br /> if(f[j]>f[i])k++;<br /> if(!(k%2)) return 1;<br /> else return 0;<br /> }</p> <p>

用空试着把这玩意改成dll..学着做个图形界面..乌拉拉..