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

    
            

            




            







												


        


            

            
	
	


            
	
            
		華劍緣
            
		一切都在這個(gè)過(guò)程中獲得，將那些目標(biāo)埋藏于心中 
	
            

            
            		
	

            

            


            
	
		
            
			


            
posts - 19,comments - 20,trackbacks - 0


            
	

            


            
	
					


            
	
	
		
            
				
            幻方：
            
		
            
				
				#include?
				"
				iostream.h
				"
				
						
            
						
						
            
						
				            
				int
				?main()
            
				
				
						{
            ????????            
						int
						?N,i,j,count;
            ????????cout            
						<<
						"
						Please?enter?N:
						"
						;
            ????????cin            
						>>
						N;
            ????????            
						int
						?
						**
						arr
						=
						new
						?
						int
						*
						?[N];
            ????????            
						for
						(i
						=
						0
						;i
						<
						N;i
						++
						)
            ????????????????arr[i]            
						=
						new
						?
						int
						[N];
            ????????            
						for
						(i
						=
						0
						;i
						<
						N;i
						++
						)
            ????????????????            
						for
						(j
						=
						0
						;j
						<
						N;j
						++
						)
            ????????????????????????arr[i][j]            
						=
						0
						;
            ????????arr[            
						0
						][(N
						+
						1
						)
						/
						2
						-
						1
						]
						=
						1
						;
            ????????            
						for
						(count
						=
						1
						,i
						=
						0
						,j
						=
						(N
						+
						1
						)
						/
						2
						-
						1
						;count
						<
						N
						*
						N;count
						++
						)
            ????????            
						
						
								{
            ????????????????i            
								--
								;
            ????????????????j            
								--
								;
            ????????????????            
								if
								(i
								==-
								1
								)
            ????????????????????????i            
								=
								N
								-
								1
								;
            ????????????????            
								if
								(j
								==-
								1
								)
            ????????????????????????j            
								=
								N
								-
								1
								;
            ????????????????            
								if
								(arr[i][j]
								==
								0
								)
            ????????????????????????arr[i][j]            
								=
								count
								+
								1
								;
            ????????????????            
								else
								?
								if
								(arr[i][j]
								>
								0
								)
            ????????????????            
								
								
										{
            ????????????????????????i            
										=
										i
										+
										2
										;
            ????????????????????????j            
										=
										j
										+
										1
										;
            ????????????????????????            
										if
										(j
										==
										N)
            ????????????????????????????????j            
										=
										0
										;
            ????????????????????????            
										if
										(i
										==
										N)
            ????????????????????????????????i            
										=
										0
										;
            ????????????????????????            
										else
										?
										if
										(i
										==
										N
										+
										1
										)
            ????????????????????????????????i            
										=
										1
										;
            ????????????????????????arr[i][j]            
										=
										count
										+
										1
										;
            ????????????????}            
								            
								
										
            
										????????}            
						            
						
								
            
								????????            
						for
						(i
						=
						0
						;i
						<
						N;i
						++
						)
            ????????            
						
						
								{
            ????????????????            
								for
								(j
								=
								0
								;j
								<
								N;j
								++
								)
            ????????????????            
								
								
										{
            ????????????????????????cout            
										<<
										arr[i][j]
										<<
										"
										?
										"
										;
            ????????????????}            
								            
								
										
            
										????????????????cout            
								<<
								"
								\n
								"
								;
            ????????}            
						            
						
								
            
								?????????????????????            
						for
						(i
						=
						0
						;i
						<
						N;i
						++
						)
            ????????????????delete?[]?arr[i];
            ????????delete?[]?arr;
            ????????            
						return
						?
						1
						;
            }            
				            
		
            

	
            posted on 2006-04-09 22:58 華劍緣 閱讀(498) 評(píng)論(3)  編輯 收藏 引用  
            

            







            
	    
    


            
FeedBack:

            
	

		
            
			
            # re: 幻方，呵呵學(xué)習(xí)學(xué)習(xí)
            
			
            
				2006-04-10 09:03 | 沐楓
            
				
            int   ** arr = new   int *  [N];

                     for (i = 0 ;i < N;i ++ )

                            arr[i] = new   int [N];

                     for (i = 0 ;i < N;i ++ )

                             for (j = 0 ;j < N;j ++ )

                                    arr[i][j] = 0 ;

            

            好可怕的數(shù)據(jù)結(jié)構(gòu)和初始化?。。?nbsp; 回復(fù)  更多評(píng)論
              
            
			
            
			
			
		
            
	
		
            
			
            # re: 幻方，呵呵學(xué)習(xí)學(xué)習(xí)
            
			
            
				2006-04-10 12:27 | 華劍緣
            
				
            呵呵，我是新手請(qǐng)指教。幫改改好么，不勝感激。  回復(fù)  更多評(píng)論
              
            
			
            
			
			
		
            
	
		
            
			
            # re: 幻方，呵呵學(xué)習(xí)學(xué)習(xí)
            
			
            
				2006-04-14 17:31 | 華劍緣
            
				
            @沐楓

            @沐楓

            c:\documents and settings\kakaxi\桌面\新建文件夾\text1.cpp(12) : error C2065: 'for_each' : undeclared identifier

            c:\documents and settings\kakaxi\桌面\新建文件夾\text1.cpp(12) : error C2065: 'bind2nd' : undeclared identifier

            c:\documents and settings\kakaxi\桌面\新建文件夾\text1.cpp(12) : error C2065: 'mem_fun_ref' : undeclared identifier  回復(fù)  更多評(píng)論
              
            
			
            
			
			
		
            
	








            






            

				

            


    
    







            
	   
	



99久久国产热无码精品免费
|
久久久久久国产a免费观看黄色大片|
久久久久久九九99精品|
国产91久久精品一区二区|
AA级片免费看视频久久|
国产精品久久久久久久app|
激情伊人五月天久久综合|
久久无码一区二区三区少妇|
亚洲精品无码久久久影院相关影片|
99久久精品午夜一区二区|
亚洲人成无码久久电影网站|
97久久超碰国产精品2021|
久久笫一福利免费导航|
久久精品国产亚洲麻豆|
久久国产欧美日韩精品免费|
久久无码av三级|
久久99精品久久久久久动态图|
久久九九免费高清视频|
.精品久久久麻豆国产精品|
亚洲另类欧美综合久久图片区|
久久精品国产免费一区|
97久久超碰成人精品网站|
一本色道久久综合狠狠躁|
久久精品国产黑森林|
国产成人精品久久综合|
国产精品久久网|
日韩精品久久无码人妻中文字幕
|
亚洲国产精品无码久久SM|
久久亚洲精品无码播放|
久久99精品国产麻豆婷婷|
精品乱码久久久久久久|
日韩久久久久久中文人妻|
日韩av无码久久精品免费|
亚洲国产精品高清久久久|
亚洲国产精品18久久久久久|
色综合久久久久无码专区|
中文字幕人妻色偷偷久久|
伊人久久大香线蕉亚洲|
欧美噜噜久久久XXX|
色欲久久久天天天综合网精品
|
久久综合综合久久狠狠狠97色88|