jva 104 河洛之數

1) 矩陣內數字皆不可重複出現
(2) 程式每次執行，矩陣數字排列皆不相同- j; o8 i1 N. b X: ?+ X
(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 j1025 K( s+ s5 w1 B! @% n' j
{+ t% X/ ^/ o4 a" J4 f* \' i, c
public static void main(String arg[])$ z9 p2 M4 i" o7 {. y/ _" V, {
{
      int num []={1,2,3,4,5,6,7,8,9};3 |0 U4 i: \" r/ D3 U2 O. b1 A
      while(trun)' \% O0 v2 N" ~; _. t
{6 C" T* D2 o" ]. U
int r=(int)(Math.random()*9)+1;1 D  j2 F2 k* w4 H# ^$ I: y
int t=num[i];
num[i]=num[r];: H( ~3 ^9 m3 Q- M5 R
num[r]=t;9 b; A% c# \0 u( @9 t# r
int a1 = num[0] + num[1] + num[2] ;+ ~* T" O9 W0 U* {9 J
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;5 W5 ?3 X8 R7 M/ V" ~
      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] ;8 s5 E" ?5 g  G1 n# b" s# p
      int a8 = num[2] + num[4] + num[6] ;. v; y  I" P1 g: d! z4 \0 l
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)5 Q3 l# J* n+ F$ W9 b
      }break;       % `( L+ q  k0 ~9 N3 J" H
}3 ~3 `$ N5 y3 O% C* N1 y% h- e
}

小雲雀

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
{$ I$ M, @& s& ^, N. }. O' y
public static void main(String arg[])
      {& J+ E3 {+ o  g4 c& s
         int num []={1,2,3,4,5,6,7,8,9};5 H4 q" d) [7 `* R/ ?% _2 P
      while(trun)9 m; l0 T$ {/ O0 [$ g
            {3 _7 A: o5 I3 r2 m: H
            int r=(int)(Math.random()*9)+1;
            int t=num[i];+ Y9 D, [0 n& y5 N( z
            num[i]=num[r];; B9 c. K: ?7 Y
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;- r/ ]3 p- z+ x/ z, H/ q9 F
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;, j% u* M" o' v' d
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;4 k- \4 c) m" E
      int a6 = num[2] + num[5] + num[8] ;+ k+ s5 }/ p% a1 Q2 @
      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)! c* Y# z$ U: R! ]# w& c
         }break;          6 H! L6 v8 o) e; O8 W' Q$ f9 g- }
}! B& z; r  |3 x! r2 Y
}

人平

TOP