jva 104 河洛之數

1) 矩陣內數字皆不可重複出現" ^. D5 q8 F- _' V8 B$ B2 q
(2) 程式每次執行，矩陣數字排列皆不相同: c1 D9 \% |# t
(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[])7 f8 m; B; Q  E
{- ~: L& `& F, ~2 }$ I6 c
      int num []={1,2,3,4,5,6,7,8,9};7 q& I/ g6 a- D) o( w3 V4 [
      while(trun)
{
int r=(int)(Math.random()*9)+1;! b9 o; _% D6 ]! R7 N- Q3 H" l3 {. e
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] ;
      int a3 = num[6] + num[7] + num[8] ;/ C  j5 b9 E1 d' l& s
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;' `/ {- i: N3 c  v/ J
      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)
      }break;
}
}

小雲雀

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/ k3 M) P8 h7 `
{2 E8 F& k% ~% |
public static void main(String arg[])
      {+ g2 L; `6 K: d3 i; r9 T
         int num []={1,2,3,4,5,6,7,8,9};  F4 I6 Z# p* Y% U: y$ F
      while(trun)
            {* B$ @/ C5 _1 M$ X$ W# t$ `
            int r=(int)(Math.random()*9)+1;; H) C, m9 b/ Y8 Y! T* |
            int t=num[i];% A1 u7 U: ~4 ~* I- j" h7 X
            num[i]=num[r];
            num[r]=t;: f" g- d3 e7 \$ C/ ]3 B  ]% L- d3 x
            int a1 = num[0] + num[1] + num[2] ;, b  ]9 f. K. Q7 ~( ]3 W# b
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;# q* c1 j" `- f% }; I, x$ T
      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] ;7 w. b3 e  z; G  }8 Z" {
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15), j7 ?; F) B# |* j6 z2 A) r6 l# I
         }break;
}
}

人平

TOP