好像这次week of code不是很难= = A int main(){ int n; int m; cin >> n >> m; cout<<(n+)/*)/)<<"\n"; ; } B 求n的因数中数字和最大的前提下最小的数,n<=10^5,大模拟. int n; pii qwq; int main() { scanf("%d",&n); ;i<=n;i++) { if(n%i) contin
往区间上覆盖一次函数,做法是用线段树维护标记永久化. 每次都忘了线段树要4倍空间,第一次交总是RE,再这么手残的话考场上就真的要犯逗了. #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int p = 39989; int read(int &k) { k = 0; int fh = 1; char c = getchar(); for(; c &
using System; using System.Collections.Generic; using System.Linq; using System.Web; using System.Web.UI; using System.Web.UI.WebControls; using System.Threading; using System.Net; using System.Net.Sockets; using System.Text; namespace WebSocket { pu
如果是个圆的话好办,如果是拉成椭圆呢?直接压回去!!! 然后随机增量法就行了 CODE: #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<cmath> using namespace std; #define sqr(x) ((x)*(x)) #define fi first #define se second #define m
TED01 - How To Get Better At The Things You Care About 昨天我发布了攻克英语口语的宣言,今天就行动.TED是我们学习口语的好地方,本着学以致用的原则,作为一名教师,我优先选择的内容都是和学习和教学相关的,第一篇是How To Get Better At The Things You Care About 听说过「刻意练习」的人都知道三个概念:舒适区.学习区.恐慌区.How To Get Better At The Things You Car
Yaroslav and Points 明明区间合并一下就好的东西, 为什么我会写得这么麻烦的方法啊啊啊. #include<bits/stdc++.h> #define LL long long #define fi first #define se second #define mk make_pair #define PLL pair<LL, LL> #define PLI pair<LL, int> #define PII pair<int, int>