poj 3007 & poj 3096

两道题目都是很简单的题目，训练计划里这两道题目是说用c++标准模板做的。好吧，我承认我对c++标准模板库函数一无所知。不过看别人说的，如果数据量够大的话，用模板还是很好的，但是如果数据量不是那么大，用模板好像总是比自己写的慢。

3007 http://poj.org/problem?id=3007 今天早上做的时候，去网上搜了一下set怎么用，然后写出代码了，但是果断TLE，看网上的标程好像很多是用hash做的，上午准备用暴搜，可是有点困，没写出来，刚刚用暴搜做了一下，235ms，估计是后台数据不强吧，要不肯定要挂掉的

题意就是：给你一段字符串，重任意位置切开，成两端，再把这两段分别逆序，这样就可以得到四段，然后这四段组合，看一共能组合出多少种不同的字符串

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define N 10000
#define M 80

using namespace std;

char sn[4][M],zs[N][M];
char str[M],zh[8][M];
int n,cnt;
void find(int x,int len)
{
    int i,j,h;
    for(i = x,h = 0; i >= 0; i--,h++)
    sn[1][h] = str[i];
    sn[1][h] = '\0';
    for(i = len - 1,h = 0; i > x; i--,h++)
    sn[3][h] = str[i];
    sn[3][h] = '\0';
    int len1,len2,temp,kemp;
    len1 = strlen(sn[0]),len2 = strlen(sn[2]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[0][temp ++] = sn[0][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[0][temp ++] = sn[2][kemp ++];
    }

    len1 = strlen(sn[0]),len2 = strlen(sn[3]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[1][temp ++] = sn[0][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[1][temp ++] = sn[3][kemp ++];
    }

    len1 = strlen(sn[1]),len2 = strlen(sn[2]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[2][temp ++] = sn[1][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[2][temp ++] = sn[2][kemp ++];
    }

    len1 = strlen(sn[1]),len2 = strlen(sn[3]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[3][temp ++] = sn[1][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[3][temp ++] = sn[3][kemp ++];
    }

    len1 = strlen(sn[2]),len2 = strlen(sn[0]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[4][temp ++] = sn[2][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[4][temp ++] = sn[0][kemp ++];
    }

    len1 = strlen(sn[2]),len2 = strlen(sn[1]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[5][temp ++] = sn[2][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[5][temp ++] = sn[1][kemp ++];
    }

    len1 = strlen(sn[3]),len2 = strlen(sn[0]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[6][temp ++] = sn[3][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[6][temp ++] = sn[0][kemp ++];
    }

    len1 = strlen(sn[3]),len2 = strlen(sn[1]);
    temp = kemp = 0;
    while(kemp < len1)
    {
        zh[7][temp ++] = sn[3][kemp ++];
    }
    kemp = 0;
    while(kemp < len2)
    {
        zh[7][temp ++] = sn[1][kemp ++];
    }
    for(i = 0; i < 8; i++)
    {
        for(j = 0; j < cnt; j++)
        if(!strcmp(zs[j],zh[i])) break;
        if(j == cnt) strcpy(zs[cnt++],zh[i]);
    }
}
int main()
{
    int i,j,k,h;
    //freopen("data.txt","r",stdin);
    while(cin>>n)
    {
        for(i = 0; i < n; i++)
        {
            memset(zs,0,sizeof(zs));
            cnt = 0;
            cin>>str;
            int len = strlen(str);
            for(j = 0; j < len; j++)
            {
                memset(sn,0,sizeof(sn));
                memset(zh,0,sizeof(zh));
                for(k = 0; k <= j; k++)
                sn[0][k] = str[k];
                sn[0][k] = '\0';
                for(k = j + 1,h = 0; k < len; k++,h++)
                sn[2][h] = str[k];
                sn[2][h] = '\0';
                find(j,len);
            }
            cout<<cnt<<endl;
        }
    }
    return 0;
}

同样是暴搜的，不过也用set做了一下

http://poj.org/problem?id=3096 

题意就不说了，仔细读题都能读懂，也没有任何注意的地方

暴搜代码 和set代码

#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string.h>
#define N 80

using namespace std;

char str[N],sbr[N][3];
int find(int x,int len)
{
    int i,k,j,h;
    j = 0;
    for(i = 0; i + x < len; i++)
    {
        sbr[j][0] = str[i];
        sbr[j][1] = str[i + x];
        sbr[j][2] = '\0';
        j++;
    }
    /*for(i = 0; i < j; i++)
    cout<<sbr[i]<<" ";
    cout<<endl;*/
    int flag = 0;
    for(i = 0; i < j; i++)
    {
        for(k = i + 1; k < j; k++)
        if(!strcmp(sbr[i],sbr[k]))
        {
            flag = 1;break;
        }
    }
    if(flag) return 0;
    else return 1;
}
int main()
{
    int i;
    int len;
    //freopen("data.txt","r",stdin);
    while(cin>>str,strcmp(str,"*"))
    {
        len = strlen(str);
        int mark = 0;
        for(i = 0; i < len; i++)
        {
            if(!find(i + 1,len))
            {
                mark = 1;break;
            }
        }
        if(!mark) printf("%s is surprising.\n",str);
        else printf("%s is NOT surprising.\n",str);
    }
    return 0;
}

#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <set>
#include <string>
#define N 80

using namespace std;

int main()
{
    int i,j;
    string str;
    //freopen("data.txt","r",stdin);
    while(cin>>str,str != "*")
    {
        string sbr;
        set<string>scr;
        int flag = 0;
        for(i = 1; i < str.size(); i++)
        {
            scr.clear();
            for(j = 0; j + i < str.size(); j++)
            {
                sbr.clear();
                sbr += str[j];
                sbr += str[j + i];
                scr.insert(sbr);
            }
            if(scr.size() != str.size() - i)
            {
                flag = 1;
                break;
            }
        }
        if(!flag) cout<<str<<" is surprising.\n";//printf("%s is surprising.\n",str);
        else cout<<str<<" is NOT surprising.\n";//else printf("%s is NOT surprising.\n",str);
    }
    return 0;
}