#define ll long long #define vec vector<int> #define inf 0x3f3f3f3f #define MAX 25 #define P pair<int,int> #...

  #define ll long long #define vec vector<int> #define inf 0x3f3f3f3f #define MAX 25 #define P pair<int,int> #define MOD...

int main() { while (cin >> a >> b >> c >> d) { double res = -inf; for (int i = -100; i < 100; i++) { if (f...

  https://blog.csdn.net/csyifanZhang/article/details/105342413 部分和拼凑问题都一个样↑ int main() { int v[7] = {0, 1,2,3,5,10,20 }, a[7...

  #define vec vector<int> #define inf 0x3f3f3f3f #define MAX 100005 #define P pair<int,int> #define MOD 1000000 int ma...

  #define ll long long #define vec vector<int> #define inf 0x3f3f3f3f #define MAX 1005 #define P pair<int,int> #define M...

      int main() { int T, n; cin >> T; while (T--) { cin >> n; map<int, int> m1, m2; for (...

    int main() { int ma = 0; string res, s; while (getline(cin, s)) { s += ' ';//最后加一个空格 int i = 0, beg = 0, sum = 0; s...

int main() { string t; while (cin >> t) { int i = 0, len = t.size(), cnt = 1, sign = 1; for (int i = 0; i < len; i++) if (...

先把大数取模，然后就变成了快速幂的简单问题， https://blog.csdn.net/csyifanZhang/article/details/105623224 ↑求模运算的性质总结   // s%k int Mod(string s, ...

用map直接写， Map采用的是红黑树实现的，在插入、删除、查找时的复杂度都为 O(log n) 我们可以维护一个大小为k的红黑树，不断的维护他，当我用cin的时候这个题是不行的，数据量太大，scanf加速输入很快就过了。 struct peo { char name...

拓扑排序求出最早完成时间和所有任务的最早开始时间，然后反向建图，求出最晚开始时间，两遍拓扑   #define ll long long #define vec vector<ll> #define inf 0x3f3f3f3f #define MA...

  #define ll long long #define vec vector<int> #define inf 0x3f3f3f3f #define MAX 1005 #define P pair<ll,ll> #define MOD...

https://blog.csdn.net/csyifanZhang/article/details/106391657 推导过程↑   #define ll long long #define vec vector<int> #def...

https://blog.csdn.net/csyifanZhang/article/details/104850550?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159056753619195239819100%2522%...

  int main() { long long n, k, a; while (cin >> n >> k) { deque<ll> v; for (int i = 0; i < n; i++)cin >...

int main() { int n, a; while (cin >> n) { long long sum = 0; for (int i = 1; i <= n; i++)sum += i; for (int i = 0; i < n...

int main() { long long n, k; while (cin >> n >> k) { if (k <= n) { cout << (k - 1) / 2 << endl; } ...

只有90分，求大佬答疑 #include<iostream> #include<string> #include<string.h> #include<algorithm> #include<vector> #in...

https://blog.csdn.net/csyifanZhang/article/details/105623224?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159055038919725247648133%2522%...