jva 104 河洛之數

1) 矩陣內數字皆不可重複出現+ W1 j _! k1 l \
(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+ F6 e, ^( I2 n% t" w! k' B( \' d
{
public static void main(String arg[])
{% e- k9 r; Q- c1 X$ Z
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)$ @$ d4 x- ^3 h( |7 Q3 t
{
int r=(int)(Math.random()*9)+1;
int t=num[i];
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] ;
      int a4 = num[0] + num[3] + num[6] ;0 l7 v. q2 _- P9 R. U
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;7 G3 F7 U" `% j, Q; e" p( j
      int a7 = num[0] + num[4] + num[8] ;$ o* h& y0 N6 r" Q; n7 R
      int a8 = num[2] + num[4] + num[6] ;6 f: n' ], m2 }9 I6 _
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
      }break;       # u) D- i8 ?* Z' i5 T! P
}
}

小雲雀

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
{3 Z3 S- H  y& J" a! }! B4 x5 ]$ s1 s4 F
public static void main(String arg[])# f  U7 g% L' N; [
      {  h+ {! B" O3 N' v, A" c
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)6 \9 u5 H' t! R) y+ J" ?* n
            {
            int r=(int)(Math.random()*9)+1;4 y8 z4 ~  p" e" ^( a3 b; i5 F
            int t=num[i];
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;1 s* y% p+ q- U* y2 \) V
      int a2 = num[3] + num[4] + num[5] ;7 I. a, H4 A+ q) T0 s
      int a3 = num[6] + num[7] + num[8] ;; _& I# Y0 ~7 F5 Z
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;- D/ q1 K( J3 g
      int a7 = num[0] + num[4] + num[8] ;: |, b0 Z) \+ c; f3 ?
      int a8 = num[2] + num[4] + num[6] ;2 w5 M; l1 d4 x0 |% R
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)1 W+ y. b% m+ V
         }break;          5 W' k7 a9 J: c. j7 k  T( y
}
}

人平

TOP