jva 104 河洛之數

1) 矩陣內數字皆不可重複出現/ \/ L2 U, }) D; o
(2) 程式每次執行，矩陣數字排列皆不相同+ i, a* Y; g' k- a% ^9 u+ ]
(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
{6 z1 N- L6 `% |, e- i) R
public static void main(String arg[])
{
      int num []={1,2,3,4,5,6,7,8,9};& H# k. R& r, S- m* ^
      while(trun); @  M' s1 [0 d6 m
{
int r=(int)(Math.random()*9)+1;" N8 u; P& e- S8 y9 [
int t=num[i];
num[i]=num[r];
num[r]=t;
int a1 = num[0] + num[1] + num[2] ;( @" o4 _) N! H" H
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;! Q* `! I; X1 r$ M; B$ Y( y9 Y( m
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;& Z0 q5 {2 B4 Y
      int a6 = num[2] + num[5] + num[8] ;, k8 @' @9 A8 N
      int a7 = num[0] + num[4] + num[8] ;  M) ~; p9 z+ v" w* B
      int a8 = num[2] + num[4] + num[6] ;0 o- w6 v3 z# f/ I1 `
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)" B# u( [- B' M! e
      }break;       ( B; b0 Y6 f1 v2 @
}
}

小雲雀

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[])
      {
         int num []={1,2,3,4,5,6,7,8,9};8 P* k2 h' ?6 f# {% S! G
      while(trun)
            {" @1 ^$ Y( {: `, T- A
            int r=(int)(Math.random()*9)+1;
            int t=num[i];% ^4 X0 y$ R  l+ v- {
            num[i]=num[r];) K# o% C2 |  o4 O. [* ^: f
            num[r]=t;) g9 {( w& Q8 k/ S1 c; f
            int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;0 j' g8 T; C& X
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;/ K: ~- a( }( E. [8 s; u4 Z+ S
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;6 T* Z: f3 z# ~# m% h
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;( e  c# C: I4 H# ]6 G+ g4 }7 K6 r
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
         }break;          " f" Q# J/ l% V
}. f, L" G3 J5 Q+ r# v( w
}

人平

TOP