jva 104 河洛之數

1) 矩陣內數字皆不可重複出現
(2) 程式每次執行，矩陣數字排列皆不相同
(3) 矩陣之縱向、橫向、對角線數字總和皆為15

#include <iostream>
#include <cstdlib>
using namespace std ;
int main(){
int a[] = {1,2,3,4,5,6,7,8,9} ;
//亂數種子
srand(time(NULL));
while(true){
//交換9次
for(int i=0;i<9;i++){
int r = rand()%9 ;
//交換
int t = a[r] ;
a[r] = a[i];
a[i] = t ;
}
//列的判斷
int a1 = a[0] + a[1] + a[2] ;
int a2 = a[3] + a[4] + a[5] ;
int a3 = a[6] + a[7] + a[8] ;
//行的判斷
int a4 = a[0] + a[3] + a[6] ;
int a5 = a[1] + a[4] + a[7] ;
int a6 = a[2] + a[5] + a[8] ;
//斜的判斷
int a7 = a[0] + a[4] + a[8] ;
int a8 = a[2] + a[4] + a[6] ;
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15){
break;
}
}
cout << a[0] << " " << a[1] << " " << a[2] << endl;
cout << a[3] << " " << a[4] << " " << a[5] << endl;
cout << a[6] << " " << a[7] << " " << a[8] << endl;
system("pause");
return 0;
}

複製代碼

新手上路

Rank: 1

2^#

johnson發表於 2011-12-31 11:35 | 只看該作者

public class j102
{) h/ Q/ v! h# [# @; Z' ?% d% E
public static void main(String arg[])
{) Q/ u, e; ^8 @7 ]
      int num []={1,2,3,4,5,6,7,8,9};' a, c' Q/ K8 _( R5 f
      while(trun)
{
int r=(int)(Math.random()*9)+1;, {4 n& S4 v' T
int t=num[i];* X( x; r2 z1 o
num[i]=num[r];' s5 p8 b! [1 g% G
num[r]=t;& A+ E1 g6 B1 ^" b0 O
int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;( ?* T3 x, d* ?4 F! Y
      int a3 = num[6] + num[7] + num[8] ;- Y+ P+ o9 Y2 F# B/ Z- U
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;0 H6 J: I% R, m3 ]. w5 N4 K: B; c# @
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;$ N' p( G: b5 y$ j/ d
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)  \: v- V: i$ P/ j$ V
      }break;
}
}

小雲雀

TOP

新手上路

Rank: 1

3^#

kim發表於 2011-12-31 11:36 | 只看該作者

#include <iostream>
#include <cstdlib>
using namespace std ;
int main(){
int a[] = {1,2,3,4,5,6,7,8,9} ;
//亂數種子
srand(time(NULL));
while(true){
//交換9次
for(int i=0;i<9;i++){
int r = rand()%9 ;
//交換
int t = a[r] ;
a[r] = a[i];
a[i] = t ;
}
//列的判斷
int a1 = a[0] + a[1] + a[2] ;
int a2 = a[3] + a[4] + a[5] ;
int a3 = a[6] + a[7] + a[8] ;
//行的判斷
int a4 = a[0] + a[3] + a[6] ;
int a5 = a[1] + a[4] + a[7] ;
int a6 = a[2] + a[5] + a[8] ;
//斜的判斷
int a7 = a[0] + a[4] + a[8] ;
int a8 = a[2] + a[4] + a[6] ;
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15){
break;
}
}
cout << a[0] << " " << a[1] << " " << a[2] << endl;
cout << a[3] << " " << a[4] << " " << a[5] << endl;
cout << a[6] << " " << a[7] << " " << a[8] << endl;
system("pause");
return 0;
}

複製代碼

★ 嘉凱~~☆

TOP

中級會員

Rank: 3 Rank: 3

4^#

eric5802發表於 2011-12-31 11:38 | 只看該作者

public class j102# {; Q" s7 a$ a1 K7 P
{
public static void main(String arg[])) s/ A1 `$ q) x1 B9 Y& C
      {+ H" G  n# C$ m$ ^5 [$ g: h* k
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
            {, B3 L  M% k5 ]2 L# N
            int r=(int)(Math.random()*9)+1;8 u$ Z9 `  Y! }& w$ X, |: ^0 O) s5 b) C
            int t=num[i];) x% X# K* s% V# A
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;' i4 f0 r( ~" [" v' h0 G! m% S
      int a3 = num[6] + num[7] + num[8] ;. t. u! }, M6 L$ B& O1 V6 V0 D
      int a4 = num[0] + num[3] + num[6] ;  ]6 S1 k0 A, s4 U) d+ \
      int a5 = num[1] + num[4] + num[7] ;6 W: H) y. ?9 K2 u
      int a6 = num[2] + num[5] + num[8] ;9 ~: U* @; _  z8 m
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)5 o$ J/ j  k" }' G
         }break;
}
}

人平

TOP