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 j1023 m+ \, h6 g9 `9 m
{
public static void main(String arg[])) f5 ^- j1 @( u8 N8 [; _
{
      int num []={1,2,3,4,5,6,7,8,9};6 R; J7 s" d7 ]( _# p4 d. a+ j
      while(trun)
{4 L8 p7 b/ F( p, Y, f
int r=(int)(Math.random()*9)+1;
int t=num[i];
num[i]=num[r];
num[r]=t;. S& c5 W/ `' A+ w) h
int a1 = num[0] + num[1] + num[2] ;/ A( W' K8 H% i, f) V- o- h! |
      int a2 = num[3] + num[4] + num[5] ;7 e: Z* z5 Y" C1 f- J7 o* y/ k
      int a3 = num[6] + num[7] + num[8] ;2 `) H# w# S4 j% U0 Q1 l
      int a4 = num[0] + num[3] + num[6] ;9 J' A1 P5 v5 n# l
      int a5 = num[1] + num[4] + num[7] ;, K! U* x- Y) C3 S
      int a6 = num[2] + num[5] + num[8] ;- ^3 ^6 B5 a3 C, k) [* [
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;0 T. v) Y6 v$ Q+ t% W
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)+ \* q' \9 R9 O
      }break;       + u  R- t0 r. F, K# `
}
}

小雲雀

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( \0 H7 U2 T/ X. K2 C
{) O6 U; B9 J4 X1 w& Z  K0 u2 u
public static void main(String arg[])
      {
         int num []={1,2,3,4,5,6,7,8,9};1 F  n8 {, ~$ t( V2 w
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;
            int t=num[i];' k5 Y  p! L. l8 k, t
            num[i]=num[r];( E+ K$ p5 `7 W; ^- c5 E9 C
            num[r]=t;8 O* \9 _5 M2 F% G
            int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;! ]9 _2 D- B7 w9 L! v4 d. Y/ a
      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] ;
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15): g& A( t3 N9 k8 G
         }break;          . q2 s  s5 [2 @
}* D8 T# y. g$ U% Y% m! [
}

人平

TOP