jva 104 河洛之數

1) 矩陣內數字皆不可重複出現
(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$ M! v! e2 J9 {' P+ {( y
{
public static void main(String arg[]); Z( B+ k. }$ M; o4 n" ]% Z
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)1 U2 e. h- t+ p  x, H9 M! W
{3 Y0 u; X+ n$ j/ d- r8 e
int r=(int)(Math.random()*9)+1;; `* E9 \& @" |7 F5 l: F
int t=num[i];
num[i]=num[r];- Q4 A2 K( I; h' k
num[r]=t;  t. L) l3 o* a9 a8 w; E
int a1 = num[0] + num[1] + num[2] ;4 d/ |: A; s/ W& K
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;' V, \! ^& p2 N+ [
      int a4 = num[0] + num[3] + num[6] ;/ V& m2 o2 E3 \/ `; v1 x
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;$ E" O" w9 F. V5 X4 S5 b
      int a7 = num[0] + num[4] + num[8] ;% ]  n0 ?$ K- v5 m
      int a8 = num[2] + num[4] + num[6] ;8 K( a) _5 Z8 ?- v2 L" @3 t
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)  z& u0 e6 G9 i# E# n0 d) m6 r
      }break;
}( Z, |8 }, d# Y( }! F* h; V
}

小雲雀

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
{9 F3 H' J) _# z1 n
public static void main(String arg[])
      {
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;
            int t=num[i];7 I8 Q8 l, A& z, r
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;. x  r  D: {' _  J9 I7 l, ~
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;# Z8 a- F+ d9 i; {0 M2 l/ ^( b
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;& }+ F. [1 t: A3 B& I& S7 M
      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;          4 C% D- q; \8 a$ s  K
}
}

人平

TOP