標題:
jva 104 河洛之數
[打印本頁]
作者:
b790113g
時間:
2011-12-31 10:58
標題:
jva 104 河洛之數
1) 矩陣內數字皆不可重複出現
$ K5 n! i" f/ f5 _) T
(2) 程式每次執行,矩陣數字排列皆不相同
* p. e: r' I$ E
(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
" u, n; ?6 W) Z/ c# U" v8 c
{
* c5 e6 l9 i1 P5 v& ^6 [" Y) T8 m# f
public static void main(String arg[])
: Z; d" ^' n+ a; m, x
{
& f# U/ U5 _* ` s U3 M+ Q- p; N+ ?
int num []={1,2,3,4,5,6,7,8,9};
5 G0 a3 S* [! o% w: @3 I# x
while(trun)
3 q& [# o y( ~
{
/ K& X/ O* R0 x
int r=(int)(Math.random()*9)+1;
9 j$ D* j) ?6 H3 B/ Z
int t=num[i];
# s6 C D4 {; M! T* @8 ?- C* O$ m
num[i]=num[r];
! N K3 ^/ F- \3 k0 |
num[r]=t;
5 X. F! u0 c# q t+ F; k
int a1 = num[0] + num[1] + num[2] ;
6 ~! J/ S$ i+ U! m
int a2 = num[3] + num[4] + num[5] ;
$ o2 A2 ~0 ^2 T/ u' s* `- p
int a3 = num[6] + num[7] + num[8] ;
8 z5 L: t) L4 E: c/ r/ ~! R" W
int a4 = num[0] + num[3] + num[6] ;
5 |. q! u) M! C8 ^2 l
int a5 = num[1] + num[4] + num[7] ;
W5 B9 y6 w% P
int a6 = num[2] + num[5] + num[8] ;
* z, n, D! X+ K y% ~. g3 g
int a7 = num[0] + num[4] + num[8] ;
! \, i: w. M9 Z
int a8 = num[2] + num[4] + num[6] ;
/ q( F8 z- S+ q
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
1 c9 P( i& T( R2 U
}break;
* a1 {$ X. U0 g! G4 k
}
6 {. U! t: P% `4 N7 @
}
作者:
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
$ P8 {' O- @6 |, o0 d
{
}% K' C1 k3 Y/ [" i- B8 v
public static void main(String arg[])
+ e: n9 ?+ d" P
{
4 G% z7 u) J9 a* m
int num []={1,2,3,4,5,6,7,8,9};
( Z, F7 j8 x, _! d6 C
while(trun)
) L4 n7 H' n$ Y" F* ?* I
{
% N7 U7 r$ \$ F: d: [* T2 Z6 ^
int r=(int)(Math.random()*9)+1;
: i$ F( M9 ~/ v% P. p5 m) t( A
int t=num[i];
/ ?5 m! T. [! M2 t/ L
num[i]=num[r];
' f1 d* e; N* O O/ {/ W
num[r]=t;
O9 O) Z2 P( U/ M* @1 ^
int a1 = num[0] + num[1] + num[2] ;
: H# c. z# g! N0 f, y. T
int a2 = num[3] + num[4] + num[5] ;
5 N1 h% x, ^5 Z" z& o
int a3 = num[6] + num[7] + num[8] ;
9 D5 ]& R x8 { J1 s, b( Z
int a4 = num[0] + num[3] + num[6] ;
^6 W' b f6 B$ P1 \$ A7 Z: b
int a5 = num[1] + num[4] + num[7] ;
; g& l* ^2 j1 `6 ~2 n
int a6 = num[2] + num[5] + num[8] ;
}- \! X e1 G
int a7 = num[0] + num[4] + num[8] ;
5 h6 i. n% ^- w1 o
int a8 = num[2] + num[4] + num[6] ;
2 z; D2 h# n8 `
if(a1==15&&a2==15&&a3==15&&a4==15&&a5==15&&a6==15&&a7==15&&a8==15)
( l+ [; b. D1 s* z3 y6 c9 w, m( }
}break;
) ]* p% n5 |4 Z. V* F9 E
}
& [8 t5 e" j6 @6 e1 d( }/ L/ T
}
作者:
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