Anny not null number may be represented with the Polish Notation ( Postfixed )Code:#include <string> #include <iostream> #include <conio.h> using namespace std; int main() { string name("HEEEELLLLPPPPP"); cout << name[7]; getch(); }

, on those " numbers" {1, 2, 3 , .... , 10 } and operator * and +.

Example , one of the representation of numer 13 is 8 5 + and other is 2 + 2 * 2 * 1 +.

Longness of an representation includes all the caracters , inclusive spaces above any numer or operator , unless the final one.

We say :

Canonical representation ( the mos shortest representation described above . If exists more representations , then the shortes canonical representation is the

shotest ( in lexicografhical mean ) .

Describe an alghoritm for a nut null given number > 0 and returs his canonical

representation in the system described above and calculate his complexity.