lemnHacker的专栏

原题目地址：https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000 #include<iostream> #include<iomanip> #include<cmath> using namespace std; int main() {   int a,b...

#include<iostream> #include<set> using namespace std; int arr[1001]; bool app[100001]={false}; int main() { int n,m; cin>>n>>m; set<int> inComps; for(int ...

#include<iostream> using namespace std; int words[101]; int status[101]; bool func(int ii,int jj,int n) { status[ii]=-status[ii]; status[jj]=-status[jj]; int t=0; int tt=0; for(i...

#include<vector> #include<iostream> using namespace std; bool func(vector<int> arr,vector<int> ins,vector<vector<int> >&adjs) { for(int i=0;i<arr.siz.

查询次数参考https://blog.csdn.net/qq_34594236/article/details/79814881 #include<iostream> #include<cmath> #include<vector> #include<stdio.h> using namespace std; int getprim...

#include<iostream> using namespace std; int A[50000]; int B[50000]; int main() { int n; cin>>n; for(int i=0;i<n;++i) { cin>>A[i]; } for(int i=0;i<n;++i) { cin>...

#include<iostream> #include<algorithm> using namespace std; int main() { int A[100000]; int n; cin>>n; for(int i=0;i<n;++i) { cin>>A[i]; } sort(A,A+n); int k=1;...

问题的关键，记住各个节点的树高。另外采用new动态生成新的节点容易超时，采用数组预先分配节约时间。 #include<iostream> using namespace std; struct Node{ int value; Node * lchild; Node* rchild; Node* root; int height; Node(){ value ...

#include<iostream> #include<vector> #include<algorithm> #include<set> using namespace std; bool flag[201][201]; void isMaxClique(vector<int> Q,vector<int&g...

#include<iostream> #include<map> #include<vector> #include<algorithm> using namespace std; class Record{ public: string school; double scores; int num; // int rank; ...

This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contains the informa...

#include<iostream> #include<string> #include<iomanip> using namespace std;   bool isLegalNumber(string str,double & value) { bool isNegative=false; bool hasDot=false; do...