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

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

            




            
	
					
	
            
		
            
			POJ 3126-Prime Path 廣度優(yōu)先搜索BFS
		
            
		
            不知道數(shù)論里面是不是有相關(guān)的公式，總之這道題我做的有點(diǎn)暴力，呵呵，一個(gè)BFS搞定；
            要說(shuō)具體的算法的話(huà)，就是【】【】【】【】這 四個(gè)數(shù)位按從左到右的順序每次改變一個(gè)位置上的數(shù)字，如果這個(gè)數(shù)字是質(zhì)數(shù)，就把它放入隊(duì)列，并記錄下到達(dá)這個(gè)數(shù)字所要經(jīng)歷的步數(shù)即可，然后循環(huán)搜索，搜到跳出。。。
            有點(diǎn)遺憾的是，這道題我寫(xiě)的有點(diǎn)長(zhǎng)，如果你有更好的想法，不妨告訴我哦 謝謝啦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 閱讀(1323) 評(píng)論(0)  編輯 收藏 引用  
		
            
	
            
	
	





            
	    
    




            



            


            

	
            
		
		
            只有注冊(cè)用戶(hù)登錄后才能發(fā)表評(píng)論。
            
		
            
		
				
		
		
		
            
		
            			
		
		
		
		
            
		
            
			
		
            
		
            
			
		
            
		
            
			
            網(wǎng)站導(dǎo)航:
			博客園  
			IT新聞  
			BlogJava  			
			博問(wèn)  
			Chat2DB  
			管理
			
            		
		
            
		
            
			
				

            


            

            		
		
            
	
            	

            



            

				

            


    
    







            
	   
	



色妞色综合久久夜夜|
欧美日韩精品久久久久|
久久被窝电影亚洲爽爽爽|
国产成人精品久久亚洲高清不卡 |
狠色狠色狠狠色综合久久
|
久久天堂AV综合合色蜜桃网|
好属妞这里只有精品久久|
精品久久人人做人人爽综合|
久久亚洲日韩精品一区二区三区|
国产高清美女一级a毛片久久w|
中文字幕无码免费久久|
久久久精品波多野结衣|
韩国免费A级毛片久久|
久久精品国产亚洲AV忘忧草18
|
无码伊人66久久大杳蕉网站谷歌|
久久精品国产99久久久香蕉|
久久精品中文闷骚内射|
久久久久久久波多野结衣高潮
|
综合久久国产九一剧情麻豆|
精品国产一区二区三区久久蜜臀
|
久久国产成人午夜AV影院|
精品国产VA久久久久久久冰|
国产亚洲精品久久久久秋霞
|
久久久久久久女国产乱让韩|
久久国产一片免费观看|
久久线看观看精品香蕉国产|
国产精品99久久久久久人|
精品乱码久久久久久久|
国产精品国色综合久久|
色狠狠久久AV五月综合|
久久人人爽人人爽人人片av高请|
亚洲国产精品无码久久98|
亚洲精品乱码久久久久久久久久久久|
欧美久久久久久精选9999|
久久精品国产第一区二区|
国产精品成人99久久久久|
精品无码人妻久久久久久|
无码任你躁久久久久久久|
偷偷做久久久久网站|
日本久久久久亚洲中字幕|
久久96国产精品久久久|