Re_Life的博客

注意在乘的过程中不要爆long long ,如果爆了转为快速乘 快速幂 int power(int a, int b, int mod){ int ans = 1 % mod; while(b){ if(b&1) ans = (long long)ans * a % mod; a = (long long) a*a %mod; ...

Quick_sort #include <bits/stdc++.h> using namespace std; #define read(x) scanf("%d",&x) const int N = 1e5+10; int q[N], n; void quick_sort(int q[], int l, int r) { if(l >= r) return...