![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CF比赛
caicai____
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 118 (Rated for Div. 2)
#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.原创 2021-12-08 09:51:36 · 64 阅读 · 0 评论 -
Codeforces Round #757 (Div. 2)
#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 <..原创 2021-11-26 23:53:53 · 463 阅读 · 0 评论