jva 104 河洛之數

1) 矩陣內數字皆不可重複出現- f' f0 W6 A7 q' C& j
(2) 程式每次執行，矩陣數字排列皆不相同+ E, G( \5 r, U+ S4 I
(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[])! |0 O6 R0 i) E+ I5 S
{! b' L; M/ G/ q
      int num []={1,2,3,4,5,6,7,8,9};( A/ ]; a! j7 c) h5 i  ]6 @
      while(trun)+ y' W) _, J* }' [
{
int r=(int)(Math.random()*9)+1;
int t=num[i];* P3 n( L  d# v% h) J
num[i]=num[r];: N' j6 j) Z' P4 Q% E+ J
num[r]=t;1 I3 q9 u5 Z( Q8 {
int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;! t3 u2 z" G( {. ~7 m
      int a3 = num[6] + num[7] + num[8] ;* Z& O# i' `# [4 L) k- A8 J4 S
      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] ;% c4 G- r' b* \
      int a8 = num[2] + num[4] + num[6] ;/ L% k: h1 \1 J7 B  J" x
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)1 M1 m: T, ~+ n" L1 }9 n8 R
      }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
{
public static void main(String arg[]), a0 L* l0 t% E" ^; v* b2 c
      {7 ?' Y* E( `5 i% s, l
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;- l/ |8 t' V4 {7 n& `0 b$ R
            int t=num[i];
            num[i]=num[r];! I  K4 r9 N, m& N& N
            num[r]=t;: r: b- p4 ^* w
            int a1 = num[0] + num[1] + num[2] ;  k$ j* j) T" J# ]7 k
      int a2 = num[3] + num[4] + num[5] ;
      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] ;: f" y8 a* }8 {* K! P' ]. s
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;; W8 b+ {& L$ g0 H! R
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
         }break;          : e; x  R! u0 {7 A4 Q
}
}

人平

TOP