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/ V+ G4 o0 K( `) _5 L4 }
{& z8 ~5 Q2 V! f
public static void main(String arg[])
{
      int num []={1,2,3,4,5,6,7,8,9};
      while(trun)
{1 W* F/ \. r' w7 y
int r=(int)(Math.random()*9)+1;
int t=num[i];. R" x1 y( s, L6 @2 d5 d2 Y, W
num[i]=num[r];
num[r]=t;) E' Q8 @2 r; E6 ^7 {
int a1 = num[0] + num[1] + num[2] ;
      int a2 = num[3] + num[4] + num[5] ;, L/ Z( V) Q$ u8 F' ~
      int a3 = num[6] + num[7] + num[8] ;5 }$ {( e( h; ?( N# X
      int a4 = num[0] + num[3] + num[6] ;
      int a5 = num[1] + num[4] + num[7] ;
      int a6 = num[2] + num[5] + num[8] ;2 z+ P2 p8 }4 E2 _4 F) F% v9 `
      int a7 = num[0] + num[4] + num[8] ;" {% V" D5 h& P/ U) R
      int a8 = num[2] + num[4] + num[6] ;, a# d' X! G& r& q& B
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15), h+ n3 I# a7 u$ P( [9 B
      }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
{9 Z0 J; h- P/ C" b2 F. P" a
public static void main(String arg[])' `5 z$ m% h: l% v: k
      {! K7 _; J, ~2 |) H1 U& u
         int num []={1,2,3,4,5,6,7,8,9};
      while(trun)! L9 d5 A7 B1 X. u- |
            {4 S8 I+ W: f) ?+ z# J: |
            int r=(int)(Math.random()*9)+1;
            int t=num[i];$ O7 d8 b, q# q  l" w0 [
            num[i]=num[r];
            num[r]=t;
            int a1 = num[0] + num[1] + num[2] ;$ ?* F3 X, f8 t4 X% Y9 I
      int a2 = num[3] + num[4] + num[5] ;
      int a3 = num[6] + num[7] + num[8] ;
      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)
         }break;          ( O$ H$ `( w/ o+ `
}
}

人平

TOP