jva 104 河洛之數

1) 矩陣內數字皆不可重複出現8 l; @9 @, V& T0 U2 J
(2) 程式每次執行，矩陣數字排列皆不相同% [' f+ a% i* S' 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
{4 m, e  [0 r! Z
public static void main(String arg[])
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)3 T" x9 q" Z. j2 ?' c
{7 T) F3 C, Y/ {( z1 }: u
int r=(int)(Math.random()*9)+1;! U- ?! N8 D. W7 A' R* O0 I- Z
int t=num[i];. n6 B3 L  D7 K- R" w& b& [, l7 `
num[i]=num[r];" g6 i% J* a% a
num[r]=t;0 l7 T/ v; q) M) v0 ]) Q5 h+ y) o
int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;7 t% ~. r* F) s6 V, C+ \
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;) S+ L# @  D) E) V4 R2 F
      int a5 = num[1] + num[4] + num[7] ;( M  ?0 F' I% h9 \0 H! p
      int a6 = num[2] + num[5] + num[8] ;
      int a7 = num[0] + num[4] + num[8] ;7 N" K& e, c; R+ E% v# F+ d/ O
      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;       5 \4 j. z* n5 E2 a  [2 O
}
}

小雲雀

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. Z  S5 ^) x
{
public static void main(String arg[])9 ?( _7 a* y' S8 l
      {! f9 ^' o0 e) |: V7 x& I  }
         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];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;4 ]- J  {$ Y2 w; l
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;/ F- h7 C' p8 C" \" X2 K: M
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;
      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)9 c$ F  w* p' A( U, F  U! U, n( }
         }break;
}
}

人平

TOP