hrbust 软微学院 2016 ACM选拔重现 标程

A.

#include<stdio.h>int main(){    printf("      A           CCCCCCCCCCCCC          M           M\n");    printf("     A A          C                     M M         M M\n");    printf("    A   A         C                    M   M       M   M\n");    printf("   AAAAAAA        C                   M     M     M     M\n");    printf("  A       A       C                  M       M   M       M\n");    printf(" A         A      C                 M         M M         M\n");    printf("A           A     CCCCCCCCCCCCC    M           M           M\n"); }

B.

#include<stdio.h>int main(){    int x,y,z;    while(~scanf("%d%d%d",&x,&y,&z))    {        printf("%d\n",x+y-z);    }}

C.

#include<stdio.h>#include<string.h>int num[10004];int main(){    int n,m;    while(scanf("%d%d",&n,&m)==2)    {        memset(num,0,sizeof(num));        int x;        for(int i=1;i<=m;i++)        {            scanf("%d",&x);            num[x]+=1;        }        for(int i=1;i<=n;i++)        {            printf("%d\n",num[i]);        }    }}

D.

#include<stdio.h>#include<string.h>int num[10004];int main(){    int n;    while(scanf("%d",&n)==1)    {        printf("JojoV5");        for(int i=1;i<=n;i++)        {            printf("!");        }        printf("\n");    }}

E.

#include<stdio.h>main(){    int L,p,pos1,a1,pos2,a2;    while(~scanf("%d%d%d%d%d%d",&L,&p,&pos1,&a1,&pos2,&a2))    {        if(p>=L)            printf("0\n");        else if((p>=pos1&&p+a1>=L&&p<L)||(p>=pos2&&p<L&&p+a2>=L)||(p>=pos2&&p+a2>=L&&p<L)||(p>=pos1&&p<L&&p+a1>=L))            printf("1\n");        else if((p>=pos1&&p+a1<L&&p<L&&a1+p>=pos2&&a1+a2+p>=L)||(p>=pos2&&p+a2<L&&p<L&&a2+p>=pos1&&a1+a2+p>=L))            printf("2\n");        else            printf("TAT\n");    }    return 0;}

F.

#include<stdio.h>#include<string.h>using namespace std;char s[1005][1005];int main(){    int n,m;    while(scanf("%d%d",&n,&m)==2)    {        for(int i=1; i<=n; i++)        {            scanf("%s",s[i]+1);        }        int Flag=0;        for(int i=1; i<=n; i++)        {            for(int j=1; j<=m; j++)            {                if(s[i][j]=='O')                {                    int k=0;                    while(j+k<=m&&s[i][j+k]=='O')                        k++;                    if(k>=5)                    {                        Flag=1;                    }                }            }        }        if(Flag)printf("Yes\n");        else printf("No\n");    }}

G.

#include<stdio.h>int main(){    int T;    scanf("%d",&T);    while(T--)    {        int n,m,x;        scanf("%d%d",&n,&m);        int sum=0;        for(int i=1;i<=n;i++)        {            scanf("%d",&x);            sum+=x;        }        printf("%d %d\n",sum/m,sum%m);    }}

H.

#include<stdio.h>int main(){    int n,s,k,v1,v2,v3;    while(~scanf("%d%d%d%d%d%d",&n,&s,&k,&v1,&v2,&v3))    {        double t = n*1.0/v3;        double len = t*(v1+v2);        double T = (s-len)/k;        printf("%d\n",(int)(t-T));    }}

I.

#include<stdio.h>#include<algorithm>using namespace std;int a[104];int main(){    int n;    while(scanf("%d",&n)==1)    {        for(int i=0;i<n;i++)        {            scanf("%d",&a[i]);        }        sort(a,a+n);        int res=0;        for(int i=0;i<n;i++)            for(int j=i+1;j<n;j++)            for(int k=j+1;k<n;k++)        {            if(a[i]+a[j]<=a[k])continue;            else res=max(res,a[i]+a[j]+a[k]);        }        if(res==0)            printf("T_T\n");        else        printf("%d\n",res);    }}

J.

#include<stdio.h>#include<string.h>using namespace std;char s1[1005],s2[1005];int main(){    int T;    scanf("%d",&T);    while(T--)    {        scanf("%s%s",s1,s2);        int len1=strlen(s1);        for(int i=0;i<len1;i++)        {            if(s1[i]==s2[i])                s1[i]='0';            else s1[i]='1';        }        printf("%s\n",s1);    }}