字符串处理 百度之星资格赛 1002 列变位法解密

题目传送门

/*
    字符串处理：要求解码，然而二维数组开不下，可以直接输出
    只要在余数的地方判断一下就行了，vector的效率不高
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;

const int MAXM = 1e6 + 10;
const int INF = 0x3f3f3f3f;
char s[MAXM];
char ans[MAXM];

int main(void)        //百度之星资格赛 1002 列变位法解密
{
    int n, m, k, cas = 0;
    int T;
    scanf ("%d", &T);    getchar ();
    while (T--)
    {
        gets (s);
        scanf ("%d", &m);
        int len = strlen (s);
        n = len / m;
        k = len % m;

        printf ("Case #%d:
", ++cas);
        int i = 0, j, l = 0, cnt;
        while (i < len)
        {
            j = i;    cnt = 0;
            while (j < len)
            {
                printf ("%c", s[j]);    ++l;
                if (cnt < k)    {j += (n + 1); ++cnt;}
                else    j += n;
                if (l == len)    break;
            }
            ++i;    if (l == len)    break;
        }

        puts ("");    getchar ();
    }

    return 0;
}


/*
4
159263748
4
Hw doeetrrlloellc adoomm!,my  e w
7
Toodming is best
16
sokaisan
1
*/

/*
    800多MS
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
using namespace std;

const int MAXM = 1e5 + 10;
const int INF = 0x3f3f3f3f;
char s[MAXM];
vector<char> ss[MAXM];

int main(void)        //百度之星资格赛 1002 列变位法解密
{
    int n, m, k, cas = 0;
    int T;
    scanf ("%d", &T);    getchar ();
    while (T--)
    {
        gets (s);
        //getline (cin, s);
        scanf ("%d", &m);
        int len = strlen (s);
        n = len / m;
        k = len % m;

        for (int i=0; i<=len; ++i)    ss[i].clear ();

        int l = 0;    int t = k;
        for (int j=0; j<m; ++j)
        {
            for (int i=0; i<n; ++i)
            {
                ss[i].push_back (s[l++]);
                //ans[i][j] = s[l++];
            }
            if (t > 0)    ss[n].push_back (s[l++]);
            t--;
        }

        printf ("Case #%d:
", ++cas);
        for (int i=0; i<n; ++i)
        {
            for (int j=0; j<m; ++j)
            {
                cout << ss[i][j];
                //printf ("%c", ans[i][j]);
            }
        }
        for (int i=0; i<k; ++i)
            cout << ss[n][i];
            //printf ("%c", ans[n][i]);
        puts ("");    getchar ();
    }

    return 0;
}


/*
4
159263748
4
Hw doeetrrlloellc adoomm!,my  e w
7
Toodming is best
16
sokaisan
1
*/