• <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 華劍緣 閱讀(491) 評(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)和初始化！！！  回復(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)論
              
            
			
            
			
			
		
            
	








            



            


            

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

            


            

            		
		
            
	
            	

            



            

				

            


    
    







            
	   
	



精品久久久久中文字|
香蕉久久夜色精品国产2020|
久久婷婷国产剧情内射白浆|
亚洲欧洲精品成人久久曰影片|
欧美亚洲另类久久综合婷婷|
久久精品国产男包|
色综合久久综精品|
思思久久精品在热线热|
一本久久知道综合久久|
99久久国产主播综合精品
|
久久国产热这里只有精品|
亚洲国产成人久久笫一页|
国产精品美女久久久久久2018|
国产福利电影一区二区三区，免费久久久久久久精|
99久久精品免费观看国产|
性色欲网站人妻丰满中文久久不卡|
66精品综合久久久久久久|
久久久噜噜噜久久中文字幕色伊伊
|
久久伊人亚洲AV无码网站|
精品久久久久久国产|
久久久久亚洲?V成人无码|
国产精品久久久久久久久|
少妇熟女久久综合网色欲|
久久精品国产99久久久香蕉|
久久精品国产2020|
欧美性猛交xxxx免费看久久久|
久久中文娱乐网|
久久精品无码专区免费青青|
综合久久一区二区三区
|
久久久久人妻精品一区三寸蜜桃|
97久久天天综合色天天综合色hd|
久久亚洲sm情趣捆绑调教|
狠狠精品干练久久久无码中文字幕
|
久久精品无码一区二区三区日韩|
久久精品国产亚洲AV嫖农村妇女
|
久久综合久久美利坚合众国|
国产亚洲色婷婷久久99精品91
|
久久久久久亚洲Av无码精品专口|
久久久久亚洲AV无码专区首JN|
久久婷婷色香五月综合激情|
性做久久久久久久久|