hdu 4891 The Great Pan 字符串的处理

 
 
The
 Great Pan
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 164    Accepted Submission(s): 56 
     
     

      
      Problem
 Description
     
     
     
     

      
      As a programming contest addict, Waybl is always happy to take part in various competitive programming
 contests. One day, he was competing at a regional contest of Inventing Crappy Problems Contest(ICPC). He tried really hard to solve a "geometry" task without success. After the contest, he found that the problem statement is ambiguous! He immediately complained
 to jury. But problem setter, the Great Pan, told him "There are only four possibilities, why don't you just try all of them and get Accepted?". Waybl was really shocked. It is the first time he learned that enumerating problem statement is as useful as trying
 to solve some ternary search problem by enumerating a subset of possible angle! Three years later, while chatting with Ceybl, Waybl was told that some problem "setters" (yeah, other than the Great Pan) could even change the whole problem 30 minutes before
 the contest end! He was again shocked. Now, for a given problem statement, Waybl wants to know how many ways there are to understand it. A problem statement contains only newlines and printable ASCII characters (32 ≤ their ASCII code ≤ 127) except '{', '}',
 '|' and '$'. Waybl has already marked all ambiguity in the following two formats: 1.{A|B|C|D|...} indicates this part could be understand as A or B or C or D or .... 2.$blah blah$ indicates this part is printed in proportional fonts, it is impossible to determine
 how many space characters there are. Note that A, B, C, D won't be duplicate, but could be empty. (indicate evil problem setters addedclarified it later.) Also note that N consecutive spaces lead to N+1 different ways of understanding, not 2
      
      N ways.
 It is impossible to escape from "$$" and "{}" markups even with newlines. There won't be nested markups, i.e. something like "${A|B}$" or "{$A$|B}" or "{{A|B}|C}" is prohibited. All markups will be properly matched.
     
     
     
     

      
       
     
     
     
     

      
      Input
     
     
     
     

      
      Input
 contains several test cases, please process till EOF. For each test case, the first line contains an integer n, indicating the line count of this statement. Next n lines is the problem statement. 1 ≤ n ≤ 1000, size of the input file will not exceed 1024KB.
     
     
     
     

      
       
     
     
     
     

      
      Output
     
     
     
     

      
      For
 each test case print the number of ways to understand this statement, or "doge" if your answer is more than 
      
      105.
     
     
     
     

      
       
     
     
     
     

      
      Sample
 Input
     
     
     
     

      
      
       
       

        
        9
I'll shoot the magic arrow several
 times on the ground, and of course
 the arrow will leave some holes
 on the ground. When you connect
 three holes with three line segments,
 you may get a triangle.
{|It is hole! Common sense!|
No Response, Read Problem
 Statement|don't you know what a triangle is?}
1
Case $1: = >$
5
$/*This is my code printed in
 proportional font, isn't it cool?*/
printf("Definitely it is cooooooool \
%d\n",4 * 4 * 4 * 4 * 4 * 4 * 4 * 4 * 4 
* 4 * 4 * 4 * 4 * 4 * 4 * 4 * 4 * 4);$
2
$Two  space$ and {blue|
red} color!
       
       
     
     
     
     

      
       
     
     

     
     

      
      Sample
 Output
     
     
     
     

      
      
       
       

        
        4
4
doge
6
       
       
     
     
     
     

      
       
     
     

题意是这样的。  问你有几种理解方法。遇到{}的理解种类是 里面‘|’的数目+1种。  遇到$$ 的时候理解的种类有 连续空格数+1  如果有多处空格则都要乘起来.如果方法数大于500000则输出doge.

如果遇到换行,就把下一行和该行连在一起就行了,空格不能忽略.

如案例2  4=2*2 因为$$中间有两处 单独的空格    如案例4   6=3*2 以为$$中有一处两个连续空格   {} 有一个|;

#include<stdio.h>
#include<set>
#include<string.h>
#define ll __int64
using namespace std;
char a[2123456];
int main()
{
    ll i,n,flag,ans,sum,flag2,num;
    while(scanf(" %I64d ",&n)!=EOF)
    {
        //getchar();
        memset(a,0,sizeof(a));
        for(i=0;i<n;i++)
        {
            gets(a+strlen(a));
        }
        flag=0;
        flag2=0;
        num=1;
        ans=1;//什么都没有怎么办
        for(i=0;a[i]!=0;i++)
        {
            if(a[i]=='{')
            {
                flag=1;
                sum=1;
            }
            if(a[i]=='}')
            {
                 flag=0;
                 ans*=sum;
            }
            if(flag==1)
            {
                if(a[i]=='|')
                    sum++;
            }

            
            if(flag2==1&&a[i]!=' '&&a[i-1]==' ')//防止第一个&前就是空格 所以放前面
            {
                ans*=num;
                num=1;
            }
            
            if(a[i]=='$')
            {
                if(flag2==0)
                    flag2=1;
                else
                    flag2=0;
                num=1;
            }
            if(flag2==1&&a[i]==' ')//连续的空格
                num++;
            if(ans>100000)
                break;
        }
        if(ans>100000)
            puts("doge");
        else
             printf("%I64d\n",ans);
    }
    return 0;
}