2014年三明学院ACM编程训练题.docVIP

Problem 1035 抓小偷 (编程竞赛训练题)#include?iostream using?namespace?std; int?main() {char?c,d; int?n,i,j,flag[27],k=0; while(scanf(%d\n,n)n) {k++;memset(flag,0,sizeof(flag)); for(i=0;i3;i++) for(j=0;jn;j++) {scanf(%c%c,c,d); flag[c-A]++;} printf(Case?#%d:,k); for(i=0,j=0;i=26;i++) {if(flag[i]=3) printf(?%c,i+A);} printf(\n);} return?0;}Problem 1040 老师提问谁 (编程竞赛训练题) #includeiostream #includealgorithm using?namespace?std; int?main() {int?n,i,j; while(cinnn) {int?ch[2000],sh[2000]; for(i=0;in;i++) {cinch[i]; sh[i]=ch[i];} sort(sh[0],sh[n]); for(j=0;jn;j++) if(ch[j]==sh[n-2])?{coutj+1?;?break;} for(i=0;in;i++) if(ch[i]==sh[1])?{couti+1endl;?break;}} return?0;} Problem 1044 公路网 (编程竞赛训练题)//最小生成树 #include iostream #include algorithm using namespace std; struct Data { int a,b,c; }data[1010]; int father[105],rank[105]; bool cmp(struct Data A,struct Data B) { return A.cB.c; } void init()//初始化并查集 { for(int i=0;i105;i++) { father[i]=i; rank[i]=1; } } int find_set(int x)//寻找父节点 { if(x!=father[x]) father[x]=find_set(father[x]); return father[x]; } bool union_set(int x,int y)//合并两节点 { x=find_set(x); y=find_set(y); if(x==y) return false; else if(rank[x]=rank[y]) { father[x]=y; rank[y]+=rank[x]; } else { father[y]=x; rank[x]+=rank[y]; } return true; } int main() { int n,m,i,sum; while(scanf(%d,n)n) { scanf(%d,m); for(i=0;im;i++) scanf(%d %d %d,data[i].a,data[i].b,data[i].c); sort(data,data+m,cmp); init(); for(i=0,sum=0;im;i++) { if(union_set(data[i].a,data[i].b)) { sum+=data[i].c; } } printf(%d\n,sum); } return 0; }Problem 1046 村民相会(编程竞赛训练题) #include?stdio.h int?main() { int?n,m,sum,a,b; while(scanf(%d?%d,n,m)!=EOF) { while(m--) { sum=0; scanf(%d?%d,a,b); while(a!=b) { ab?a=a/2:b=b/2; sum++; } printf(%d\n,sum); } } return?0; } Problem 1047 奖学金(编程竞赛训练题) #include?iostream #include?algorithm using?namespace?std; struct?Data { int?clas,num,sco