#include iostreamusing namespace std;int main(){ int x; cinx; coutx" "x*10; return 0;}

点我呐

#include iostreamusing namespace std;string s="",a;void printwl(int f){ int w=0,l=0; for(int i=0;is.size();i++){ if(s[i]=='W') w++; else if(s[i]=='L') l++; else coutw":"lendl; if((w=f||l=f)abs(w-l)1){ coutw":"lendl; w=l=0; } }}int main() {

点我呐

// 1415#include iostream#include algorithmusing namespace std;int n,q;int a[1050];int l,b;int pow2(int a,int b){ int s=1; while(b--) s*=a; return s;}int main() { cinnq; for(int i=1;i=n;i++) cina[i]; sort(a+1,a+n+1); while(q--){ cinlb; int a

点我呐

#include bits/stdc++.husing namespace std;bool cmp(int a,int b){ return ab;}int main()//1965：【14NOIP普及组】珠心算测验{ int n; cinn; int a[1000]; for(int i=0;in;i++) cina[i]; sort(a,a+n,cmp);//从大到小排序 int c,p,q,ans=0

点我呐

#include iostreamusing namespace std;string a,b;void f(string cx,string zx){if(zx.size()==0) return ;char root=cx[0];int rootid=zx.find(root);string lzx=zx.substr(0,rootid);string rzx=zx.substr(rootid+1);string lcx="",rcx="";for(int i=1;cx[

点我呐

#include iostream#include cmathusing namespace std;int de,m,maxi;bool tree[1024*1024+50]={};//默认全是0int tra(int i){ int j=i; if(tree[i]==false){ tree[i]=true; j=2*i; } else if(tree[i]==true){ tree[i]=false; j=2*i+1; } if(jmaxi) retur

点我呐

#include iostreamusing namespace std;string a,b;void f(string xx,string zx){if(xx.size()==0) return ;char root=xx[0];int rootid=zx.find(root);string lzx=zx.substr(0,rootid);string rzx=zx.substr(rootid+1);string lxx=xx.substr(1,rootid);strin

点我呐

#include iostreamusing namespace std;/*先序 gzzzzzyyy1,mid mid+1中序 zzzzzgyyy0,mid mid+1后序 zzzzzyyyg0,mid mid,zxr.size()*/string xx,zx;void findtree(string xx,string zx){if(xx.size()==0||zx.size()==0) return ;int mid=zx.find(xx[0])

点我呐

#includebits/stdc++.husing namespace std;int n,ans;string s[10000];int main(){ while(cins[n++]);//将所有的字符串出入(结尾加上CTRL+Z)n--;sort(s,s+n);//将所有的字符串按照顺序排序ans=s[0].size();for(int i=1;in;i++){in

点我呐

#include bits/stdc++.husing namespace std;int main(){vectorstring v;string s;while(cins) v.push_back(s); sort(v.begin(),v.begin()+v.size());int ans=v[0].size()+1;for(int i=1;iv.size();i++){int j=0;while(jv[i].size()v[i][j]==v[i-1][j]) j++;a

点我呐