百练+单词的矩阵颠倒+简单模拟一下就好

点击打开链接

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string.h>
#include<cstring>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<map>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
int n=0,r=0;
string s;
char Arr[105][22];
int main()
{
    int num=0,i=1,j=0;
    cin>>n;
    cin>>s;
    int len=s.length();
    r=len/n;
    while(num<len){
        while(j+1<=n&&num+1<=len){
            j++;
            Arr[i][j]=s[num];
            num++;
        }
        i++;
        while(j>0&&num+1<=len){
            Arr[i][j]=s[num];
            j--;  num++;
        }
        i++;
    }
    for(j=1;j<=n;j++){
        for(i=1;i<=r;i++){
          cout<<Arr[i][j];
        }
    }
    cout<<endl;
	return 0;
}