与其说是回归 不如说是与过去自己的诀别

B. Getting Zero Educational Codeforces Round 126 (Rated for Div. 2) B. Getting Zero #include<bits/stdc++.h> using namespace std; const int N=4e5+10,M=32768; int dis[N]; void dfs(int k) { //if(dis[k]==15) return; if(k<1) return; int

B.求最小公倍数 lcm(a,b)=a*b/gcd(a,b) ll gcd(ll a,ll b) { return b?gcd(b,a%b):a; } 错误代码： if(res%ans==0||ans%res==0) ans=max(ans,res); else ans=res*ans; lcm(6,28)