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- P6 l; }% \7 D" X$ \7 u
{! d( S! k2 V# P5 z; \* x
public static void main(String arg[])
{
      int num []={1,2,3,4,5,6,7,8,9};/ H2 q! w: h0 ?! Y$ u+ a2 f
      while(trun)2 f% B9 G. b: L9 \; d" P
{
int r=(int)(Math.random()*9)+1;, C. b5 l, e$ N( U
int t=num[i];
num[i]=num[r];
num[r]=t;
int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;+ I4 Z4 v/ H% v2 O
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;/ {7 \) S/ T: C
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;! o# g* f$ }6 U6 H8 ]' v6 f. ?
      int a7 = num[0] + num[4] + num[8] ;! E, t3 P1 T1 R/ u$ b: v: W7 i: t# \
      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;
}9 H, h' g& ~0 ?, J
}

小雲雀

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 j1023 b. y4 I; m5 p" M8 z+ t
{6 X9 ?  J5 b; v; i# ~: [9 E
public static void main(String arg[])
      {
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)* D( N3 O6 B, x3 A  A  ^
            {
            int r=(int)(Math.random()*9)+1;; `! K) o. g! H- t9 l' W
            int t=num[i];
            num[i]=num[r];8 a& A! M) y% S4 D
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;0 K. Y/ A' q* \5 t
      int a2 = num[3] + num[4] + num[5] ;' D% [. c( a+ D7 ~5 F
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;4 Y( _6 G4 `, W9 R- @+ L
      int a5 = num[1] + num[4] + num[7] ;3 a+ q" G. p0 B2 }) p2 i7 Y: U
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;  i0 T) H+ P" Y& y; m
      int a8 = num[2] + num[4] + num[6] ;1 V1 I3 `/ ?0 Z2 P6 I% ~
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)+ A/ O7 m! M; ]# I
         }break;
}
}

人平

TOP