jva 104 河洛之數

1) 矩陣內數字皆不可重複出現* q9 h7 ~4 ^9 \+ x+ N' M
(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 j1029 e. T% {8 v' E
{' s5 \  b: E% v9 Y5 O
public static void main(String arg[])" \3 T" g6 B4 u# [/ D# j
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)1 f$ N# M" \0 f$ l5 f6 p
{8 h( A& k; G3 W' W9 `7 ?
int r=(int)(Math.random()*9)+1;# u+ U# {+ R; |! k  Z+ F
int t=num[i];9 W; m. Q( K: O
num[i]=num[r];! ]& V" _+ `7 l& E/ X& ^
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] ;) G8 `1 x: r8 A* H* E$ O1 v- D2 a, O
      int a4 = num[0] + num[3] + num[6] ;% k4 r+ f/ R& \8 |6 Z% k
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;5 O4 m) T& W* X0 F6 u3 _7 f! ~
      int a7 = num[0] + num[4] + num[8] ;- L" o' N' b, t* I  a* W
      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)) a; h6 X5 A" F1 w
      }break;       : s9 O8 u( f2 X$ ?
}& E# [8 R4 |# v; [7 \$ h
}

小雲雀

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
{! g5 W/ O$ \- w
public static void main(String arg[])# W% l7 C) f7 S2 o+ p2 w3 z. ?
      {6 ?6 {) W4 \: e& k- _- ]8 P2 R
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
            {
            int r=(int)(Math.random()*9)+1;
            int t=num[i];
            num[i]=num[r];" K9 z! R* q" X& l  _/ s
            num[r]=t;6 u1 d; U- ]! y! a9 f
            int a1 = num[0] + num[1] + num[2] ;  I1 X; P5 ~/ I- w5 J
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;. N' z# i, J: J& ^7 n/ P2 z1 |
      int a4 = num[0] + num[3] + num[6] ;% n7 N) e. \0 z0 Y+ @# j0 X! H
      int a5 = num[1] + num[4] + num[7] ;( R% ~) y$ [) H* N- s" V/ u
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;4 w5 E4 k9 B1 {) q
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)* W1 C) E" X% i' O3 F
         }break;
}8 v  \  C5 c6 W; L! O) }
}

人平

TOP