jva 104 河洛之數

1) 矩陣內數字皆不可重複出現
(2) 程式每次執行，矩陣數字排列皆不相同0 r5 P3 o" W- c6 T7 j
(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[])1 Z; o$ W9 _# \; M: t
{" k4 z4 ~4 e( d
      int num []={1,2,3,4,5,6,7,8,9};/ z) F$ p6 F8 B: `' L  K  m
      while(trun)
{! k# M, C5 {; g( l
int r=(int)(Math.random()*9)+1;- _+ V: K$ F# [8 `
int t=num[i];) f0 g) |1 ~5 y  `4 p' S+ h
num[i]=num[r];- h: ?4 C/ [# V; J) E' z5 z) L
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] ;) {) K: Q- N! j
      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] ;0 Y, `$ h: e8 M8 |8 V; Y3 x3 l1 ^
      int a8 = num[2] + num[4] + num[6] ;# @8 B7 W4 ^) f& g, g5 a) l8 Y" b
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
      }break;       ; b4 m3 J+ b! e7 C4 U3 s' 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 j1027 H4 l% Z* C2 G& Q
{
public static void main(String arg[])( F  }, I" [6 C0 i# K) j
      {) \# T/ n- W0 ]! s1 n0 r$ {0 T
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)1 j# j# c3 `3 j) c) k4 @
            {
            int r=(int)(Math.random()*9)+1;  k; }$ h" H- ~3 }; d
            int t=num[i];, w4 X1 m: Q& j
            num[i]=num[r];
            num[r]=t;. q$ Z' K- a7 m  o: n
            int a1 = num[0] + num[1] + num[2] ;- p  A4 I: s& q0 T; c
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;4 Q4 D& D) a! X) Z% |% u4 \
      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] ;' i- Z3 Z7 ]- F+ O% f1 h# m5 I% _' v
      int a8 = num[2] + num[4] + num[6] ;, R! \) S+ j$ g, d2 X! h' d0 X' K
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)2 I/ W% Y9 F8 [5 @( }  ?$ X
         }break;
}5 b, L; c7 n1 N+ V" ?7 N
}

人平

TOP