#include<iostream> #include<cstdlib> #include<cstdio> #include<vector> using namespace std; vector<int> path...

#include<iostream> #define pow(c) (1<<(c)) #define mask(c) ((unsigned long)-1)/(pow(pow(c))+1) #define round(n,c) ((n&mask(c))...

#include<iostream> #include<cstdlib> #include<cstdio> #include<unordered_map> using namespace std; int n,limit,mm;...

#include<iostream> #include<cstdlib> #include<cstdio> using namespace std; int main(){ int a,b,a_sum,res; while...

#include<iostream> #include<cstdlib> #include<cstdio> using namespace std; int m,n,*arr,res; void backtrace(int now,in...

#include<iostream> #include<cstdio> #include<cstdlib> using namespace std; int main(){ int n,k; while(~scanf("%...

#include<iostream> #include<cstdio> #include<cstdlib> using namespace std; void merge(int *array,int l,int mi,int r){ ...

#include<iostream> #include<cstdio> #include<cstdlib> using namespace std; void merge(int *array,int l,int mi,int r){ ...

#include<iostream> using namespace std; int main(){     int num;     cin>>num;     int *n=new ...

#include<iostream> #include<cmath> using namespace std; // 计算num位数字内所有含2的数字数量 int innerSize(int num) { if(num==1){retur...

#include<iostream> using namespace std; int main(){ for(int i=0;i<64;i++){ int shift=0,res=0,tmp=0; int c...