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
{$ p1 L7 u" j0 O1 T
public static void main(String arg[])% }4 l# w" {+ ^! M7 z$ `- }
{. @, g, D, |* t4 M
      int num []={1,2,3,4,5,6,7,8,9};* i! l. p& A9 x2 g
      while(trun)6 s) l1 w, i5 N  @
{
int r=(int)(Math.random()*9)+1;" I: e9 t' S0 k5 c6 f2 _& [; L" s
int t=num[i];; m# f- a8 U% l+ Z6 b' t
num[i]=num[r];5 w3 K2 ]# P3 T! V* G
num[r]=t;
int a1 = num[0] + num[1] + num[2] ;' M9 n% S- _; B! i* E+ D
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;5 l+ T4 }) U5 P; D& y
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;4 ?6 r3 X6 |  h1 w9 r: H
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;% C& K) R1 [( J
      int a8 = num[2] + num[4] + num[6] ;% `5 w9 O# P- V' T; }/ j
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
      }break;       5 T- }& m" s& 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( G2 [+ H, a9 v7 H
{
public static void main(String arg[])3 ?& x8 a! S2 d
      {
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)1 j7 S( l3 x$ e  Q5 N/ J
            {2 B9 B$ l5 V: P
            int r=(int)(Math.random()*9)+1;
            int t=num[i];! N- D3 H, K* A( C+ @
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;1 w% T8 }: [; [0 ^7 [
      int a2 = num[3] + num[4] + num[5] ;0 ]0 C0 t; w$ u) T# J6 p# d
      int a3 = num[6] + num[7] + num[8] ;# q1 F0 a( n" h
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;2 S" ]& H5 G, l' J/ M- S* A
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;3 _, w/ r1 j$ P6 V
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)8 c/ P& L) T- Y! {. Z
         }break;          9 ^# d7 y/ L: K9 |0 d
}
}

人平

TOP