zoukankan      html  css  js  c++  java
  • csu 1537: Miscalculation(栈)

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    #include<stack>
    using namespace std;
    char str[20];
    int main()
    {
        int n;
        int len,ans;
        int s1,s2;
        int i,j,k;
        while(scanf("%s",str)!=EOF)
        {
            s1=0;s2=0;
            scanf("%d",&ans);
            stack<int> q;
            len=strlen(str);
            for(i=0;i<len;i++)
            {
                if(i%2==0)
                {
                    q.push(str[i]-'0');
                }
                else
                {
                    if(str[i]=='*')
                    {
                        i++;
                        int temp=q.top();
                        q.pop();
                        temp=temp*(str[i]-'0');
                        q.push(temp);
                    }
                }
            }
            while(!q.empty())
            {
                s1+=q.top();
                q.pop();
            }
            //if(q.empty()) printf("dddddddd
    ");
            for(i=0;i<len;i++)
            {
               if(i%2==0)
                {
                    s2+=(str[i]-'0');
                }
                else
                {
                    if(str[i]=='*')
                    {
                        i++;
                        s2*=(str[i]-'0');
                    }
                }
            }
            //printf("dddddd
    ");
            if(s1==ans&&s1!=s2) printf("M
    ");
            else if(s2==ans&&s1!=s2) printf("L
    ");
            else if(s1==ans&&s1==s2) printf("U
    ");
            else printf("I
    ");
     
        }
        return 0;
    }
    

      

  • 相关阅读:
    nconf修改密码
    快速清空一个文
    freebsd安装snmp
    -bash: mail: command not found
    重置Cacti密码
    cacti添加被监控机全过程
    cacti图形字符乱码
    博客链接
    tar命令详解
    MainPresenter 实现类
  • 原文地址:https://www.cnblogs.com/sola1994/p/4369271.html
Copyright © 2011-2022 走看看