jva 104 河洛之數

1) 矩陣內數字皆不可重複出現6 _6 B9 m& N7 i; |
(2) 程式每次執行，矩陣數字排列皆不相同2 m/ D, U' X& n7 z' D9 o. u6 i
(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
{9 G: f8 ^" j; d& G8 @
public static void main(String arg[])
{; s& w7 b% @" d* H
      int num []={1,2,3,4,5,6,7,8,9};6 e: D0 [) J  w1 b
      while(trun)* r, {5 k. `+ Y; ~; ^
{
int r=(int)(Math.random()*9)+1;$ y9 Q3 c7 N$ C* _3 r: X1 y3 G
int t=num[i];8 ]; p0 h# S0 f/ [& K
num[i]=num[r];: r/ a  N! `, h: b/ S! h7 W5 U2 K( n( E
num[r]=t;) `4 _1 m8 z+ m+ ]$ ]
int a1 = num[0] + num[1] + num[2] ;/ O! Y- q' \: u& \* z
      int a2 = num[3] + num[4] + num[5] ;( K3 J! S# O: h2 l- W0 a
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;  L# g: _0 ^  y
      int a5 = num[1] + num[4] + num[7] ;3 j! X% O& ?0 F
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;/ ~; e$ M) K! O, M3 r
      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)  ?1 M9 c( C5 w- r7 y
      }break;       , H7 R, x3 `/ ?4 f& u. J4 Y
}/ W. j2 X  c- G
}

小雲雀

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! Y4 h: t0 ?8 v2 Z$ W! I8 R
{
public static void main(String arg[])% c4 W, y3 z: v* z1 t. s7 v8 ~, T
      {
         int num []={1,2,3,4,5,6,7,8,9};5 g: L' p. ?& e" K6 n+ k2 T- N
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;$ a( F: p4 o  d3 i. K
            int t=num[i];! K8 G% X* S+ Y0 L2 _/ z
            num[i]=num[r];
            num[r]=t;! w% b, J% w; m. u6 ^* T
            int a1 = num[0] + num[1] + num[2] ;( Q4 j/ e- _/ g4 z9 U
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;. e+ [! E( n- }
      int a7 = num[0] + num[4] + num[8] ;! X3 |4 Q8 _, x
      int a8 = num[2] + num[4] + num[6] ;3 ^- e- i( z+ O; M  k
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
         }break;          5 l  b- F7 i+ m. N
}
}

人平

TOP