HDU 2013 2014 2015 2016

把之前两天没写的今天补上来了，继续加油。

HDU 2013

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2013
 *       蟠桃记
 *       Date  : 2015/4/27
----------------------------------------------------------------------------*/
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

int calculate(int n){
    if(n == 1){
        return 1;
    }
    return (calculate(n-1) + 1) * 2;
}
int main()
{
  int a,sum = 0;
  while(scanf("%d",&a) != EOF){
      sum=calculate(a);
      printf("%d\n",sum);
      sum = 0;
  }
  system("Pause");
  return 0;
}

HDU 2014

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2014
 *       青年歌手大奖赛_评委会打分 
 *       Date  : 2015/4/27
----------------------------------------------------------------------------*/
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;
int a[100] = {0};
int main()
{
  int n,temp;
  double sum;
  while(scanf("%d",&n) !=EOF && n > 2 && n <= 100 ){
      for(int i =0; i < n; ++i){
          scanf("%d",&a[i]);
      }
      for(int j = 0; j < n-1; ++j){
          for(int i = 0; i < n-1-j; ++i){
              if(a[i] > a[i+1]){
                  temp = a[i];
                  a[i] = a[i+1];
                  a[i+1] =temp;
              }
          }
      }
      for(int i = 1; i < n-1; ++i){
          sum += a[i];
      }
      printf("%.2lf\n", sum/(n-2));
      sum = 0;
  }
  system("Pause");
  return 0;
}

HDU 2015

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2015
 *       偶数求和
 *       Date  : 2015/4/27
----------------------------------------------------------------------------*/
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;
int a[102] = {0};
int main()
{
  int n,m,sum = 0,index = 0;
  while(scanf("%d%d",&n,&m) != EOF && n <= 100 && n>=0 && m >=0){
      for(int i = 0; i < n; ++i){
          a[i]=2*(i+1);
      }
      for(int i =0; i < n; ++i){
          sum += a[i];
          ++index;
          if(index == m){
               printf("%d", sum/m);
               if(i != n-1) printf(" ");
               sum = 0;
               index = 0;
               if( i == n-1){
                   printf("\n");
               }
               continue;
          }
          else if(i == n-1){
              if(index != m){
                  printf("%d\n",sum/index);
              }
          }
                
      } 
      sum =0;  
      index = 0;
  } 
  system("Pause");
  return 0;
}

HDU 2016

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2016
 *       数据的交换输出 
 *       Date  : 2015/4/28
----------------------------------------------------------------------------*/
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;
int a[100] = {0};
int b[100] = {0};
int main()
{ 
  int n,temp,index = 0;
  while(scanf("%d",&n) != EOF && n < 100){
      if(n == 0) continue;
      for(int i = 0;i < n; ++i){
          scanf("%d",&a[i]);
          b[i] = a[i]; 
      }
      for(int j = 0; j < n-1; ++j){
          for(int i = 0; i < n-1-j; ++i){
              if(a[i] < a[i+1]){
                  temp = a[i];
                  a[i] = a[i+1];
                  a[i+1] = temp;
              }
          }
      }
      for(int i = 0; i < n; ++i ){
           if(b[i] == a[n-1]){
             index = i ;
             break;
           } 
      }
      temp = b[0];
      b[0] = b[index];
      b[index] = temp;
      index = 0;
      for(int i = 0; i < n; ++i ){
          printf("%d",b[i]);
          if(i != n-1 ) printf(" ");
          else printf("\n");
      }
  }
  system("Pause");
  return 0;
}