二进制

/*http://poj.org/problem?id=2013*/

问题描述：重新输出字符串组，两端最短，中间 最长
#include <iostream>
#include <cstdio>
#include <string>

using namespace std;

const int MAXM = 25 + 1;
const int MAXN = 15;

int main()
{
 int t = 0;
 int N;
 char names[MAXN][MAXM];
 while (scanf("%d", &N) && N)
 {
  int top = 0, bottom = N - 1;
  for (int i = 0; i < N; ++i)
  {
   if (i & 1)
   {
    scanf("%s", &names[bottom]);
    bottom--;  
   }
   else
   {
    scanf("%s", &names[top]);
    top++;
   }
  }
  printf("SET %d\n", t + 1);
  for (int i = 0; i < N; ++i)
  {
   printf("%s\n", names[i]);
  }

  t++;
 }

 return 0;
}

转载于:https://www.cnblogs.com/unknownname/p/8520819.html