锘??xml version="1.0" encoding="utf-8" standalone="yes"?>99精品国产在热久久无毒不卡,伊人久久大香线蕉av不卡,浪潮AV色综合久久天堂http://www.shnenglu.com/lvlawliet/category/17991.htmlVIMzh-cnWed, 26 Oct 2011 02:25:30 GMTWed, 26 Oct 2011 02:25:30 GMT60JOJ1037錛歄perandhttp://www.shnenglu.com/lvlawliet/archive/2011/10/25/159078.htmlLLawlietLLawlietTue, 25 Oct 2011 11:53:00 GMThttp://www.shnenglu.com/lvlawliet/archive/2011/10/25/159078.htmlhttp://www.shnenglu.com/lvlawliet/comments/159078.htmlhttp://www.shnenglu.com/lvlawliet/archive/2011/10/25/159078.html#Feedback0http://www.shnenglu.com/lvlawliet/comments/commentRss/159078.htmlhttp://www.shnenglu.com/lvlawliet/services/trackbacks/159078.html

Professor Maple teaches mathematics in a university. He have invented a function for the purpose of obtaining the operands from an expression. The function named op(i,e) can be described as follows: The expression e may be divided into sub-expression(s) by the operator, which has the lowest priority in the expression. For example, the expression “a*b+b*c+c*d” should be divided into three sub-expressions “a*b”, “b*c” and “c*d”, because the operator “+” has the lowest priority. The purpose of this function is to extract the ith sub-expression as the result. So, in the example above, op(2,e)=b*c.

If we regard the sub-expression as the main expression, it might be divided again and again. Obviously, the dividing process is recursive. As you see, the following example is much more complex:

Let p:=a^b*c+(d*c)^f*z+b
op(1,op(1,op(2,p)))=(d*c)
op(1,op(1,op(1,op(2,p))))=d*c
op(2,op(2,p))=z
op(3,p)=b
op(1,op(3,p))=b

Professor Maple is so lazy that he would leave the work to computer rather than do it himself, when the expression is long and complicated. Of course, without your program, the computer won’t work out the result automatically.

Input

The input file contains several test cases. The last test case in the input file is followed by a line containing a symbol “*”, indicating the end of the input data. Each test case consists of two parts. The first part describes the expression, while the second part contains several questions, which should be calculated according to the expression.

The first line of each test case contains an expression consists of the expression name, “:=” and the content of the expression. The expression name is a lowercase. And the content is composed by lowercases and operators “+”, “(”, “)”, “*” and “^”. For example, here is a valid expression, p:=a^b*c+(d*c)^f*z+b. Among those operators, “(” and “)” have the highest priority. The operator “^” has a lower priority, and then “*”. The priority of the operator “+” is the lowest.

The second line of each test case contains an integer n indicating n questions based on the above expression. This is followed by n lines. Each of them contains the description of one question, which consists of integers. For example, the question with three integers “2 1 1” describes the function op(1,op(1,op(2,e))). To compute this function, we have to keep to the following sequence: First, according to the first integer 2, divide the expression and extract the 2nd sub-expression. Then, according to the second integer 1, divide the sub-expression and extract the 1st one. Finally, according to the third integer 1, divide the outcome again, and extract the result.

Output

For each test case, display the expression name and a colon on the first line. Then display the result of each question on a line. The layout of the output is shown in the sample output.

You may assume that all expressions and functions are always valid.

Display a blank line between test cases.

Sample Input

p:=a^b*c+(d*c)^f*z+b 
4
2 1 1
2 2
3
3 1
a:=(x+y)
3
1
1 2
1 2 1
*

Sample Output

Expression p: 
op(1,op(1,op(2,p)))=(d*c)
op(2,op(2,p))=z
op(3,p)=b
op(1,op(3,p))=b

Expression a:
op(1,a)=x+y
op(2,op(1,a))=y
op(1,op(2,op(1,a)))=y


妯℃嫙棰橈紝澶勭悊濂藉師瀛楃涓茬殑浼樺厛綰у氨琛屼簡銆?br />浠g爜錛?br />
#include <iostream>
#include 
<cstring>
#include 
<cstdio>
using namespace std;

int find(char c)
{
    
if (c == '(' || c == ')'return 4;
    
if (c == '^'return 3;
    
if (c == '*'return 2;
    
if (c == '+'return 1;
    
return 1000;
}

char s[101];
string e;
int n, i, j, k, p[101], r[101], v[101], head, tail, x, ri, d = 0;

int main()
{
    
while (scanf("%s", s), s[0!= '*')
    {
        
if (d++) puts("");
        head 
= 0;
        e 
= "";
        
while (s[head] != ':')
          e 
+= s[head++];
        head 
+= 2;
        printf(
"Expression %s:\n", e.c_str());
        tail 
= strlen(s) - 1;
        x 
= 0;
        
for (i = head; i <= tail; ++i)
        {
            
if (s[i] == ')') x -= 4;
            v[i] 
= find(s[i]) + x;
            
if (s[i] == '(') x += 4;
        }
        scanf(
"%d\n"&k);
        
for (i = 0; i < k; ++i)
        {
            ri 
= 0;
            
int head1 = 3, min1, t;
            tail 
= strlen(s);
            
char c;
            
while ((c = getchar()) != '\n')
            {
                cin.putback(c);
                scanf(
"%d"&n);
                r[ri
++= n;
                min1 
= 1000;
                
for (j = head1; j < tail; ++j)
                  
if (v[j] < min1) min1 = v[j];
                
if (s[head1] == '(' && s[tail - 1== ')' && min1 == v[head1])
                {
                    head1
++;
                    tail
--;
                }
                
else
                  
if (head1 + 1 == tail){}
                
else
                {
                    p[
0= head1 - 1;
                    
for (j = head1, t = 1; j < tail; ++j)
                      
if (v[j] == min1)
                      {
                          p[t
++= j;
                      }
                    p[t] 
= tail;
                    head1 
= p[n - 1+ 1;
                    tail 
= p[n];
                }
            }
            
for (j = ri - 1; j >= 0--j)
              printf(
"op(%d,", r[j]);
            printf(
"%s", e.c_str());
            
for (j = 0; j < ri; ++j)
              printf(
")");
            printf(
"=");
            
for (j = head1; j < tail; ++j)
                printf(
"%c", s[j]);
            puts(
"");
        }
    }
    
return 0;
}


LLawliet 2011-10-25 19:53 鍙戣〃璇勮
]]>
综合人妻久久一区二区精品| 999久久久免费精品国产| 久久久久久国产精品免费免费| 久久精品国产只有精品66| 亚洲女久久久噜噜噜熟女| 99精品久久久久久久婷婷| 久久精品成人欧美大片| 久久精品国产免费| 三级三级久久三级久久| 99久久国产免费福利| 久久精品无码一区二区无码| 国内精品久久久久久久涩爱| 久久亚洲精精品中文字幕| 欧美精品福利视频一区二区三区久久久精品 | 伊人色综合久久天天网| 久久99热精品| 久久九九精品99国产精品| 日韩中文久久| 青春久久| 亚州日韩精品专区久久久| 777久久精品一区二区三区无码| 日日躁夜夜躁狠狠久久AV| 最新久久免费视频| 日日狠狠久久偷偷色综合免费 | 777午夜精品久久av蜜臀| 欧美精品福利视频一区二区三区久久久精品| 久久久久亚洲精品无码蜜桃| 亚洲欧洲中文日韩久久AV乱码| 久久国产影院| 久久亚洲精品无码播放| 国产成人99久久亚洲综合精品| 久久99精品国产| 久久婷婷综合中文字幕| 99久久超碰中文字幕伊人| 久久国产精品99国产精| 99久久超碰中文字幕伊人| 国产精品久久久天天影视| 婷婷综合久久中文字幕| 精品久久国产一区二区三区香蕉| 伊人色综合久久| 久久国产精品二国产精品|