Cod sursa(job #2433734)

Utilizator ViAlexVisan Alexandru ViAlex Data 28 iunie 2019 19:45:47
Problema ADN Scor 30
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.7 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("adn.in");
ofstream out("adn.out");


string string_list[30];
int numberofstrings=0;

void read()
{
    in>>numberofstrings;
    for(int i=0; i<numberofstrings; i++)
    {
        in>>string_list[i];
    }

}


string gen_random(const int len)
{
    string str;
    static const char alphanum[] =
        "abcdefghijklmnopqrstuvwxyz";

    for (int i = 0; i < len; ++i)
    {
        str+= alphanum[rand() % (sizeof(alphanum) - 1)];
    }

    return str;
}

string merge_strings(string a,string b)
{
    int cursor=0;
    int to_cut=0;
    for(int i=0; i<a.length(); i++)
    {


        if(a[i]==b[cursor])
        {
            cursor++;
        }
        else
        {
            cursor=0;
            if(a[i]==b[0])
                cursor++;
        }

        if(i==a.length()-1)
        {
            to_cut=cursor;
        }

        if(cursor==b.length())
        {
            cursor=0;
            if(a[i]==b[0])
                cursor++;
        }
    }
    string substring=a.substr(0,a.length()-to_cut);
    substring+=b;
    return substring;

}

bool used[30] {false};
string minimum_string="";

void backtrack(int depth,string to_merge)
{
    if(depth==numberofstrings)
    {
        if(to_merge.length()<minimum_string.length() || minimum_string=="")
            minimum_string=to_merge;
        return;
    }


    for(int i=0; i<numberofstrings; i++)
    {
        if(!used[i])
        {
            used[i]=true;
            backtrack(depth+1,merge_strings(to_merge,string_list[i]));
            used[i]=false;
        }
    }


}

int main()
{
    cout<<merge_strings("test","te");
    read();
    backtrack(0,"");
    out<<minimum_string;

}