在文章《题解：P12684 【MX-J15-T4】叉叉学习魔法》发表评论：

过了过了，谢谢大佬

在文章《题解：P12684 【MX-J15-T4】叉叉学习魔法》发表评论：

开了O2也是TLE

在讨论《86pts TLE 求条玄关》回复：

应该是能过，但是要从小到大排序

在文章《EasyX 教程之入门篇》发表评论：

小熊猫C++自带

在讨论《3个点RE70分求调》回复：

Your function "cmp" is wrong. ```cpp bool cmp(a x,a y){ if(x.b==y.b){ return x.s y.b; } ```

1.```for(int i=0;i<n;i++)``` 2.```for(元素类型 变量名:迭代对象)``` 3.```for(元素类型 &变量名:迭代对象)``` ~n=3~

``` I see the player you mean. [playname]? Yes. Take care. It has reached a higher level now. It can read our thoughts. That doesn't matter. It thinks we are pa…

## 创建 ```cpp struct Node{ int data; Node *next; }; int main(){ int n; cin>>n; Node *head=new Node; Node *tail=head; for(int i=0;i >p->data; p->next=NULL; tail->…

```cpp long long kuai_su_mi(long long a,long long b,long long p){ a%=p; long long res=1; while(b){ if(b&1){ res=(res*a)%p; } a=(a*a)%p; b>>=1; } return res; } `…

我写了个代码1~5随机数，5分之1概率多提交几遍就成功了


# 最大公约数 ```cpp long long gcd(long long a,long long b){ if(a<=0||b<=0)return 0; if(a%b==0)return b; else return gcd(a,a%b); } ``` # 最小公倍数 ```cpp long long lcm(lo…

同学们肯定被极域课堂控制过，苦不堪言。  今天我来教你们如何摆脱极域控制。 # 一、原理 极域课堂本质上是一个软件，通过联网监视、控制学生端。 所以，我们可以通过断网来摆脱控制（不是真正意义上的…

```cpp #include using namespace std; void jf(string a,string b){ int an[1000]={0},bn[1000]={0}; int lena=a.size(),lenb=b.size(); int lenmax=max(lena,lenb); for(…

```cpp #include using namespace std; void gao_jing_du_jian_fa(string a,string b){ int an[1000],bn[1000]; int lena=a.size(),lenb=b.size(); int len=max(lena,lenb)…

```cpp #include using namespace std; int num[10086]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i > num…

```cpp a[0]=0 b[1]=a[1]-a[0]; b[2]=a[3]-a[2]; a[n]=b[n]+......+b[3]+b[2]+b[1]; ``` 给 a[l]~a[r] 区间加上 c,只需对差分数组b做`b[l]+c,b[r+1]-=c;` 复杂度为`O(1)`。 差分解决区间加减问题，前缀和解决区…

https://cspjs.online/contest/699/problem/3 ```cpp #include using namespace std; int n, a[1000010], t = 0, k; vector vv; int main() { freopen("unlucky.in", "r",…

https://cspjs.online/contest/699/problem/2 ```cpp #include #include using namespace std; typedef long long ll; ll a[110]; int main() { freopen("lucknum.in", "r"…

https://cspjs.online/contest/699/problem/1 ```cpp #include using namespace std; int main() { freopen("round.in", "r", stdin); freopen("round.out", "w", stdout);…

https://cspjs.online/contest/688/problem/4 https://b1bznc26af6.feishu.cn/file/Wk6WbkvT3oXXqwx2XzvcgcxMn0Y

https://cspjs.online/contest/688/problem/3 ```cpp #include #include #include using namespace std; int gcd(int a, int b); struct Fraction { int numerator; // 分子…

https://cspjs.online/contest/688/problem/2 ```cpp #include #include #include #include using namespace std; string decode(const string& s) { vector result; int i…

https://cspjs.online/contest/688/problem/1 ```cpp #include using namespace std; struct sb { long long n = 0; char c = 0; } sb[28]; int main() { freopen("scraper…

D. 【二月份 -- 基础语法组】-- T4 --时钟 ```cpp #include using namespace std; int calc(int x) { return (x / 10 == 0) + (x % 10 == 0); } int main() { freopen("clock.in", "r",…

https://cspjs.online/contest/649/problem/3 ```cpp #include using namespace std; const int SIZE = 2e5 + 5;//=2*10^5+5 int a[SIZE], sum[SIZE]; int main() { freope…

https://cspjs.online/contest/649/problem/2 ```cpp #include using namespace std; const int SIZE = 10; int n; char str[SIZE], ans[SIZE]; int main() { freopen("cho…

https://cspjs.online/contest/756/problem/4 ```cpp #include #define LL long long using namespace std; void solve(int n,int m){ deque Q; for(int i=0;i >a; Q.push_…

https://cspjs.online/contest/756/problem/3 ```cpp #include #define LL long long using namespace std; class game{ public: long long a(int n){ return (n+1)*9; } }…

https://cspjs.online/contest/756/problem/2 ```cpp #include #define LL long long using namespace std; int num1[1000100]; int num2[1000100]; int main(){ freopen("…