Combinatorics
XQQ524148626
这个作者很懒,什么都没留下…
展开
-
幻方
#include#includeusing namespace std;int main(){ int a[16][16],i,j,n,k; cout<<"Please input n(1~15,it must be odd.):"; cin>>n; while(!(n>=1&&n<=15)||n%2==0) {原创 2010-03-24 13:27:00 · 370 阅读 · 0 评论 -
普通递归算法:输出n个数的所有全排列
#includeusing namespace std;void Permutation(int a);int main(){ Permutation(5); return 0;}void Print(int a[],int n){ for(int i=0;i<n;i++) cout<<a[i]; cout<<endl;}void Recu原创 2010-03-26 22:26:00 · 2368 阅读 · 0 评论 -
计算行列式值
#include#includeusing namespace std;double HLS(int n,double **c);int main(){ int a,b,n; cout<<"n=:"; cin>>n; double **c; c=new double*[n+1]; for(int i=0;i<n+1;i++) { c[i]=原创 2010-03-26 21:51:00 · 654 阅读 · 0 评论