/************************************************************************* 
  > File Name: test.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<string> 
using namespace std; 
 
void Compare(string long_str, string short_str) 
{ 
  int i,j; 
  for(i=0; i<short_str.size(); ++i) 
  { 
    for(j=0; j<long_str.size(); ++j) 
    { 
      if(long_str[j] == short_str[i]) 
      { 
        break; 
      } 
    } 
    if(j == long_str.size()) 
    { 
      cout << "false" << endl; 
      return; 
    } 
  } 
  cout << "true" << endl; 
  return; 
} 
 
int main() 
{ 
  string l = "ABCDEFGHIJK"; 
  string s = "ABCDEF"; 
  Compare(l, s); 
  return 0; 
}

/************************************************************************* 
  > File Name: test1.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<bitset> 
#include<string> 
using namespace std; 
 
bool Compare(string long_str, string short_str) 
{ 
  bitset<26> flag; 
  for(int i=0; i<long_str.size(); ++i) 
  { 
    // flag.set(n)置第n位為1 
    flag.set(long_str[i]-'A'); 
  } 
  for(int i=0; i<short_str.size(); ++i) 
  { 
    // flag.test(n)判斷第n位是否為1 
    if(!flag.test(short_str[i]-'A')) 
      return false; 
  } 
  return true; 
} 
 
int main() 
{ 
  string l = "ABCDEFGHIJK"; 
  string s = "ABCDEZ"; 
  if(Compare(l, s)) 
    cout << "true" << endl; 
  else 
    cout << "false" << endl; 
  return 0; 
}

/************************************************************************* 
  > File Name: test2.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<string> 
#include<stdint.h> 
//#include<cstdint> // C++11 
using namespace std; 
 
bool Compare(string long_str, string short_str) 
{ 
  unsigned int primeNum[26] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47, 
            53,59,61,67,71,73,79,83,89,97,101}; 
  /* int64_t和uint64_t分別表示64位的有符號(hào)和無(wú)符號(hào)整形數(shù) */ 
  /* 在不同位數(shù)機(jī)器的平臺(tái)下通用，都是64位 */ 
  uint64_t ch = 1; 
   
  for(int i=0; i<long_str.size(); ++i) 
  { 
    ch = ch*primeNum[long_str[i]-'A']; 
  } 
 
  for(int i=0; i<short_str.size(); ++i) 
  { 
    if(ch%primeNum[short_str[i]-'A'] != 0) 
      return false; 
  } 
  return true; 
} 
 
int main() 
{ 
  string l = "ABCDEFGHIJK"; 
  string s = "ABCDEK"; 
  if(Compare(l, s)) 
    cout << "true" << endl; 
  else 
    cout << "false" << endl; 
  return 0; 
} 

/************************************************************************* 
  > File Name: test3.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<string> 
#include<stdint.h> 
//#include<cstdint> // C++11 
using namespace std; 
 
bool Compare(string s1, string s2) 
{ 
  unsigned int primeNum[26] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47, 
            53,59,61,67,71,73,79,83,89,97,101}; 
  uint64_t ch = 1; 
 
  for(int i=0; i<s1.size(); ++i) 
  { 
    ch = ch*primeNum[s1[i]-'a']; 
  } 
 
  for(int i=0; i<s2.size(); ++i) 
  { 
    ch = ch/primeNum[s2[i]-'a']; 
  } 
   
  if(ch == 1) 
    return true; 
  else 
    return false; 
} 
 
int main() 
{ 
  string s1 = "abandon"; 
  string s2 = "banadon"; 
  if(Compare(s1, s2)) 
    cout << "They are brother words!" << endl; 
  else 
    cout << "They aren't brother words!" << endl; 
  return 0; 
} 

/************************************************************************* 
  > File Name: test4.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<algorithm> 
#include<string> 
using namespace std; 
 
// 自定義序函數(shù)（二元謂詞） 
bool myfunction(char i, char j) 
{ 
  return i > j; 
} 
 
bool Compare(string s1, string s2) 
{ 
  // 采用泛型算法對(duì)s1,s2排序，sort()采用的是快速排序算法 
  sort(s1.begin(), s1.end(), myfunction); 
  sort(s2.begin(), s2.end(), myfunction); 
  if(!s1.compare(s2)) // 相等返回0 
    return true; 
  else 
    return false; 
} 
 
int main() 
{ 
  string s1 = "abandon"; 
  string s2 = "banadon"; 
  if(Compare(s1, s2)) 
    cout << "They are brother words!" << endl; 
  else 
    cout << "They aren't brother words!" << endl; 
  return 0; 
} 

/************************************************************************* 
  > File Name: test5.cpp 
  > Author: SongLee 
 ************************************************************************/ 
#include<iostream> 
#include<fstream>  // file I/O 
#include<map>    // map 
#include<string>   // string 
#include<algorithm> // sort 
using namespace std; 
/* 
 *map是C++中的關(guān)聯(lián)容器 
 *   按關(guān)鍵字有序 
 *   關(guān)鍵字不可重復(fù) 
 */ 
map<string, string> word; 
 
/* 自定義比較函數(shù)（用于排序） */ 
bool myfunction(char i, char j) 
{ 
  return i < j; 
} 
 
/* 
 *對(duì)每個(gè)單詞排序 
 *排序后字符串作為關(guān)鍵字，原單詞作為值 
 *存入map中 
 */ 
void sign_sort(const char* dic) 
{ 
  // 文件流 
  ifstream in(dic); 
  if(!in) 
  { 
    cout << "Couldn't open file: " + string(dic) << endl; 
    return; 
  } 
 
  string aword; 
  string asign; 
  while(in >> aword) 
  { 
    asign = aword; 
    sort(asign.begin(), asign.end(), myfunction); 
    // 若標(biāo)識(shí)不存在，創(chuàng)建一個(gè)新map元素，若存在，加在值后面 
    word[asign] += aword + " "; 
  } 
  in.close(); 
} 
 
/* 
 *寫(xiě)入輸出文件 
 */ 
void write_file(const char* file) 
{ 
  ofstream out(file); 
  if(!out) 
  { 
    cout << "Couldn't create file: " + string(file) << endl; 
    return; 
  } 
   
  map<string, string>::iterator begin = word.begin(); 
  map<string, string>::iterator end = word.end(); 
  while(begin != end) 
  { 
    out << begin->second << "\n"; 
    ++begin; 
  } 
  out.close(); 
} 
 
int main() 
{ 
  string dic;  
  string outfile; 
 
  cout << "Please input dictionary name: "; 
  cin >> dic; 
  cout << "Please input output filename: "; 
  cin >> outfile; 
 
  sign_sort(dic.c_str()); 
  write_file(outfile.c_str()); 
 
  return 0; 
}