caicai____的博客

#include<iostream> #include <algorithm> #include<cmath> using namespace std; //快速幂 long long qpow(long long x, long long base) { long long ans = 1; while (base) { if (base & 1) {//如果最后一位为1 ans *= x; } x = x * x;//不用else.

#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int t, n, l, r, k,a; vector<int>v; cin >> t; while (t--) { cin >> n>>l>>r>>k; for (int i = 0; i &lt..