jva 104 河洛之數

1) 矩陣內數字皆不可重複出現# X, D* e! ]1 Q$ \
(2) 程式每次執行，矩陣數字排列皆不相同7 T& m$ V7 V; [4 g
(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
{
public static void main(String arg[])  w- b9 Y7 \; W4 R) H1 j6 R) G
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)  g7 L) A7 E9 D2 g7 ~
{" N4 T' M5 |& n. r9 T3 H
int r=(int)(Math.random()*9)+1;
int t=num[i];- c8 O" ]2 `" O  J  G3 l: a
num[i]=num[r];
num[r]=t;
int a1 = num[0] + num[1] + num[2] ;
      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] ;
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;1 u# q0 b& W2 m
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15); `2 [1 m. O; F. d
      }break;       1 y) g2 W$ x; H" r. `: 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
{( Q! v: f+ o5 K4 i' X0 b
public static void main(String arg[]). ?4 W+ [& |( J5 K" h) i
      {" `+ O7 j) Z# n. j$ _7 X& X
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
            {* W+ J' u) o4 }* Y$ `6 C9 r8 h0 r
            int r=(int)(Math.random()*9)+1;
            int t=num[i];" O! {6 g6 h% b/ \1 D/ }/ J
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;! j, M" u0 L8 q5 N5 x% ^) m0 W
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;) b- {0 L' C& s! c; x+ v
      int a4 = num[0] + num[3] + num[6] ;# Q: k0 ^% v! B) d( \
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;! q7 b( m" P$ t" S: {7 y
      int a7 = num[0] + num[4] + num[8] ;7 i) A' ?. E. p$ O
      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)
         }break;          0 @8 I/ v$ \  W& L0 ]
}; h3 T& C; y, S$ L: J: l! A
}

人平

TOP