Ven

十大经典排序算法(动图演示) #include<iostream> using namespace std; void quick_sort(int a[],int left,int right) { int i=left,j=right; int basic=a[(left+right)/2]; while(i<=j) { //从左到右找到大于等于基准点的元素 ...

分治策略 #include<iostream> #include<cstdio> using namespace std; const int N = 100010; int n; int q[N],tmp[N]; void merge_sort(int q[],int l,int r) { if(l>=r) return ; int mid=l+r>&...

P3390 #include<iostream> #include<cstring> #define ll long long using namespace std; const int N=105; const int mod = 1e9+7; int n; struct Matrix{ ll matrix[N][N]; }; void init(Matrix ...

#include<cstdio> #include<cmath> const double EPS=1E-8; double B[110][110]; int n; int main(){ scanf("%d",&n); for (int i=0;i<n;i++){ for (int j=0;j<n;j++) ...