標題:
jva 104 河洛之數
[打印本頁]
作者:
b790113g
時間:
2011-12-31 10:58
標題:
jva 104 河洛之數
1) 矩陣內數字皆不可重複出現
. ?& p/ s2 ?5 K- r
(2) 程式每次執行,矩陣數字排列皆不相同
- d1 u0 x* w" W5 W2 \# R8 i
(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;
}
複製代碼
作者:
johnson
時間:
2011-12-31 11:35
public class j102
L7 z" M% p9 h/ C
{
+ h A1 w& o' C
public static void main(String arg[])
9 {$ T. u: F9 @; U$ n
{
6 }( \ o( C4 k4 m$ X1 \1 y! v" | P
int num []={1,2,3,4,5,6,7,8,9};
$ P' z8 b' ~6 g, m6 e. @+ w+ i
while(trun)
% J: Z2 x/ O# R4 D5 q3 K
{
: Y4 r4 A: i: M# i8 K& X/ r
int r=(int)(Math.random()*9)+1;
+ I) C6 O& b3 V! x. L2 n
int t=num[i];
" S( y! } i/ }: k
num[i]=num[r];
$ O# C; D* u% T
num[r]=t;
, p/ R* B. H" O* A( N
int a1 = num[0] + num[1] + num[2] ;
- l0 `2 D/ e/ F9 s
int a2 = num[3] + num[4] + num[5] ;
: I3 p8 I6 O! \' d! U/ w$ m
int a3 = num[6] + num[7] + num[8] ;
# K. {* s4 m9 ]; x7 S
int a4 = num[0] + num[3] + num[6] ;
6 H' ?6 C. I9 B! M$ a
int a5 = num[1] + num[4] + num[7] ;
9 B y* [- G8 M2 H- i* M- k: I
int a6 = num[2] + num[5] + num[8] ;
& |5 {; V( G% {3 X- D% I$ |
int a7 = num[0] + num[4] + num[8] ;
3 m# {6 v( J7 y3 D3 E t
int a8 = num[2] + num[4] + num[6] ;
' `7 \" D3 o! C( ]& Q a
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
* e' v' }5 @/ J; ? g l
}break;
8 C4 B2 F0 R1 X) \4 ]2 Q+ p
}
# v; w! T5 \' s8 _) N( w2 j6 ]) ^
}
作者:
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;
}
複製代碼
作者:
eric5802
時間:
2011-12-31 11:38
public class j102
- \5 w9 m ]1 R, ]
{
% t& {0 R9 r, p7 Z
public static void main(String arg[])
- Q! W) \3 \- u7 L
{
& y; R r0 K6 \- E5 i" a0 a- H
int num []={1,2,3,4,5,6,7,8,9};
7 I8 x! N) T v8 ~* M0 ^2 T% C! @
while(trun)
3 u5 c/ {6 ~2 N+ z0 W0 @
{
{( U( E. ?( P# a, V5 v$ Y
int r=(int)(Math.random()*9)+1;
# \: l) S7 Q5 w- e; a1 m- X' F
int t=num[i];
% y+ i: T, y. ?' ^9 ?0 x
num[i]=num[r];
7 w& }+ J+ e# l' \
num[r]=t;
, S: w% P0 X# x) w( x. G
int a1 = num[0] + num[1] + num[2] ;
& K2 x: S" X* k
int a2 = num[3] + num[4] + num[5] ;
6 } V. o/ I3 G( C- a
int a3 = num[6] + num[7] + num[8] ;
4 D, Y: i' k/ p* C4 q C
int a4 = num[0] + num[3] + num[6] ;
+ L0 Q$ s' o$ r8 G* O
int a5 = num[1] + num[4] + num[7] ;
/ o/ D* ~; Q4 m5 s, m8 |
int a6 = num[2] + num[5] + num[8] ;
( d5 s/ p5 }9 k# G4 [ v% [, J& [
int a7 = num[0] + num[4] + num[8] ;
* ~+ I6 @0 u& Y3 s. |% J
int a8 = num[2] + num[4] + num[6] ;
+ l3 W' q5 O/ u; X5 e
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
# f- F: o8 ^$ B
}break;
$ H X( {" L' H9 m" T
}
/ @ W, C6 J, |: G7 ?6 Y% K
}
作者:
TOM
時間:
2011-12-31 11:49
public class j104
{
public static void main(String[]arg)
{
int num[]={1,2,3,4,5,6,7,8,9};
while(true)
{
for(int i=0;i<9;i++)
{
int r=(int)(Math.random()*9);
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];
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 ;
}
System.out.println("答案為:");
System.out.println(num[0]+" "+num[1]+" "+num[2]);
System.out.println(num[3]+" "+num[4]+" "+num[4]);
System.out.println(num[5]+" "+num[6]+" "+num[7]);
}
}
}
複製代碼
作者:
may
時間:
2011-12-31 12:18
[attach]563[/attach]
作者:
may
時間:
2012-1-4 17:04
[attach]564[/attach]
作者:
lon
時間:
2012-1-4 17:11
[attach]565[/attach]
作者:
may
時間:
2012-1-4 17:24
[attach]566[/attach]
作者:
kim
時間:
2012-4-4 11:44
http://site.istak.org.tw/bbs/att ... 3D&noupdate=yes
歡迎光臨 種子論壇 | 高雄市資訊培育協會學員討論區 (http://istak.org.tw/seed/)
Powered by Discuz! 7.2