Zont

Hello comunity. I'm somwhat new in computer science and maths algorithm, in a problem in which i am working i have been told that using greedy would be shorter and that it should work well. But i don't know specifically what or how i should use a greedy algorithm. I'm working in an ACM-ICPC 2013 problem, to be more specific the problem I-Inverting Huffman. https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=615&page=show_problem&problem=4544

Hello, everyone I am Manrolo classmate and partner working in the same problem, although i thanks fiveworlds, because the code was helpfull to understand in a better way the static huffman algorithm, we were looking for a way in how to work with the problem. The problem which is looking for the shortest "word" that we con form with the lenghts given by a static huffman binary tree. We began working using thinking that creating an empty binary tree and then filling it would be the best way to work our way in the problem, but we came to know that i may be possible to do this problem using a greedy algorithm, which regretably we don't know how to use, if there is someone who can point us a direction it would be incredible helpfull. Thanks.