• <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>
            

    
            

            




            







												


        


            


            The Fourth Dimension Space
            

            枯葉北風寒，忽然年以殘，念往昔，語默心酸。二十光陰無一物，韶光賤，寐難安； 不畏形影單，道途阻且慢，哪曲折，如渡飛湍。斬浪劈波酬壯志，同把酒，共言歡！  -如夢令
            

            




            
	
					
	
            
		
            
			POJ 3126-Prime Path 廣度優先搜索BFS
		
            
		
            不知道數論里面是不是有相關的公式，總之這道題我做的有點暴力，呵呵，一個BFS搞定；
            要說具體的算法的話，就是【】【】【】【】這 四個數位按從左到右的順序每次改變一個位置上的數字，如果這個數字是質數，就把它放入隊列，并記錄下到達這個數字所要經歷的步數即可，然后循環搜索，搜到跳出。。。
            有點遺憾的是，這道題我寫的有點長，如果你有更好的想法，不妨告訴我哦 謝謝啦O(∩_∩)O~
            

            #include <iostream>
            #include             <algorithm>
            #include            <cstdio>
            using namespace std;

            bool prim[10000];

            struct node
            {
                            int n;
                            int step;

            }            line[100001];

            int visited[10000];

            int main()
            {
                            int n,m;
                            int i,j;
                            for(i=2;i<=10000;i++)
                            {
                                if(prim[i]==true)
                                    continue;
                                for(j=2;j<=10000;j++)
                                {
                                    if(i*j>10000)
                                        break;
                        prim[i            *j]=true;
                    }
                }



                            /////////////////////////////////////////////////////////////////////////////////////////
                int testcase;
                            int front;
                            int rear;
                scanf(            "%d",&testcase);
                            for(j=1;j<=testcase;j++)
                            {
                    memset(visited,            false,sizeof(visited));
                                for(i=1;i<=10000;i++)
                                {
                        line[i].n            =0;
                        line[i].step            =0;
                    }

                    front            =1;
                    rear            =1;
                    scanf(            "%d%d",&n,&m);
                    line[            1].n=n;
                    line[            1].step=0;


                                while(front<=rear)
                                {
                                    if(line[front].n==m)
                                        break;

                                    if(visited[line[front].n]==0)
                                    {
                            visited[line[front].n]            =1;
                                        int k;
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n-k*1000>=1000)
                                            {
                                                if (prim[line[front].n-k*1000]==0&&visited[line[front].n-k*1000]==false)
                                    
                                                {

                                    

                                    rear            ++;
                                    line[rear].n            =line[front].n-k*1000;
                                    line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n+k*1000<10000)

                                            {
                                                if(prim[line[front].n+k*1000]==0&&visited[line[front].n+k*1000]==false)
                                                {

                                    

                                    rear            ++;
                                    line[rear].n            =line[front].n+k*1000;
                                    line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;


                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%1000-k*100>=0)
                                            {
                                                if(prim[line[front].n-k*100]==0&&visited[line[front].n-k*100]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n-k*100;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%1000+k*100<1000)
                                            {
                                                if(prim[line[front].n+k*100]==0&&visited[line[front].n+k*100]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n+k*100;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%100-k*10>=0)
                                            {
                                                if(prim[line[front].n-k*10]==0&&visited[line[front].n-k*10]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n-k*10;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%100+k*10<100)
                                            {
                                                if(prim[line[front].n+k*10]==0&&visited[line[front].n+k*10]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n+k*10;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%10-k*1>=0)
                                            {
                                                if(prim[line[front].n-k*1]==0&&visited[line[front].n-k*1]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n-k*1;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                                        for(k=1;;k++)
                                        {
                                            if(line[front].n%10+k*1<10)
                                            {
                                                if(prim[line[front].n+k*1]==0&&visited[line[front].n+k*1]==false)
                                                {
                                        rear            ++;
                                        line[rear].n            =line[front].n+k*1;
                                        line[rear].step            =line[front].step+1;
                                    }
                                }
                                            else
                                                break;
                            }
                        }
                    front            ++;
                    }
                                if(front>rear)
                        printf(            "Impossible\n");
                                else
                        printf(            "%d\n",line[front].step);

                }
                system(            "pause");
                            return 0;
            }




            

		
            
			posted on 2009-02-27 22:31 abilitytao 閱讀(1317) 評論(0)  編輯 收藏 引用  
		
            
	
            
	
	





            
	    
    




            






            

				

            


    
    







            
	   
	



国产偷久久久精品专区|
国产精品毛片久久久久久久|
久久九九精品99国产精品|
亚洲伊人久久综合中文成人网|
国产精品99久久久久久www|
国产精品久久久久久久久|
91精品国产综合久久精品|
久久久精品人妻一区二区三区蜜桃
|
国产一区二区精品久久凹凸|
丰满少妇高潮惨叫久久久|
久久久久人妻一区精品性色av|
亚洲日韩欧美一区久久久久我|
久久综合久久伊人|
久久人做人爽一区二区三区|
伊人久久大香线蕉AV色婷婷色|
久久夜色精品国产噜噜噜亚洲AV|
久久精品国产网红主播|
国内精品久久久久久野外|
久久国产高清一区二区三区|
日韩久久无码免费毛片软件|
久久精品人妻一区二区三区|
国产99精品久久|
狠狠色噜噜狠狠狠狠狠色综合久久|
久久久久一区二区三区|
97精品伊人久久久大香线蕉|
欧美性猛交xxxx免费看久久久|
亚洲人成电影网站久久|
97热久久免费频精品99|
国产成人精品久久|
久久精品无码一区二区WWW|
久久久久人妻精品一区二区三区|
曰曰摸天天摸人人看久久久|
久久久久亚洲AV片无码下载蜜桃|
亚洲国产美女精品久久久久∴|
99久久国产主播综合精品|
中文字幕无码av激情不卡久久|
精品久久8x国产免费观看|
久久久久久久综合日本|
91精品国产高清久久久久久io|
色狠狠久久综合网|
999久久久免费国产精品播放|