jva 104 河洛之數

1) 矩陣內數字皆不可重複出現* I9 J7 }' \ U4 f- o' X8 f) `
(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 j1025 ~" a/ Y. }* X! `3 S# J
{& k" i6 d- A% Z) R- P; ~7 G
public static void main(String arg[])+ M1 n1 j9 }* E& k
{% }4 i, j! i$ _
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
{
int r=(int)(Math.random()*9)+1;
int t=num[i];! |, b& H% O  O$ ]7 n
num[i]=num[r];) O, N) S- o) w$ e* r
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] ;+ Z! R  y. ~- d' ?* G) Y
      int a4 = num[0] + num[3] + num[6] ;( G6 I* V. u+ ]( E/ u) W# P
      int a5 = num[1] + num[4] + num[7] ;! ]" T* ?2 \6 f. h$ G+ ~# u% k3 k: }5 M$ @
      int a6 = num[2] + num[5] + num[8] ;/ b; }# ?; t+ F+ j" d
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;* m0 p$ q: g0 o# s  d
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
      }break;       ' I; F/ ~; a- M+ Q" j. g: D8 b
}; d) L; ]* S- Q$ z: D- 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
{
public static void main(String arg[])7 w% T* c1 X' y# \$ w
      {
         int num []={1,2,3,4,5,6,7,8,9};0 h7 ?0 I# O/ [, {
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;
            int t=num[i];
            num[i]=num[r];! p4 N$ T% c4 w* e; ]4 J6 x* y
            num[r]=t;. _" i8 R! y& a7 `
            int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;; z7 V3 P0 ^  `
      int a4 = num[0] + num[3] + num[6] ;( J: b3 H$ B$ f# r" ^1 W
      int a5 = num[1] + num[4] + num[7] ;" V( I8 h# L( T+ g1 p' Y2 `
      int a6 = num[2] + num[5] + num[8] ;
      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)
         }break;             V' {% T7 B0 D; Q& |" m
}
}

人平

TOP