• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>

    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>

            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            

    
            

            




            







												


        


            
    
					
	
            
		
            
			A DP Problem poj 2295
		
            
		
            WA了N多次,猛然發(fā)現一處少寫一符號,總算A掉了.這種題目就是要細心細心再細心.
            

            #include <iostream>
            #include            <cstring>
            #include            <cmath>
            using namespace std;
            int main()
            {
                            char str[1000]={0};
                            int i=0;
                            int n=0;
                cin            >>n;
                            while (n--)
                            {
                                int len=0;
                    cin            >>str;
                    len            =strlen(str);
                                int sign=1;
                                int xx[2]={0};
                                int cc[2]={0};
                                int cnt=0;//
                    int stack=0;
                                int empty=1;
                                for(i=0;i<len;i++)
                                {
                                    switch (str[i])
                                    {
                                    case '=':
                                        if(!empty)
                                        {
                                cc[cnt]            +=stack*sign;
                            }
                            empty            =1;
                            stack            =0;
                            cnt            ++;
                            sign            =1;
                                        break;
                            
                                    case '-':
                            
                                        if(!empty)
                                        {
                                cc[cnt]            +=stack*sign;
                                stack            =0;
                                empty            =1;
                                sign            =-1;
                            }
                                        else
                                sign            *=-1;
                            
                            
                                        break;
                                    case '+':
                                        if(!empty)
                                        {
                                cc[cnt]            +=stack*sign;
                                stack            =0;
                                sign            =1;
                                empty            =1;
                            }
                                        break;
                                    case 'x':
                                        if(!empty)
                                        {
                                xx[cnt]            +=stack*sign;
                                stack            =0;
                                empty            =1;
                            }
                                        else
                                xx[cnt]            +=sign;
                            sign            =1;
                                        break;
                            
                                    default:
                            stack            =stack*10+str[i]-'0';
                            empty            =0;
                                        break;
                            
                        }
                    }
                                if(!empty)
                                {
                        cc[cnt]            +=sign*stack;
                    }
                                if(xx[0]==xx[1])
                                {
                                    if(cc[0]==cc[1])
                                    {
                            cout            <<"IDENTITY"<<endl;
                        }
                                    else
                            cout            <<"IMPOSSIBLE"<<endl;
                    }
                                else 
                                if((cc[1]-cc[0])%(xx[0]-xx[1])==0)
                                {
                        cout            <<(cc[1]-cc[0])/(xx[0]-xx[1])<<endl;
                    }
                                else 
                                {
                                    int flag1,flag2;
                                    if(cc[1]>cc[0])
                            flag1            =1;
                                    else 
                            flag1            =-1;
                                    if(xx[0]>xx[1])
                            flag2            =1;
                                    else flag2=-1;
                                    if(flag1*flag2>0)
                            cout            <<(cc[1]-cc[0])/(xx[0]-xx[1])<<endl;
                                    else
                            cout            <<(cc[1]-cc[0])/(xx[0]-xx[1])-1<<endl;
                    }
                    
                }
                
                            return 0;
            }
            

            

            
		
            
			posted on 2010-08-21 17:24 若余 閱讀(219) 評論(0)  編輯 收藏 引用  
		
            
	
            
	
	


	


            
	    
    




            






            

				
    


            

            
    
        
        

            導航
            

        
            
	
            
		
            <2025年6月>
            
	
            日一二三四五六
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345
            

            

        

            統(tǒng)計
            
	
        

            常用鏈接
            


            留言簿
            


		
            隨筆檔案(16)
            
		
				
			
	



            搜索
            



            最新隨筆
            



            最新評論
	
            

            
	
			
		

            


            評論排行榜
            


    

            
    
    







            
	   
	



久久综合一区二区无码|
国产精品成人精品久久久
|
亚洲欧美久久久久9999|
色播久久人人爽人人爽人人片aV|
久久强奷乱码老熟女|
无码AV波多野结衣久久|
99久久国产亚洲高清观看2024
|
久久水蜜桃亚洲av无码精品麻豆|
色婷婷综合久久久久中文|
亚洲国产精品婷婷久久|
婷婷久久综合九色综合九七|
国产精品美女久久久m|
人妻中文久久久久|
久久精品国产福利国产秒|
2021最新久久久视精品爱|
国产激情久久久久影院|
无码精品久久久久久人妻中字
|
无码国内精品久久人妻蜜桃
|
亚洲色欲久久久综合网|
久久精品国产亚洲AV不卡|
亚洲人成伊人成综合网久久久|
久久91精品国产91久久麻豆|
久久久久久久久66精品片|
国产精品九九久久免费视频
|
久久精品国产亚洲沈樵|
亚洲AV无码久久精品蜜桃|
久久久久久久国产免费看|
94久久国产乱子伦精品免费|
久久精品国产99久久无毒不卡|
区久久AAA片69亚洲|
亚洲国产精品一区二区三区久久|
99热热久久这里只有精品68|
国产精品一久久香蕉国产线看观看|
久久久久久久波多野结衣高潮
|
99久久综合狠狠综合久久|
99久久综合狠狠综合久久止|
久久精品无码一区二区无码|
久久久av波多野一区二区|
成人国内精品久久久久影院|
精品久久无码中文字幕|
国产精品久久久久天天影视
|