Known Notation

题目地址：Known Notation

解题思路：

    o(︶︿︶)o 唉。

代码：

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
//#include <map>
#include <set>
using namespace std;
/***************************************/
#define ll long long
#define int64 __int64
#define PI 3.1415927
/***************************************/
const int INF = 0x7f7f7f7f;
const double eps = 1e-8;
const double PIE=acos(-1.0);
const int d1x[]= {0,-1,0,1};
const int d1y[]= {-1,0,1,0};
const int d2x[]= {0,-1,0,1};
const int d2y[]= {1,0,-1,0};
const int fx[]= {-1,-1,-1,0,0,1,1,1};
const int fy[]= {-1,0,1,-1,1,-1,0,1};
const int dirx[]= {-1,1,-2,2,-2,2,-1,1};
const int diry[]= {-2,-2,-1,-1,1,1,2,2};
/*vector <int>map[N];map[a].push_back(b);int len=map[v].size();*/
/***************************************/

int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        char s[1005];
        scanf("%s",s);
        int i,j;
        int len=strlen(s);
        int numN=0,numX=0;
        int sum=0;
        for(i=0;i<len;i++)
        {
            if (s[i]<='9'&&s[i]>='0')
                numN++;
            if (s[i]=='*')
                numX++;
        }
        sum=numX+1-numN;
        if (sum<0)
            sum=0;
        int numn=sum,ce=0;
        for(i=0;i<len;i++)
        {
            if (s[i]<='9'&&s[i]>='0')
                numn++;
            if (s[i]=='*')
            {
                if (numn>=2)
                {
                    numn-=1;
                }
                else
                {
                    ce++;
                    numn+=1;
                    sum++;
                }
            }
        }
        if (!ce&&s[len-1]!='*'&&numX)
            sum++;
        printf("%d
",sum);
    }
    return 0;
}