#include iostream#include cmathusing namespace std;int a[605];int main() { int n,x,w,id; cinnw; for(int p=1;p=n;p++){ scanf("%d", id=max(1,(int)floor(1.0*p*w/100)); a[x]++; int sum=0; for(int j=600;j=0;j--){ sum+=a[j]; if(sum=id){ printf("%

点我呐

#include iostream#include stackusing namespace std;int jz[30]={1};void coutn(int n,int i){ if(n==0) return ; coutn(n/2,i+1); if(n%2) coutjz[i]" ";}int main(){ for(int i=1;i30;i++) jz[i]=jz[i-1]*2; int n; cinn; if(n%2==1) cout-1; else coutn(

点我呐

#include iostream#include stackusing namespace std;int jz[30]={1};int main(){ for(int i=1;i30;i++) jz[i]=jz[i-1]*2; int n; cinn; if(n%2==1) cout-1; else { stackint s; int i=0; while(n){ if(n%2) s.push(jz[i]); i++; n/=2; } while(!s.empty()){

点我呐

#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

点我呐