摘要：高精度加法 vector<int> add(vector<int> &A, vector<int> &B) { //654321 654321 vector<int> C; int temp = 0; for (int i = 0; i < A.size() || i < B.size(); ++i 阅读全文

摘要：快速排序 void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l + (r - l >> 1)]; while (i < j){ do i ++ ; while (q[ 阅读全文