jva 104 河洛之數

1) 矩陣內數字皆不可重複出現 I" `6 E5 U8 }4 {: M' g; X' e
(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
{
public static void main(String arg[])' ~& t8 N; i& I6 ^
{
      int num []={1,2,3,4,5,6,7,8,9};4 _1 F. A$ X4 i5 v5 ^
      while(trun)
{
int r=(int)(Math.random()*9)+1;# t  l: k5 V, b# |/ l" u  V2 `
int t=num[i];& d' ]3 |1 q1 n5 @% y% e) H
num[i]=num[r];
num[r]=t;5 l$ J: Z$ T- h
int a1 = num[0] + num[1] + num[2] ;  q5 t8 J4 x- y, L( m+ z* S8 U5 [
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;$ g. w9 g/ O8 y2 \3 u( v/ {
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;) B: C9 ^' t# D  X* _, g/ U6 x& A
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;6 A8 ?2 @/ K1 S- e; V3 ^5 f
      int a8 = num[2] + num[4] + num[6] ;" W2 }& |3 Z) q' A3 @+ S
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)# ~& U" U3 Q1 R/ r6 p6 k  y
      }break;       & r2 f& p. F0 o" j
}: `  u- J* X; S9 v7 }
}

小雲雀

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 A& k9 c5 w, C* s* w
{
public static void main(String arg[])
      {6 i, }( `. l. @+ ?: j% m3 N
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)/ g9 l% ~1 a3 r0 A! J! y; K
            {4 w) B4 ^) {# B+ m
            int r=(int)(Math.random()*9)+1;
            int t=num[i];
            num[i]=num[r];
            num[r]=t;5 C4 M7 N0 x  R: w# b
            int a1 = num[0] + num[1] + num[2] ;% o, _+ e( p+ L
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;9 B: W* C+ M5 P5 @
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;  T, V  @1 h6 y% t+ t; V# i
      int a6 = num[2] + num[5] + num[8] ;/ }7 _+ j) p, d) w; z" z0 p
      int a7 = num[0] + num[4] + num[8] ;4 d5 J# z+ W! x9 G- E" I
      int a8 = num[2] + num[4] + num[6] ;! i4 j6 X: M6 s! R% j$ V
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
         }break;          7 O" I! w: q) k; P( l# t
}
}

人平

TOP