• <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)  編輯 收藏 引用  
		
            
	
            
	
	





            
	    
    




            






            

				

            


    
    







            
	   
	



久久精品国产亚洲av高清漫画|
国产精品久久久久AV福利动漫|
伊人久久免费视频|
2021少妇久久久久久久久久|
久久亚洲私人国产精品vA|
久久久久久久精品成人热色戒|
2019久久久高清456|
国产精品99久久久精品无码|
18禁黄久久久AAA片|
久久无码人妻一区二区三区|
日韩久久久久久中文人妻|
国产精品久久亚洲不卡动漫|
国产午夜精品理论片久久影视|
欧美777精品久久久久网|
久久久久久久综合日本|
国产aⅴ激情无码久久|
国产午夜免费高清久久影院|
国产女人aaa级久久久级|
无夜精品久久久久久|
久久久久久久亚洲Av无码|
人人狠狠综合久久亚洲88|
无码乱码观看精品久久|
日韩精品久久无码中文字幕|
国产巨作麻豆欧美亚洲综合久久|
亚洲日韩欧美一区久久久久我|
久久亚洲精品人成综合网|
精品国产综合区久久久久久|
精品久久久久久国产|
国产亚洲欧美成人久久片
|
中文字幕人妻色偷偷久久
|
香蕉久久夜色精品国产尤物|
欧美熟妇另类久久久久久不卡
|
国产精品99久久不卡|
99精品久久久久久久婷婷|
99久久人人爽亚洲精品美女|
亚洲中文久久精品无码|
精品久久人人做人人爽综合|
国内精品久久久久影院日本
|
国产一级做a爰片久久毛片|
国产精品一区二区久久精品涩爱|
9999国产精品欧美久久久久久|