|  | 
|  | 
| | How to do without palindromic tree???Using long long hashes, any ideas?Using long long hashes, any ideas?What is test 2? I may be wrong but it might be something like this.
 for (int i = 0; i < 1 << 16; i++)
 cout << (char)('a' + __builtin_popcount(i) % 2);
 
 Edited by author 15.04.2015 18:12
 
 Edited by author 20.11.2014 20:26
 | 
 | 
|