qq_42426141的博客

首先顺着题目逻辑打表打表代码：#include<iostream>#include<string>#include<vector>using namespace std;int lowbit(int x){ return x&(-x);}int main(){ int N; int a[1007] = { 1,1 };...

题意很好理解，需要优先队列#include<bits/stdc++.h>using namespace std;const int maxn = 1e5 + 5;typedef long long int ll;struct Node{ ll a, b, num1, num2; bool operator < (const Node y) c...

JFraction Comparision题意：给出x, a, y, b, 判断x / a与y / b的大小思路：数字太大需要大数，计算x * b与y *a的大小，再判断实现：JAVA大数import java.math.BigInteger;import java.util.*;public class Main { public static void ...

B. Split a Numbertime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputDima worked all day and wrote down on a long paper strip his fa...

A. Pupils Redistributionhttps://codeforces.com/contest/779/problem/A题意就是把数字1到5平均分到两个班内，题水但是判定容易出BUG#include<bits/stdc++.h>using namespace std;constexpr int maxl = 6;int numa[maxl], num...

https://www.luogu.org/problemnew/show/P1091题目描述NN位同学站成一排，音乐老师要请其中的(N-KN−K)位同学出列，使得剩下的KK位同学排成合唱队形。合唱队形是指这样的一种队形：设K位同学从左到右依次编号为1,2,…,K1,2,…,K，他们的身高分别为T_1,T_2,…,T_KT1​,T2​,…,TK​， 则他们的身高满足T_1<......

https://codeforces.com/contest/1152/problem/B大致思路是找到二进制n的第一个0， 然后模拟，与位操作有关#include<algorithm>#include <iostream>#include <sstream>#include <cstring>#include <cst...

愚人节专场比我想象的难一些（太菜了）代码来自一个博客：https://blog.csdn.net/qq_38185591/article/details/88966801题目链接：https://codeforces.com/contest/1145/problem/A主要考验dfs能力，我第一次写了110行代码没过卡题贴代码：#include<algorithm&...

这题是递归加打表加DP（给大佬ORZ）打表代码：#include<iostream>using namespace std;int sum = 0;void dfs(int n){ sum++; if (n == 1) return; for (int i = 1; i <= n / 2; i++) dfs(i);}int main(){ in...

https://codeforces.com/contest/1133/problem/D#include&lt;algorithm&gt;#include &lt;iostream&gt;#include &lt;sstream&gt;#include &lt;cstring&gt;#include &lt;cstdlib&gt;#include &lt;string&...

https://codeforces.com/contest/1133/problem/B#include&lt;algorithm&gt;#include &lt;iostream&gt;#include &lt;sstream&gt;#include &lt;cstring&gt;#include &lt;cstdlib&gt;#include &lt;string&...

题目分析：Problem DescriptionLittle Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he meets a 3D geometry problem, he will struggle to dra...

转化为维护最大连续子串和#include<bits/stdc++.h>#define ll long long#define pi pair<int, ll>#define mk make_pairusing namespace std;const int maxn = 2010;struct node { int x, y; ll...