如何做一个营销型网站,免备案网站怎么备案域名,ps切片怎么做网站,张家港外贸型网站制作像1.9这样的题#xff0c;除了第8题有点长剩下的都属于不是很难的题#xff0c;它主要是想让我们按照顺序来查找指定的东西#xff0c;只要开一个桶数组就好解决很多。答案如下#xff08;只有1-10题#xff09;#xff1a; 1.9.1#xff1a;
#includebits/stdc.h除了第8题有点长剩下的都属于不是很难的题它主要是想让我们按照顺序来查找指定的东西只要开一个桶数组就好解决很多。答案如下只有1-10题 1.9.1
#includebits/stdc.h
using namespace std;
int a[10001];
int main(){int n,m;cinn;for(int i1;in;i){cina[i];}cinm;for(int i1;in;i){if(a[i]m){couti;return 0;}}cout-1;return 0;
} 1.9.2
#includebits/stdc.h
using namespace std;
char str[105],ans[105];
int main(){int n,maxx0;cinn;for(int i1;in;i){int x;cinxstr;if(maxxx){maxxx;strcpy(ans,str);}}coutans;return 0;
}
1.9.3
#includebits/stdc.h
using namespace std;
int a[10001],b[10001];
int main(){int maxx0,ans0;for(int i1;i7;i){cina[i]b[i];}for(int i1;i7;i){if(a[i]b[i]8){if(maxxa[i]b[i]){maxxa[i]b[i];ansi;}}}coutans;return 0;
} 1.9.4
#includebits/stdc.h
using namespace std;
string name;
char str[10001],a[105];
int main(){int n,ans0,asum0;cinn;for(int i1;in;i){int pj,py,lw,sum0;char xs,xb;cinstrpjpyxsxblw;if(pj80lw) sum8000;if(pj85py80) sum4000;if(pj90) sum2000; if(pj85xbY) sum1000; if(py80xsY) sum850;if(anssum){anssum;strcpy(a,str);}asumsum;}coutaendl;coutansendl; coutasum;return 0;
} 1.9.5
#includebits/stdc.h
using namespace std;
int main()
{int n,max0,min10005;cinn;int a[n5]{0};for(int i1;in;i){cina[i]; }for(int i1;in;i) {if(a[i]max){maxa[i];}if(mina[i]){mina[i];}}coutmax-min;return 0;
} 1.9.6:
#includebits/stdc.h
using namespace std;
char str[100001];
int t[30];
int main(){cinstr1;int lenstrlen(str1);for(int i1;ilen;i){int xstr[i]-a1;t[x];}int maxx0,minxlen;for(int i1;i26;i){maxxmax(maxx,t[i]);if(t[i]t[i]minx) minxt[i];}int xmaxx-minx;int f0;for(int i2;ix;i){if(x%i0){f1;break;}}if(x1||x0) f1;if(f0) coutLucky Wordendlx;else coutNo Answerendl0;return 0;
} 1.9.7:
#includebits/stdc.h
using namespace std;
int a[100001];
int main(){int n,sum0,maxx0;cinn;for(int i1;in;i){cina[i]; } for(int i1;in;i){maxxmax(maxx,a[i]);}for(int i1;in;i){if(a[i]!maxx) suma[i];}coutsum;return 0;
} 1.9.8:
#includebits/stdc.h
using namespace std;
double a[310];
int main()
{int n;cinn;double sum0;for(int i1;in;i){cina[i];sumsuma[i];} double max0,min10000000; int num1,num2;for(int i1;in;i){if(a[i]max) {maxa[i];num1i;}if(a[i]min) {mina[i];num2i;}}double ave(sum-max-min)*1.0/(n-2); double ans0;for(int i1;in;i) {if(i!num1i!num2){if(fabs(ave-a[i])ans) ansfabs(ave-a[i]);}}printf(%.2lf %.2lf,ave,ans);return 0;
} 1.9.9:
#includebits/stdc.h
using namespace std;
int a[100001];
int main(){int n,maxx0;cinn;for(int i1;in;i){int x;cinx;a[x];maxxmax(maxx,x);}for(int i0;imaxx;i){couta[i]endl;}return 0;
} 1.9.10:
#includebits/stdc.h
using namespace std;int a[35][105];
int b[35];int main()
{int n,k,x,max0;char ch; cinn;for(int i1;in;i){k0; while(1){scanf(%d%c,x,ch);if(ch,) {k;a[i][k]x; }else{a[i][k]x; b[i]k;break;}}}for(int i1;in;i) {for(int j1;jb[i];j){if(a[i][j]max)maxa[i][j];}}coutmaxendl; bool flag0;for(int i1;in;i){for(int j1;jb[i];j){if(a[i][j]max){if(flag0){couti;flag1;}elsecout,i;break;}}}return 0;
}
