jva 104 河洛之數

1) 矩陣內數字皆不可重複出現; R5 q1 B3 p4 ]( Y7 t! O8 z: |
(2) 程式每次執行，矩陣數字排列皆不相同5 F) f; {: p- L' b+ ~+ w
(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[]): ]  H$ S- Q0 i& L- @
{
      int num []={1,2,3,4,5,6,7,8,9};$ D- [- P& m* b) f
      while(trun)% t/ F1 H, S4 F5 w0 \/ y5 M
{& h3 R4 |* I5 X8 [' v
int r=(int)(Math.random()*9)+1;
int t=num[i];& `3 E2 Y8 N1 G2 A# n( A
num[i]=num[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] ;+ \1 P/ d2 |5 e$ o
      int a4 = num[0] + num[3] + num[6] ;5 j# N2 Z/ r4 q- {, |
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;# W2 l8 s( {" f6 K* P2 I0 i' l
      int a8 = num[2] + num[4] + num[6] ;* \8 a. ~/ l( J" q6 j
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15), X5 T  b7 ?3 L( Y0 J5 E6 ^4 j
      }break;
}, g& y" _" }5 M: x- K1 [! I/ 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 j102
{( Y, H( g% F7 T
public static void main(String arg[])  ^3 U  ^" I( Z4 y' u. E% d! s
      {/ N+ g6 }+ W6 `$ U
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)# Y7 ^7 ^0 W* j/ A
            {9 h/ P  `( ?5 d
            int r=(int)(Math.random()*9)+1;
            int t=num[i];. S( i4 H* \" Z# H% M
            num[i]=num[r];$ p( p# S6 c3 g% I. _/ P
            num[r]=t;& ]' K3 m- ]9 e3 Q, [3 D5 m
            int a1 = num[0] + num[1] + num[2] ;$ d, h& q) t3 Y8 `* f0 e" t* T! u. Y
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;. e+ {5 p2 L. @
      int a4 = num[0] + num[3] + num[6] ;% I/ W# K1 x  N# S9 m/ z; t, @
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;. |' H0 q2 T+ b) I, n
      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;
}
}

人平

TOP