2012 MultiUniversity Training Contest 6

Problem 1001  HDU4350 Card

代码：

 1 #include <iostream>

 2 #include <cstring>

 3 #include <cstdio>

 4 using namespace std;

 5 int main()

 6 {

 7     int a,t,i,n,m,k,num,cas=0;

 8     int b[53],c[101];

 9     scanf("%d",&t);

     while(t--)

     {

         cas++;

         num=0;

         a=1;

         for(i=1;i<=52;i++)

             scanf("%d",&b[i]);

         scanf("%d%d%d",&n,&m,&k);    

         while(a!=1||!num)

         {

             a=(a+k-m+1)%k;

             if(a==0)

                 a=k;

             c[++num]=a;

         }

         printf("Case #%d: ",cas);

         n%=num;

         if(!n)

         {

             printf("%d",b[1]);

             for(i=2;i<=52;i++)

                 printf(" %d",b[i]);

         }

         else

         {

             int pos=k-c[n]+2;

             printf("%d",b[pos]);

             for(i=pos+1;i<=k;i++)

                 printf(" %d",b[i]);

             for(i=1;i<pos;i++)

                 printf(" %d",b[i]);

             for(i=k+1;i<=52;i++)

                 printf(" %d",b[i]);

         }

         puts("");

     }

     return 0;

 }

Problem 1006  HDU4355 Party All the Time

三分查找模版

代码： 

 1 #include <iostream>

 2 #include <cstring>

 3 #include <cstdio>

 4 #include <cmath>

 5 const int N=50001;

 6 struct node

 7 {

 8     double x;

 9     double w;

 }p[N];

 int n;

 double getsum(double mid)

 {

     int i;

     double s,sum=0.00;

     for(i=0;i<n;i++)

     {

         s=fabs(p[i].x-mid);

         sum+=s*s*s*p[i].w;

     }

     return sum;

 }

 int main()

 {

     int t,i,k=0;

     double min,max,start,end,mid1,mid2,a1,a2,a3,a4;

     scanf("%d",&t);

     while(t--)

     {

         k++;

         scanf("%d",&n);

         for(i=0;i<n;i++)

         {

             scanf("%lf%lf",&p[i].x,&p[i].w);

             if(!i)

                 max=min=p[i].x;

             if(max<p[i].x)

                 max=p[i].x;

             if(min>p[i].x)

                 min=p[i].x;

         }

         start=min;

         end=max;

         while(start+0.000001<end)

         {

             mid1=(start+end)/2;

             mid2=(end +mid1)/2;

             a1=getsum(start);

             a2=getsum(end);

             a3=getsum(mid1);

             a4=getsum(mid2);

             if(a3<=a4)

                 end=mid2;

             else

                 start=mid1;

         }

         min=getsum(start);

         printf("Case #%d: %I64d\n",k,(long long)(min+0.5));

     }

     return 0;

 }

Problem 1008  HDU4357 String Change 

代码：

 1 #include <algorithm>

 2 #include <iostream>

 3 #include <cstring>

 4 #include <cstdio>

 5 using namespace std;

 6 const int N=101;

 7 char s1[N];

 8 char s2[N];

 9 int main()

 {

     int t,i,k=0,sum1,sum2;

     scanf("%d",&t);

     while(t--)

     {

         k++;

         sum1=sum2=0;

         scanf("%s%s",s1,s2);

         int flag=0;

         if(strlen(s1)==2)

         {

             for(i=0;i<26;i++)

             {

                 if(s1[0]++=='z')

                     s1[0]='a';

                 if(s1[1]++=='z')

                     s1[1]='a';

                 swap(s1[0],s1[1]);

                 if(!strcmp(s1,s2))

                 {

                     flag=1;

                     break;

                 }

             }

         }

         else

         {

             for(i=0;i<strlen(s1);i++)

             {

                 sum1+=(s1[i]-'a');

                 sum2+=(s2[i]-'a');

             }

             if(!((sum2-sum1)&1))

                 flag=1;

         }

         printf("Case #%d: ",k);

         if(flag)

             puts("YES");

         else

             puts("NO");

     }

     return 0;

 }

附：

官方题解： 

 

 

 

 

 

 

 、