Хаффман

code.clear();
}
}
return out;
}
string er (string x, int n) {
x.erase(x.begin(),x.end()-x.size()+n);
return x;
}
string strght(string s) {
while (s.size()!=5100) {
s.erase(s.begin() + s.size()-1, s.end());
}
return s;
}
int main() {
int mode;
cin >> mode;
if (!mode) {
int minsize = 1e9;
string best;
getImage();
int bestval = 0;
for (int val = 4; val <=20; val++) {
string s=basik;
while (s.size()%val!=0)
s+='0';
vector<string> strvallist;
map<string,int>often;
for (int i = 0; i < s.size(); i+=val) {
string c;
for (int j = i; j< i+val;j++)
c+=s[j];
strvallist.push_back(c);
often[c]++;
}
list<Node*> t;
map<string,int>::iterator itr;
for( itr=often.begin(); itr!=often.end(); ++itr)
{
Node *p = new Node;
p->c = itr->first;
p->a = itr->second;
t.push_back(p);
}
bool manychar = true;
if (t.size()==1)
manychar = false;
while (t.size()!=1)
{
t.sort(oversort());
Node *SonL = t.front();
t.pop_front();
Node *SonR = t.front();
t.pop_front();
Node *parent = new Node(SonL,SonR);
t.push_back(parent);

}
if (manychar){
Node *root = t.front();
build(root);
} else {
vector<bool> tempc;
tempc.push_back(0);
table[strvallist[0]] = tempc;
}
map<string, vector<bool> >::iterator it;
vector<bool>::iterator ii;
string tablecode = "";
int sizetablecode = 0;
for (it = table.begin(); it != table.end(); it++)
{
sizetablecode++;
tablecode += it->first;
string temp = "";
int kount = 0;
for (ii = table[it->first].begin(); ii != table[it->first].end(); ii++) {
int t = (*ii);
kount++;
temp += t+'0';
}
tablecode += c(kount,4);
tablecode += temp;
}

map<string, vector<bool> >::iterator iii;
map<string,int>::iterator iof = often.begin();
cout << endl << endl << val << endl;
for (iii = table.begin(); iii != table.end(); iii++) {
cout << iii->first << " : ";
vector<bool>::iterator i;
for (i = table[iii->first].begin(); i != table[iii->first].end(); i++)
cout << *i;
cout << " : " << iof->second;
iof ++;
cout << endl;
}
cout << endl << endl << endl;

tablecode = c(val,5) + c(sizetablecode,12) + tablecode;
string out = "";
for (int i = 0; i < strvallist.size(); i++)
for (int j = 0; j < table[strvallist].size(); j++)
{
out += table[strvallist][j] + '0';
}
string encodeds = out;
int siz = out.size();
map<vector<bool>, string> inverse;
for (map<string, vector<bool> >::iterator i = table.begin(); i != table.end(); i++)
inverse[i->second] = i->first;
out = dec(out, inverse);
string result = tablecode + encodeds;
table.clear();
if (result.size() < minsize) {
minsize = result.size();
best = result;
bestval = val;
}
cout << endl << val << " " << often.size() << " " << siz << " " << tablecode.size() << endl;
code.clear();
}
cout << best;
cout << endl << endl << endl << best.size() << " " << bestval << endl;
}
else {
string s;
cin >> s;
map<vector<bool>, string> vocabulary;
char sizevalstring[8];
string tempstr;
for (int i = 0; i < 5; i++) {
tempstr+= s;
}
for (int i = 0; i < 5; i++)
sizevalstring = tempstr;
int sizeval = bistrtoint(sizevalstring);
s = er(s,5);
char sizetabs[12];
for (int i = 0; i < 12; i++) {
sizetabs = s;
}
int sizetab = bistrtoint(sizetabs);
s.erase(s.begin(), s.end()-s.size() + 12 );
int j = 0;
while (j < sizetab) {
j++;
string val = "";
for (int i = 0; i < sizeval; i++)
val += s;
s = er(s, sizeval);
char keysizes[9];
for (int i = 0; i < 4; i++) {
keysizes = s;
}
int keysize = bistrtoint(keysizes);
s = er(s,4);
string key = "";
for (int i = 0; i < keysize; i++)
key+=s;
s = er(s,keysize);
vector<bool> cod;
for (int i = 0; i < key.size();i++){
cod.push_back(key-'0');
}
vocabulary[cod] = val;
}
s = dec(s, vocabulary);
int k = 1;
s = strght(s);
printImage(s);
}
return 0;
}