chaos

1
2
3
4
5
6
7
8
9
function<ll(ll, ll)> qpow = [&](ll _a, ll _b) ->ll {
ll res = 1;
while (_b) {
if (_b & 1) res = res * _a % MOD;
_a = _a * _a % MOD;
_b >>= 1;
}
return res;
};
1
2
3
sort(ans.begin(), ans.end(), [&](int _a, int _b){
return v[_a] < v[_b];
});

chaos
http://example.com/2022/08/18/chaos/
Author
John Doe
Posted on
August 18, 2022
Licensed under