C / C++ / MFC

Adam works in the in networking security cell. He wants to generate secret keys
following a pattern. The pattern consists of the characters X and Y.
where X means increasing and Y means decreasing. Help him devise an
algorithm to generate the secret key which is the minimum number encoded
following that pattern. Digits from 1-9 and digits can’t repeat.

Sample Input:                                   Sample Output:

X                                                   12
YXYX                                             21435
YYXYYXXY                                    321654798

Graphics graphics(pDC->GetSafeHdc());
	Image myPNG(path);
	if(myPNG.GetLastStatus()!=Ok)
	{
		return FALSE;
	}
 Gdiplus::Status stat;
	stat =  graphics.DrawImage(&myPNG, (INT)image_rect.left, (INT)image_rect.top, 300, 300);
	return TRUE;

Write a simple expression evaluator that takes a string like the following as input: 1+2*(3+4).
-Only integers need to be supported
-The following operators should be supported: +, -, *.
-Expressions within parenthesis should be evaluated first.
-Then the resulting expressions should be evaluated from left to right (no operator precedence)
-Example:
4+(4-(2*3)+1)+4 = 7

The code should be written in such a way to support additional operators.

Assume the existence of a function tokenise, which could take a string and return an array of strings, for instance

tokenise(‘1+(2*3)+4’) would return [‘1’,’+’,’(‘,’2’,’*’,’3’,’)’,’+’,’4’]

and the functions isNumber and asNumber which would return a Boolean and integer respectively on a single string input.