jva 104 河洛之數

1) 矩陣內數字皆不可重複出現' g, h: N) a+ X; |1 B) x
(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/ J3 o+ |; c0 G
{
public static void main(String arg[])
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun), I+ l% Z# \, P8 g, Q8 d6 p
{
int r=(int)(Math.random()*9)+1;# U8 [& y" P5 g
int t=num[i];+ b7 A% E$ G: J  {3 O9 g
num[i]=num[r];
num[r]=t;
int a1 = num[0] + num[1] + num[2] ;) ?& r. ~7 t( B, Y- l) O5 |( Q
      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] ;$ f1 A+ [! o' |' R& T/ C
      int a7 = num[0] + num[4] + num[8] ;- x. k( x. E% D: T
      int a8 = num[2] + num[4] + num[6] ;8 s6 j+ S) W# T' O0 v
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)9 d% g5 G  x# `7 U" C6 ~
      }break;
}+ ?. V& C0 G' X! w
}

小雲雀

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
{
public static void main(String arg[])
      {& Q4 u# L2 F1 T: [; r' e
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)8 A2 |2 }" M5 U2 X
            {
            int r=(int)(Math.random()*9)+1;! A+ F+ m# U1 w: F- Y
            int t=num[i];
            num[i]=num[r];: o* }7 k& ^) _+ }- m; ^6 G5 z
            num[r]=t;# P( O7 F9 f! _- l3 {' ]+ M4 t
            int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;2 v/ X; C6 r: m+ s2 g: e
      int a3 = num[6] + num[7] + num[8] ;( K4 p/ B1 w/ b  _- w, d
      int a4 = num[0] + num[3] + num[6] ;7 s/ S& G$ ?! S
      int a5 = num[1] + num[4] + num[7] ;& y% a! E! y6 H% b; D' N( }
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;; z. j9 Y" T, _8 U! o8 i5 y& W4 B
      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;
}
}

人平

TOP