jva 104 河洛之數

1) 矩陣內數字皆不可重複出現
(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
{
public static void main(String arg[])! i% O$ J8 \, n: S
{$ o% x* b0 d9 z3 v! Z7 }' H
      int num []={1,2,3,4,5,6,7,8,9};! |+ E* X' a; A7 r
      while(trun)% |( ?4 y& K" D* O  |
{
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] ;# q8 Q5 X0 {) ^3 S5 @
      int a4 = num[0] + num[3] + num[6] ;) R& v$ o: K  @
      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] ;# Q/ Q5 m7 q) ?5 H1 R7 l4 J) I
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
      }break;
}
}

小雲雀

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
{" u2 ^3 y3 i7 z7 p# o1 j/ _
public static void main(String arg[]); m) ?; n4 Z' u3 Q  {9 g
      {
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)7 s6 t$ z5 ^. J9 V
            {+ F$ G1 M: e7 ~
            int r=(int)(Math.random()*9)+1;
            int t=num[i];( j/ n+ a$ Y5 R! n) n* o& ^" Z
            num[i]=num[r];
            num[r]=t;+ g9 D& ]2 m) @  r3 t4 @) E( G$ |
            int a1 = num[0] + num[1] + num[2] ;7 n) }$ p- M% f; Q
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;
      int a4 = num[0] + num[3] + num[6] ;: J* R% q4 H( e4 f2 n# J( d
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;) ^# Q  ?5 @- D' n" I
      int a7 = num[0] + num[4] + num[8] ;
      int a8 = num[2] + num[4] + num[6] ;+ C# @5 t/ f( b1 R* x
            if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)! K1 t+ r" L2 M
         }break;
}
}

人平

TOP