: Java JavaSript
|
|
|
- きみお はぎにわ
- 7 years ago
- Views:
Transcription
1 MH04
2 : Java JavaSript : : A Battle Ship 38 A.1 Practice A.2 Verification A.3 Score A A A B 62 B B.2 Verification B.3 Score B
3 C Battle Ship 72 C C C.3 Practice C.4 Verification C.5 Score C D Battle Ship 118 D D D.3 Practice D.4 Verification D.5 Score D
4
5 1 Web [1 3] [4] [5, 6] 1
![[5, 6] 1](/docs-images/42/20794283/images/page_5.jpg)
6 2 3 3 [4,5] [4] 2
7 3 3.1 : [4] on Squeak 3
8 3.2 Java [5] 5 2 Web Web 4
9 3.3 [6] 3 1 a4w 3 5
10 3.4 JavaSript [7] [8] ( ) GUI JavaScript JavaScript JavaScript C 6
11
12 4 4.1 Battle Ship Battle Ship * *2 Battle Ship 4.2 Battle Ship 10 (5 ) (4 ) (3 ) (3 ) (2 ) 1 1 *1 *2 8
13 Practice Verification Score Verification Score Battle Ship shoot terminal 9
14 4.3.1 Practice Battle Ship Practice 1 1 Practice
15 4.3.2 Verification Verification 2 2 Verification Enter 11
16 4.3.3 Score shoot Score
17 4.4 Battle Ship (2010 ) Python Python C Python Python 4.3 Battle Ship 3 Python C 2 13
18 C C F000: F001: 1 F002: 2 F003: 2 1 F004: 3 F005: 3 1 F006: 4 F007: 4 1 F008: F009: F010: 4 F011: 4 F012: 4 F013:
19 #include <stdio.h> #include <stdlib.h> #include <time.h> #include "senkan.h" void shoot () F009 F005 F003 F007 F010 F012 F011 F013 return; 15
20 4.5.2 C sb i kekka gx gy at flg, HP (, 0 ) skp 5 jkp 4 kkp 3 smp 2 ysp 2 N 0 // BM 1 // BH 2 // SK 11 // length:5 JK 12 // length:4 KK 13 // length:3 SM 14 // length:3 YS 15 // length:2 random100() : oneskip() : 1 twoskip() : 2 tworight() : 2 1 threeskip() : 3 16
21 threeright() : 3 1 fourskip() : 4 fourright() : 4 1 oddskip() : evenskip() : upat() : 4 rightat() : 4 downat() : 4 leftat() :
22 #include <stdio.h> #include <stdlib.h> #include <time.h> #include "senkan.h" void shoot () if (!at_flg && kekka == BM) bx = gx; by = gy; at_flg = 1; else if (at_flg && kekka == BH) at_flg = 0; if (at_flg) upat(); else random100(); return; 18
23 4.5.3 Battle Ship Battle Ship
24 : 1 Python Battle Ship 2 1 Battle Ship
25 : 16 1 Battle Ship Python Python Python Python 1 1 Python
26 ( ) Python 6 C 22
27 5.2 2 : 2 :
28 : 1 C C Python C Python ( )
29 8 ( ) Python 8 25
30 5.3 [4] 26
31 C C 2 27
32 ? ?
33 12? ?
34
35
36 ? ? ? ?
37 C
38 * C Python *3 34
39 C C Battle Ship 35
40 team.andrew ML 36
41 [1] Jeff Atwood. Why can t programmers.. program? Feb [2] html, July [3] [4],,,. :., 49, pp , [5],,. java., 108, pp. 1 8, [6].., [7]. Javascript., 26, pp. 1 10, [8] [9]. JavaScript.,
42 A Battle Ship A.1 Practice A.1.1 practice.py #!/usr/bin/env python # -*- coding: utf-8 -*- ############################################################################### # Battleship game module # # # initialization # - dispositionofship # # # displaysubmarine # - attackstatement ############################################################################### import sys import random #from shoot import shoot # TATE = 10 YOKO = 10 # & ODD_NUMBER = 7 EVEN_NUMBER = 8 # N = 0 HIT = 1 MISS = 2 # WARSHIP = 11 CRUISER = 12 DESTROYER = 13 SUBMARINE = 14 38
43 TRANSPORTS = 15 BATTLESHIP = [TRANSPORTS, SUBMARINE, DESTROYER, CRUISER, WARSHIP] # HP warshipp = 5 cruiserp = 4 destroyerp = 3 submarinep = 3 transportsp = 2 submarineflg = 0 def initialization (): global submarineflg submarine = [[ N for i in range (0, TATE)] for j in range (0, YOKO)] if submarineflg == 0: submarineflg = 1 return submarine [:] for ship in [warshipp, cruiserp, destroyerp, submarinep, transportsp]: battleship = BATTLESHIP.pop() dispositionofship (ship, battleship, submarine) return submarine [:] def dispositionofship (ship, battleship, submarine): shiplength = range (0, ship) if random.randint (ODD_NUMBER, EVEN_NUMBER) == EVEN_NUMBER: while 1: judge = 0 y = random.randint (0, TATE-1) x = random.randint (0, YOKO-1 - ship) # for i in shiplength: judge += submarine [y][x+i] # if judge == N: for i in shiplength: submarine [y][x+i] = battleship return else : while 1: judge = 0 y = random.randint (0, TATE-1 - ship) 39
44 x = random.randint (0, YOKO-1) # for i in shiplength: judge += submarine [y+i][x] # if judge == N: for i in shiplength: submarine [y+i][x] = battleship return def displaysubmarine (table, submarine): sys.stdout.write (" \n") sys.stdout.write (" \n") # for y in range (TATE): sys.stdout.write ("%2d" % (y+1)) for x in range (YOKO): sys.stdout.write (" ") attackstatement (y, x, table, submarine) sys.stdout.write (" \n") sys.stdout.write (" \n") def attackstatement (y, x, table, submarine): if submarine [y][x] == HIT: if table [y][x] == WARSHIP: if warshipp == 0: sys.stdout.write ("5") else : sys.stdout.write ("1") elif table [y][x] == CRUISER: if cruiserp == 0: sys.stdout.write ("4") else : sys.stdout.write ("1") elif table [y][x] == DESTROYER: if destroyerp == 0: sys.stdout.write ("3") else : sys.stdout.write ("1") elif table [y][x] == SUBMARINE: if submarinep == 0: sys.stdout.write ("3") 40
45 else : sys.stdout.write ("1") elif table [y][x] == TRANSPORTS: if transportsp == 0: sys.stdout.write ("2") else : sys.stdout.write ("1") elif submarine [y][x] == MISS: sys.stdout.write ("x") else : sys.stdout.write (" ") def leftoverenemy (): if (warshipp <= 0 and cruiserp <= 0 and destroyerp <= 0 and submarinep <= 0 and transportsp <= 0): sys.stdout.write ("!") return True sys.stdout.write (" = ") if warshipp > 0: sys.stdout.write (", ") if cruiserp > 0: sys.stdout.write (", ") if destroyerp > 0: sys.stdout.write (", ") if submarinep > 0: sys.stdout.write (", ") if transportsp > 0: sys.stdout.write (" ") sys.stdout.write ("\n") def hitjudgement (table, submarine): noneattack = submarine [y][x] damage = table [y][x] global warshipp, cruiserp, destroyerp, submarinep, transportsp if noneattack!= N: return MISS else: if damage == WARSHIP: submarine [y][x] = HIT warshipp -= 1 return WARSHIP elif damage == CRUISER: submarine [y][x] = HIT cruiserp -= 1 return CRUISER elif damage == DESTROYER: 41
46 submarine [y][x] = HIT destroyerp -= 1 return DESTROYER elif damage == SUBMARINE: submarine [y][x] = HIT submarinep -= 1 return SUBMARINE elif damage == TRANSPORTS: submarine [y][x] = HIT transportsp -= 1 return TRANSPORTS submarine [y][x] = MISS return MISS def hitdisplay (result): if result == MISS: sys.stdout.write ("!\n") return MISS elif WARSHIP <= result <= TRANSPORTS: sys.stdout.write ("!") if result == WARSHIP and warshipp <= 0: sys.stdout.write ("!\n") return WARSHIP elif result == CRUISER and cruiserp <= 0: sys.stdout.write ("!\n") return CRUISER elif result == DESTROYER and destroyerp <= 0: sys.stdout.write ("!\n") return DESTROYER elif result == SUBMARINE and submarinep <= 0: sys.stdout.write ("!\n") return SUBMARINE elif result == TRANSPORTS and transportsp <= 0: sys.stdout.write ("!\n") return TRANSPORTS sys.stdout.write ("\n") return HIT INITIAL_SHOOT = 0 SECOND_SHOOT = 1 FINISH_SHOOT =
47 # y = 0 x = 0 submarine = initialization () table = initialization () leftoverenemy () #shoot (INITIAL_SHOOT, submarine, MISS) displaysubmarine (table, submarine) while True: try: x = (int (raw_input(" X: ")) -1) y = (int (raw_input(" Y: ")) -1) if (0 <= x and x < 10) and (0 <= x and x < 10): break except ValueError: print " " result_tmp = hitjudgement (table, submarine) displaysubmarine (table, submarine) result = hitdisplay(result_tmp) print " : %d" % (INITIAL_SHOOT+1) for i in range(second_shoot, FINISH_SHOOT): while True: try: x = (int (raw_input(" X: ")) -1) y = (int (raw_input(" Y: ")) -1) if ((0 <= x and x < 10) and (0 <= x and x < 10)) and \ (submarine[y][x] == 0): break except ValueError: print "Error: " result_tmp = hitjudgement (table, submarine) displaysubmarine (table, submarine) result = hitdisplay(result_tmp) print " : %d" % (i+1) # if leftoverenemy (): break 43
48 sys.stdout.write (" = %d\n" % i+1) 44
49 A.2 Verification A.2.1 verification.py #!/usr/bin/env python # -*- coding: utf-8 -*- ############################################################################### # Battleship game module # # # initialization # - dispositionofship # # # displaysubmarine # - attackstatement ############################################################################### import sys import random from shoot import shoot # TATE = 10 YOKO = 10 # & ODD_NUMBER = 7 EVEN_NUMBER = 8 # N = 0 HIT = 1 MISS = 2 # WARSHIP = 11 CRUISER = 12 DESTROYER = 13 SUBMARINE = 14 TRANSPORTS = 15 45
50 BATTLESHIP = [TRANSPORTS, SUBMARINE, DESTROYER, CRUISER, WARSHIP] # HP warshipp = 5 cruiserp = 4 destroyerp = 3 submarinep = 3 transportsp = 2 submarineflg = 0 def initialization (): global submarineflg submarine = [[ N for i in range (0, TATE)] for j in range (0, YOKO)] if submarineflg == 0: submarineflg = 1 return submarine [:] for ship in [warshipp, cruiserp, destroyerp, submarinep, transportsp]: battleship = BATTLESHIP.pop() dispositionofship (ship, battleship, submarine) return submarine [:] def dispositionofship (ship, battleship, submarine): shiplength = range (0, ship) if random.randint (ODD_NUMBER, EVEN_NUMBER) == EVEN_NUMBER: while 1: judge = 0 y = random.randint (0, TATE-1) x = random.randint (0, YOKO-1 - ship) # for i in shiplength: judge += submarine [y][x+i] # if judge == N: for i in shiplength: submarine [y][x+i] = battleship return else : while 1: judge = 0 y = random.randint (0, TATE-1 - ship) x = random.randint (0, YOKO-1) # 46
51 for i in shiplength: judge += submarine [y+i][x] # if judge == N: for i in shiplength: submarine [y+i][x] = battleship return def displaysubmarine (table, submarine): sys.stdout.write (" \n") sys.stdout.write (" \n") # for y in range (TATE): sys.stdout.write ("%2d" % (y+1)) for x in range (YOKO): sys.stdout.write (" ") attackstatement (y, x, table, submarine) sys.stdout.write (" \n") sys.stdout.write (" \n") def attackstatement (y, x, table, submarine): if submarine [y][x] == HIT: if table [y][x] == WARSHIP: if warshipp == 0: sys.stdout.write ("5") else : sys.stdout.write ("1") elif table [y][x] == CRUISER: if cruiserp == 0: sys.stdout.write ("4") else : sys.stdout.write ("1") elif table [y][x] == DESTROYER: if destroyerp == 0: sys.stdout.write ("3") else : sys.stdout.write ("1") elif table [y][x] == SUBMARINE: if submarinep == 0: sys.stdout.write ("3") else : sys.stdout.write ("1") 47
52 elif table [y][x] == TRANSPORTS: if transportsp == 0: sys.stdout.write ("2") else : sys.stdout.write ("1") elif submarine [y][x] == MISS: sys.stdout.write ("x") else : sys.stdout.write (" ") def leftoverenemy (): if (warshipp <= 0 and cruiserp <= 0 and destroyerp <= 0 and submarinep <= 0 and transportsp <= 0): sys.stdout.write ("!\n") return True sys.stdout.write (" = ") if warshipp > 0: sys.stdout.write (", ") if cruiserp > 0: sys.stdout.write (", ") if destroyerp > 0: sys.stdout.write (", ") if submarinep > 0: sys.stdout.write (", ") if transportsp > 0: sys.stdout.write (" ") sys.stdout.write ("\n") def hitjudgement (table, submarine): noneattack = submarine [y][x] damage = table [y][x] global warshipp, cruiserp, destroyerp, submarinep, transportsp if noneattack!= N: return MISS else: if damage == WARSHIP: submarine [y][x] = HIT warshipp -= 1 return WARSHIP elif damage == CRUISER: submarine [y][x] = HIT cruiserp -= 1 return CRUISER elif damage == DESTROYER: submarine [y][x] = HIT destroyerp -= 1 48
53 return DESTROYER elif damage == SUBMARINE: submarine [y][x] = HIT submarinep -= 1 return SUBMARINE elif damage == TRANSPORTS: submarine [y][x] = HIT transportsp -= 1 return TRANSPORTS submarine [y][x] = MISS return MISS def hitdisplay (result): if result == MISS: sys.stdout.write ("!\n") return MISS elif WARSHIP <= result <= TRANSPORTS: sys.stdout.write ("!\n") if result == WARSHIP and warshipp <= 0: sys.stdout.write ("!\n") return WARSHIP elif result == CRUISER and cruiserp <= 0: sys.stdout.write ("!\n") return CRUISER elif result == DESTROYER and destroyerp <= 0: sys.stdout.write ("!\n") return DESTROYER elif result == SUBMARINE and submarinep <= 0: sys.stdout.write ("!\n") return SUBMARINE elif result == TRANSPORTS and transportsp <= 0: sys.stdout.write ("!\n") return TRANSPORTS sys.stdout.write ("\n") return HIT INITIAL_SHOOT = 0 SECOND_SHOOT = 1 FINISH_SHOOT = 100 submarine = initialization () table = initialization () 49
54 # y = 0 x = 0 leftoverenemy () y, x = shoot (INITIAL_SHOOT, submarine, MISS, y, x) displaysubmarine (table, submarine) sys.stdout.write (raw_input("press any key to continue...\n")) result_tmp = hitjudgement (table, submarine) displaysubmarine (table, submarine) result = hitdisplay(result_tmp) print " %3d, X:%d Y:%d" % (1, x, y) for i in range(second_shoot, FINISH_SHOOT): sys.stdout.write (raw_input("press any key to continue...\n")) y, x = shoot (i, submarine, result, y, x) # test: result_tmp = hitjudgement (table, submarine) displaysubmarine (table, submarine) result = hitdisplay(result_tmp) print " %3d, X:%d Y:%d" % (i+1, x, y) # if leftoverenemy (): break sys.stdout.write (" = %d\n" % (i+1)) 50
55 A.3 Score A.3.1 score.py #!/usr/bin/env python # -*- coding: utf-8 -*- ############################################################################### # Battleship game module # # # initialization # - dispositionofship # # # displaysubmarine # - attackstatement ############################################################################### import sys import random from shoot import shoot # TATE = 10 YOKO = 10 # & ODD_NUMBER = 7 EVEN_NUMBER = 8 # N = 0 HIT = 1 MISS = 2 # WARSHIP = 11 CRUISER = 12 DESTROYER = 13 SUBMARINE = 14 TRANSPORTS = 15 51
56 submarineflg = 0 sum = 0 def initialization (): global submarineflg submarine = [[ N for i in range (0, TATE)] for j in range (0, YOKO)] if submarineflg == 0: submarineflg = 1 return submarine [:] for ship in [warshipp, cruiserp, destroyerp, submarinep, transportsp]: battleship = BATTLESHIP.pop() dispositionofship (ship, battleship, submarine) return submarine [:] def dispositionofship (ship, battleship, submarine): shiplength = range (0, ship) if random.randint (ODD_NUMBER, EVEN_NUMBER) == EVEN_NUMBER: while 1: judge = 0 y = random.randint (0, TATE-1) x = random.randint (0, YOKO-1 - ship) # for i in shiplength: judge += submarine [y][x+i] # if judge == N: for i in shiplength: submarine [y][x+i] = battleship return else : while 1: judge = 0 y = random.randint (0, TATE-1 - ship) x = random.randint (0, YOKO-1) # for i in shiplength: judge += submarine [y+i][x] # if judge == N: for i in shiplength: submarine [y+i][x] = battleship return """ 52
57 def displaysubmarine (table, submarine): sys.stdout.write (" \n") sys.stdout.write (" \n") # for y in range (TATE): sys.stdout.write ("%2d" % (y+1)) for x in range (YOKO): sys.stdout.write (" ") attackstatement (y, x, table, submarine) sys.stdout.write (" \n") sys.stdout.write (" \n") def attackstatement (y, x, table, submarine): if submarine [y][x] == HIT: if table [y][x] == WARSHIP: if warshipp == 0: sys.stdout.write ("5") else : sys.stdout.write ("1") elif table [y][x] == CRUISER: if cruiserp == 0: sys.stdout.write ("4") else : sys.stdout.write ("1") elif table [y][x] == DESTROYER: if destroyerp == 0: sys.stdout.write ("3") else : sys.stdout.write ("1") elif table [y][x] == SUBMARINE: if submarinep == 0: sys.stdout.write ("3") else : sys.stdout.write ("1") elif table [y][x] == TRANSPORTS: if transportsp == 0: sys.stdout.write ("2") else : sys.stdout.write ("1") elif submarine [y][x] == MISS: sys.stdout.write ("x") else : 53
58 sys.stdout.write (" ") """ def leftoverenemy (): if (warshipp <= 0 and cruiserp <= 0 and destroyerp <= 0 and submarinep <= 0 and transportsp <= 0): return True def hitjudgement (table, submarine): noneattack = submarine [y][x] damage = table [y][x] global warshipp, cruiserp, destroyerp, submarinep, transportsp if noneattack!= N: return MISS else: if damage == WARSHIP: submarine [y][x] = HIT warshipp -= 1 return WARSHIP elif damage == CRUISER: submarine [y][x] = HIT cruiserp -= 1 return CRUISER elif damage == DESTROYER: submarine [y][x] = HIT destroyerp -= 1 return DESTROYER elif damage == SUBMARINE: submarine [y][x] = HIT submarinep -= 1 return SUBMARINE elif damage == TRANSPORTS: submarine [y][x] = HIT transportsp -= 1 return TRANSPORTS submarine [y][x] = MISS return MISS def hitdisplay (result): if result == MISS: return MISS elif WARSHIP <= result <= TRANSPORTS: 54
59 if result == WARSHIP and warshipp <= 0: return WARSHIP elif result == CRUISER and cruiserp <= 0: return CRUISER elif result == DESTROYER and destroyerp <= 0: return DESTROYER elif result == SUBMARINE and submarinep <= 0: return SUBMARINE elif result == TRANSPORTS and transportsp <= 0: return TRANSPORTS return HIT for nplay in range(0, 100): # HP warshipp = 5 cruiserp = 4 destroyerp = 3 submarinep = 3 transportsp = 2 BATTLESHIP = [TRANSPORTS, SUBMARINE, DESTROYER, CRUISER, WARSHIP] INITIAL_SHOOT = 0 SECOND_SHOOT = 1 FINISH_SHOOT = 100 # y = 0 x = 0 submarine = initialization () table = initialization () submarineflg = 0 y, x = shoot (INITIAL_SHOOT, submarine, MISS, y, x) result_tmp = hitjudgement (table, submarine) result = hitdisplay(result_tmp) for i in range(second_shoot, FINISH_SHOOT): y, x = shoot (i, submarine, result, y, x) # test: result_tmp = hitjudgement (table, submarine) result = hitdisplay(result_tmp) # if leftoverenemy (): break sum = sum + i+1 print "%3d : %3d " % (nplay+1, i) 55
60 sys.stdout.write (" = %3.2d\n" % (sum / 100)) 56
61 A.4 A.4.1 senkan.py def shoot (attacktimes, submarine, attackresult, y, x): return y, x 57
62 A.5 A.5.1 sample1.py def shoot (attacktimes, submarine, attackresult): import random global y,x while 1: y = random.randint(0, 9) x = random.randint(0, 9) if submarine[y][x] == 0: return y, x A.5.2 sample2.py def shoot (attacktimes, submarine, attackresult): global y, x, point_flg if attacktimes > 0: x += 4 else : point_flg = 0 y = 0 x = 0 if x >= 10: y += 1 x = point_flg if y >= 10: if (point_flg == 0): point_flg += 1 y = 0 x = point_flg elif (point_flg == 1): point_flg += 1 y = 0 x = point_flg elif (point_flg == 2): point_flg += 1 y = 0 x = point_flg elif (point_flg == 3): point_flg += 1 y = 0 58
63 return y, x x = point_flg 59
64 A.5.3 sample3.py def shoot (attacktimes, submarine, attackresult): global y, x y = attacktimes / 10 x = attacktimes % 10 return y, x 60
65 A.6 A.6.1 issue.py def shoot (attacktimes, submarine, attackresult): global y, x if attacktimes == 50: y = 0 x = 1 elif 0 < attacktimes and attacktimes < 50: if y % 2 == 0: if x+2 >= 10: y += 1 x = 1 else : x += 2 else: if x+2 >= 10: y += 1 x = 0 else : x += 2 elif 50 <= attacktimes : if y % 2 == 0: if x+2 >= 10: y += 1 x = 0 else : x += 2 else: if x+2 >= 10: y += 1 x = 1 else : x += 2 else : y = 0 x = 0 return y, x 61
66 B B.1 B.1.1 mine.h #define TATE 10 /* TATE YOKO */ #define YOKO 10 #define NUMB 5 /* ( ) NUMB */ #define NOP 11 /* */ #define NOBOMB 0 #define BOMB 99 #define TRUE 1 #define FALSE 0 #define OUT 99 62
67 B.2 Verification B.2.1 minemain1.c #include <stdio.h> #include <time.h> #include "mine.h" void panelopen(int panel[tate][yoko], int *x, int *y, int init); void createpanel(int orgpanel[tate][yoko]); void initpanel(int panel[tate][yoko]); int checkbomb(int orgpanel[tate][yoko], int x, int y); int checkpanel(int panel[tate][yoko], int x, int y); void setpanel(int orgpanel[tate][yoko], int panel[tate][yoko], int x, int y); void printpanel(int panel[tate][yoko], int orgpanel[tate][yoko]); int main(void) int orgpanel[tate][yoko], panel[tate][yoko]; int i, x=0, y=0, max, check; max = TATE * YOKO - NUMB; /* */ srand((int)time(null)); createpanel(orgpanel); /* (TATE) (YOKO) (NUMB) */ initpanel(panel); for (i = 1; i <= max; i++) panelopen(panel, &x, &y, i); /* panelopen */ check = checkbomb(orgpanel,x,y); if(check == 1) /* */ printf("%3d :(%2d,%2d)---BOMB!\n", i, x, y); break; else if(check == 99 checkpanel(panel,x,y) == 99) i--; /* */ continue; else /* */ printf("%3d :(%2d,%2d)\n", i, x, y); setpanel(orgpanel,panel,x,y); putchar( \n ); printpanel(panel, orgpanel); 63
68 putchar( \n ); void createpanel(int panel[][10]) int i, j; int t, y; for(i = 0; i < 10; i++) for(j = 0; j < 10; j++) panel[i][j] = NOBOMB; i = 1; while(i <= 5) t = rand() % 10; y = rand() % 10; if(panel[t][y] == 99) continue; else panel[t][y] = BOMB; i++; void initpanel(int panel[tate][yoko]) int i, j; for(i = 0; i < TATE; i++) for(j = 0; j < YOKO; j++) panel[i][j] = NOP; int checkbomb(int panel[][10], int x, int y) if (x < 0 x >= 10) return OUT; if (y < 0 y >= 10) return OUT; 64
69 if (panel[x][y] == 99) return TRUE; return FALSE; int checkpanel(int panel[tate][yoko], int x, int y) int n; n = panel[x][y]; if (n < 9) return OUT; else return TRUE; void setpanel(int orgpanel[tate][yoko], int panel[tate][yoko], int x, int y) int num = 0; if(x > 0) if(orgpanel[x-1][y] == 99) num++; if(y > 0) if(orgpanel[x-1][y-1] == 99) num++; if(y < 9) if(orgpanel[x-1][y+1] == 99) num++; if(y > 0) if(orgpanel[x][y-1] == 99) num++; if(y < 9) if(orgpanel[x][y+1] == 99) num++; if(x < 9) if(orgpanel[x+1][y] == 99) num++; if(y > 0) if(orgpanel[x+1][y-1] == 99) num++; if(y < 9) if(orgpanel[x+1][y+1] == 99) num++; panel[x][y] = num; void printpanel(int panel[tate][yoko], int orgpanel[tate][yoko]) int i,j; for(i = 0; i < TATE; i++) 65
70 for(j = 0; j < YOKO; j++) if(orgpanel[i][j] == BOMB) printf("b "); else if(panel[i][j] == NOP) printf("- "); else printf("%d ", panel[i][j]); putchar( \n ); 66
71 B.3 Score B.3.1 minemain100.c #include <stdio.h> #include <time.h> #include "mine.h" #define KURIKAESI void panelopen(int panel[tate][yoko], int *x, int *y, int init); void createpanel(int orgpanel[tate][yoko]); void initpanel(int panel[tate][yoko]); int checkbomb(int orgpanel[tate][yoko], int x, int y); int checkpanel(int panel[tate][yoko], int x, int y); void setpanel(int orgpanel[tate][yoko], int panel[tate][yoko], int x, int y); void printpanel(int panel[tate][yoko], int orgpanel[tate][yoko]); int main(void) int orgpanel[tate][yoko], panel[tate][yoko]; int i, x=0, y=0, max, checkb, checkp; int kaisu, seikou, avek; max = TATE * YOKO - NUMB; /* */ seikou = 0; avek = 0; srand((int)time(null)); for (kaisu = 1; kaisu <= KURIKAESI; kaisu++) createpanel(orgpanel); /* (TATE) (YOKO) (NUMB) */ initpanel(panel); for (i = 1; i <= max; i++) panelopen(panel, &x, &y, i); /* panelopen */ checkb = checkbomb(orgpanel,x,y); checkp = checkpanel(panel,x,y); if(checkb == TRUE) /* */ /* printf("%3d :(%2d,%2d)---BOMB!\n", i, x, y); */ break; else if(checkb == OUT checkp == OUT) i--; /* */ 67
72 continue; else /* */ /* printf("%3d :(%2d,%2d)\n", i, x, y); */ setpanel(orgpanel,panel,x,y); printf("%3d %2d\n", kaisu, i-1); /* putchar( \n ); printpanel(panel, orgpanel); putchar( \n ); */ if ( i > max) seikou++; avek = avek + i - 1; printf(" %d\n", seikou); printf(" %6.2f\n", (float)avek / KURIKAESI); void createpanel(int panel[tate][yoko]) int i, j; int t, y; for(i = 0; i < TATE; i++) for(j = 0; j < YOKO; j++) panel[i][j] = NOBOMB; i = 1; while(i <= NUMB) t = rand() % TATE; y = rand() % YOKO; if(panel[t][y] == BOMB) continue; else panel[t][y] = BOMB; 68
73 i++; void initpanel(int panel[tate][yoko]) int i, j; for(i = 0; i < TATE; i++) for(j = 0; j < YOKO; j++) panel[i][j] = NOP; int checkbomb(int panel[tate][yoko], int x, int y) if (x < 0 x >= TATE) return OUT; if (y < 0 y >= YOKO) return OUT; if (panel[x][y] == BOMB) return TRUE; return FALSE; int checkpanel(int panel[tate][yoko], int x, int y) int n; n = panel[x][y]; if (n < 9) return OUT; else return TRUE; void setpanel(int orgpanel[tate][yoko], int panel[tate][yoko], int x, int y) int num = 0; 69
74 if(x > 0) if(orgpanel[x-1][y] == BOMB) num++; if(y > 0) if(orgpanel[x-1][y-1] == BOMB) num++; if(y < YOKO-1) if(orgpanel[x-1][y+1] == BOMB) num++; if(y > 0) if(orgpanel[x][y-1] == BOMB) num++; if(y < YOKO-1) if(orgpanel[x][y+1] == BOMB) num++; if(x < TATE-1) if(orgpanel[x+1][y] == BOMB) num++; if(y > 0) if(orgpanel[x+1][y-1] == BOMB) num++; if(y < YOKO-1) if(orgpanel[x+1][y+1] == BOMB) num++; panel[x][y] = num; void printpanel(int panel[tate][yoko], int orgpanel[tate][yoko]) int i,j; for(i = 0; i < TATE; i++) for(j = 0; j < YOKO; j++) if(orgpanel[i][j] == BOMB) printf("b "); else if(panel[i][j] == NOP) printf("- "); else printf("%d ", panel[i][j]); putchar( \n ); 70
75 B.4 B.4.1 panelopen.c 71
76 C Battle Ship C.1 C.1.1 senkan.h #include <stdio.h> #include <stdlib.h> #include <time.h> #define N 0 // #define BM 1 // #define BH 2 // #define SK 11 // length:5 #define JK 12 // length:4 #define KK 13 // length:3 #define SM 14 // length:3 #define YS 15 // length:2 #define F010 if(i==1)fun_c++; up = fun_c; if(up==at_flg)upat(); #define F011 if(i==1)fun_c++; rig = fun_c; if(rig==at_flg)rightat(); #define F012 if(i==1)fun_c++; dow = fun_c; if(dow==at_flg)downat(); #define F013 if(i==1)fun_c++; lef = fun_c; if(lef==at_flg)leftat(); #define F000 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ else if(at_flg==fun_c+1) \ at_flg=0; \ 72
77 \ else \ random100(); \ #define F001 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ else \ oneskip(); \ \ #define F002 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ 73
78 if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ else if(at_flg==fun_c+1) \ at_flg=0; \ else \ twoskip(); \ \ #define F003 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ else \ tworight(); \ \ #define F004 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ \ 74
79 else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ \ else \ threeskip(); \ \ #define F005 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ 75
80 \ else \ threeright(); \ \ #define F006 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ \ else \ fourskip(); \ \ #define F007 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ 76
81 \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ \ else \ fourright(); \ \ #define F008 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ 77
82 \ \ else \ oddskip(); \ \ #define F009 if(sk<=kekka&&kekka<=ys) \ at_flg=0; \ \ if(i!=1&&0<at_flg&&at_flg<fun_c+1) \ if(up==at_flg&&gx-1<0) \ at_flg++; \ \ else if(rig==at_flg&&10<=gy+1) \ at_flg++; \ \ else if(dow==at_flg&&10<gx+1) \ at_flg++; \ \ else if(lef==at_flg&&gy-1<0) \ at_flg++; \ \ \ if(kekka==bm && 0<fun_c) \ if(0<fun_c&&at_flg==0) \ at_flg++;bx=gx;by=gy; \ \ else if(at_flg==fun_c+1) \ at_flg=0; \ \ \ else \ evenskip(); \ \ extern int tsb[10][10], sb[10][10]; extern int skp, jkp, kkp, smp, ysp; extern int gx, gy; extern int i, kekka, k; extern int bx, by; extern int fun_c, at_flg; extern int up, rig, dow, lef; 78
83 C.2 C.2.1 function.c #include <stdio.h> #include <stdlib.h> #include "senkan.h" extern int tsb[10][10], sb[10][10]; extern int skp, jkp, kkp, smp, ysp; extern int gx, gy; extern int i, kekka; extern int bx, by, at_flg; void random100(); void oneskip(); void twoskip(); void tworight(); void threeskip(); void threeright(); void fourskip(); void fourright(); void oddskip(); void evenskip(); void upat(); void rightat(); void downat(); void leftat(); void random100() do gx = rand() % 10; gy = rand() % 10; while(sb[gx][gy]!= N); return; void oneskip() int tate, yoko; 79
84 static int finish[10][10] = 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0 ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] == 1 && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void twoskip() int tate, yoko; static int finish[10][10] = 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, ; 80
85 for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void tworight() int tate, yoko; static int finish[10][10] = 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; 81
86 return; void threeskip() int tate, yoko; static int finish[10][10] = 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void threeright() int tate, yoko; static int finish[10][10] = 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 82
87 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void fourskip() int tate, yoko; static int finish[10][10] = 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) 83
88 return; gx = tate; gy = yoko; return; void fourright() int tate, yoko; static int finish[10][10] = 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void oddskip() 84
89 int tate, yoko; static int finish[10][10] = 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void evenskip() int tate, yoko; static int finish[10][10] = 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 85
90 ; for(tate = 0; tate < 10; tate++) for(yoko = 0; yoko < 10; yoko++) if(finish[tate][yoko] && sb[tate][yoko] == N) gx = tate; gy = yoko; return; return; void upat() int at_count; for(at_count = 1; at_count < 5; at_count++) if (0 <= bx - at_count && sb[bx - at_count][by] == N) gx = bx - at_count; gy = by; if (bx - at_count+1 < 0) at_flg++; return; at_flg++; return; void rightat() int at_count; for(at_count = 1; at_count < 5; at_count++) 86
91 if (by + at_count < 10 && sb[bx][by + at_count] == N) gx = bx; gy = by + at_count; if (10 <= by + at_count+1) at_flg++; return; at_flg++; return; void downat() int at_count; for(at_count = 1; at_count < 5; at_count++) if (bx + at_count < 10 && sb[bx + at_count][by] == N) gx = bx + at_count; gy = by; if (10 <= bx + at_count+1) at_flg++; return; at_flg++; return; void leftat() int at_count; 87
92 for(at_count = 1; at_count < 5; at_count++) if (0 <= by - at_count && sb[bx][by - at_count] == N) gx = bx; gy = by - at_count; if (by - at_count+1 < 0) at_flg++; return; at_flg++; return; 88
93 C.3 Practice C.3.1 senkanplay.c #include <stdio.h> #include <stdlib.h> #include <time.h> char line[100]; #define N 0 #define BM 1 #define BH 2 #define SK 11 #define JK 12 #define KK 13 #define SM 14 #define YS 15 void haichi (int sb[][10]); void dispsb (int sb[][10]); int zanteki (int skp, int jkp, int kkp, int smp, int ysp); void shoot (int sb[][10], int i, int *x, int *y); int meichup (int sb[][10], int x, int y); void meichud (int k); int skp = 5, jkp = 4, kkp = 3, smp = 3, ysp = 2; int main (void) int sb[10][10]; int i, x, y, k; haichi (sb); dispsb (sb); zanteki (skp, jkp, kkp, smp, ysp); shoot (sb, 1, &x, &y); 89
94 printf ("(x,y) = (%d,%d)\n", x, y); for (i = 2; i <= 100; i++) k = meichup (sb, x, y); dispsb (sb); meichud (k); if (zanteki (skp, jkp, kkp, smp, ysp)) break; shoot (sb, i, &x, &y); printf (" %d\n", --i); printf ("\npress any key to continue...\n"); getchar (); void haichi (int sb[][10]) int i, j, x, y; srand ((unsigned int) time (NULL)); for (i = 0; i < 10; i++) for (j = 0; j < 10; j++) sb[i][j] = N; if (rand () % 2 == 0) /* */ y = rand () % 10; x = rand () % 6; sb[x][y] = SK; sb[x + 1][y] = SK; sb[x + 2][y] = SK; sb[x + 3][y] = SK; sb[x + 4][y] = SK; 90
95 else /* */ x = rand () % 10; y = rand () % 6; sb[x][y] = SK; sb[x][y + 1] = SK; sb[x][y + 2] = SK; sb[x][y + 3] = SK; sb[x][y + 4] = SK; if (rand () % 2 == 0) /* */ y = rand () % 10; x = rand () % 7; while (sb[x][y]!= N sb[x + 1][y]!= N sb[x + 2][y]!= N sb[x + 3][y]!= N) y = rand () % 10; x = rand () % 7; sb[x][y] = JK; sb[x + 1][y] = JK; sb[x + 2][y] = JK; sb[x + 3][y] = JK; else /* */ x = rand () % 10; y = rand () % 7; while (sb[x][y]!= N sb[x][y + 1]!= N sb[x][y + 2]!= N sb[x][y + 3]!= N) x = rand () % 10; y = rand () % 7; sb[x][y] = JK; sb[x][y + 1] = JK; sb[x][y + 2] = JK; sb[x][y + 3] = JK; 91
96 if (rand () % 2 == 0) /* */ y = rand () % 10; x = rand () % 8; while (sb[x][y]!= N sb[x + 1][y]!= N sb[x + 2][y]!= N) y = rand () % 10; x = rand () % 8; sb[x][y] = KK; sb[x + 1][y] = KK; sb[x + 2][y] = KK; else /* */ x = rand () % 10; y = rand () % 8; while (sb[x][y]!= N sb[x][y + 1]!= N sb[x][y + 2]!= N) x = rand () % 10; y = rand () % 8; sb[x][y] = KK; sb[x][y + 1] = KK; sb[x][y + 2] = KK; if (rand () % 2 == 0) /* */ y = rand () % 10; x = rand () % 8; while (sb[x][y]!= N sb[x + 1][y]!= N sb[x + 2][y]!= N) y = rand () % 10; x = rand () % 8; sb[x][y] = SM; sb[x + 1][y] = SM; sb[x + 2][y] = SM; else /* */ x = rand () % 10; 92
97 y = rand () % 8; while (sb[x][y]!= N sb[x][y + 1]!= N sb[x][y + 2]!= N) x = rand () % 10; y = rand () % 8; sb[x][y] = SM; sb[x][y + 1] = SM; sb[x][y + 2] = SM; if (rand () % 2 == 0) /* */ y = rand () % 10; x = rand () % 9; while (sb[x][y]!= N sb[x + 1][y]!= N) y = rand () % 10; x = rand () % 9; sb[x][y] = YS; sb[x + 1][y] = YS; else /* */ x = rand () % 10; y = rand () % 9; while (sb[x][y]!= N sb[x][y + 1]!= N) x = rand () % 10; y = rand () % 9; sb[x][y] = YS; sb[x][y + 1] = YS; void dispsb (int sb[][10]) int i, j; printf (" \n"); 93
98 printf (" \n"); for (i = 0; i < 10; i++) printf ("%2d", i + 1); for (j = 0; j < 10; j++) putchar ( ); switch (sb[i][j]) case BM: putchar ( O ); break; case BH: putchar ( X ); break; default: putchar ( ); break; printf (" \n"); printf (" \n"); int zanteki (int skp, int jkp, int kkp, int smp, int ysp) if (skp == 0 && jkp == 0 && kkp == 0 && smp == 0 && ysp == 0) printf (" \n"); return 1; printf (" "); if (skp > 0) printf (" "); if (jkp > 0) 94
99 printf (" "); if (kkp > 0) printf (" "); if (smp > 0) printf (" "); if (ysp > 0) printf (" "); putchar ( \n ); return 0; void shoot (int sb[][10], int i, int *x, int *y) int tate, yoko; while (1) printf (" (%d), ", i); fgets (line, sizeof (line), stdin); sscanf (line, "%d,%d", &tate, &yoko); if (tate >= 1 && tate <= 10 && yoko >= 1 && yoko <= 10) *x = tate - 1; *y = yoko - 1; return; int meichup (int sb[][10], int x, int y) int a; a = sb[x][y]; 95
100 if (a == SK) sb[x][y] = BM; skp--; return SK; if (a == JK) sb[x][y] = BM; jkp--; return JK; if (a == KK) sb[x][y] = BM; kkp--; return KK; if (a == SM) sb[x][y] = BM; smp--; return SM; if (a == YS) sb[x][y] = BM; ysp--; return YS; if (a == BM) return BH; sb[x][y] = BH; return BH; void meichud (int k) if (k == BH) 96
101 printf (" \n"); else if (k == SK) printf (" "); if (skp <= 0) printf (" "); putchar ( \n ); else if (k == JK) printf (" "); if (jkp <= 0) printf (" "); putchar ( \n ); else if (k == KK) printf (" "); if (kkp <= 0) printf (" "); putchar ( \n ); else if (k == SM) printf (" "); if (smp <= 0) printf (" "); putchar ( \n ); else if (k == YS) printf (" "); if (ysp <= 0) 97
102 printf (" "); putchar ( \n ); 98
103 C.4 Verification C.4.1 senkan001.c #include <stdio.h> #include <stdlib.h> #include <time.h> #include "senkan.h" char line[100]; void haichi (); void dispsb (); int zanteki (); void shoot (); int meichup (); int meichud (); int tsb[10][10], sb[10][10]; int skp = 5, jkp = 4, kkp = 3, smp = 3, ysp = 2; int gx=0, gy=0; int i, kekka, k; int bx, by; int fun_c=0, at_flg=0; int up, rig, dow, lef; int main (void) int tate, yoko; haichi (); for (tate = 0; tate < 10; tate++) for (yoko = 0; yoko < 10; yoko++) sb[tate][yoko] = N; dispsb (); zanteki (); 99
104 i = 1; shoot (); getchar (); for (i = 2; i <= 101; i++) k = meichup (); printf("%d\n", k); dispsb (); kekka = meichud (); if (zanteki () (i == 101)) break; shoot (); // printf("%d %d", x+1, y+1); getchar (); printf (" %d\n", --i); printf ("Press any key to continue...\n"); getchar (); void haichi () int tate, yoko, cx, cy; srand ((unsigned int) time (NULL)); for (tate = 0; tate < 10; tate++) for (yoko = 0; yoko < 10; yoko++) tsb[tate][yoko] = N; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 6; tsb[cx][cy] = SK; 100
105 tsb[cx + 1][cy] = SK; tsb[cx + 2][cy] = SK; tsb[cx + 3][cy] = SK; tsb[cx + 4][cy] = SK; else /* */ cx = rand () % 10; cy = rand () % 6; tsb[cx][cy] = SK; tsb[cx][cy + 1] = SK; tsb[cx][cy + 2] = SK; tsb[cx][cy + 3] = SK; tsb[cx][cy + 4] = SK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 7; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N tsb[cx + 3][cy]!= N) cy = rand () % 10; cx = rand () % 7; tsb[cx][cy] = JK; tsb[cx + 1][cy] = JK; tsb[cx + 2][cy] = JK; tsb[cx + 3][cy] = JK; else /* */ cx = rand () % 10; cy = rand () % 7; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N tsb[cx][cy + 3]!= N) cx = rand () % 10; cy = rand () % 7; tsb[cx][cy] = JK; tsb[cx][cy + 1] = JK; 101
106 tsb[cx][cy + 2] = JK; tsb[cx][cy + 3] = JK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 8; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N) cy = rand () % 10; cx = rand () % 8; tsb[cx][cy] = KK; tsb[cx + 1][cy] = KK; tsb[cx + 2][cy] = KK; else /* */ cx = rand () % 10; cy = rand () % 8; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N) cx = rand () % 10; cy = rand () % 8; tsb[cx][cy] = KK; tsb[cx][cy + 1] = KK; tsb[cx][cy + 2] = KK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 8; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N) cy = rand () % 10; cx = rand () % 8; tsb[cx][cy] = SM; tsb[cx + 1][cy] = SM; tsb[cx + 2][cy] = SM; 102
107 else /* */ cx = rand () % 10; cy = rand () % 8; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N) cx = rand () % 10; cy = rand () % 8; tsb[cx][cy] = SM; tsb[cx][cy + 1] = SM; tsb[cx][cy + 2] = SM; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 9; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N) cy = rand () % 10; cx = rand () % 9; tsb[cx][cy] = YS; tsb[cx + 1][cy] = YS; else /* */ cx = rand () % 10; cy = rand () % 9; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N) cx = rand () % 10; cy = rand () % 9; tsb[cx][cy] = YS; tsb[cx][cy + 1] = YS; void dispsb () 103
108 int tate, yoko; printf (" printf (" \n"); \n"); for (tate = 0; tate < 10; tate++) printf ("%2d", tate + 1); for (yoko = 0; yoko < 10; yoko++) putchar ( ); switch (sb[tate][yoko]) case BM: putchar ( O ); break; case BH: putchar ( X ); break; default: putchar ( ); break; printf (" \n"); printf (" \n"); int zanteki () if (skp <= 0 && jkp <= 0 && kkp <= 0 && smp <= 0 && ysp <= 0) printf (" \n"); return 1; printf (" "); if (skp > 0) 104
109 printf (" "); if (jkp > 0) printf (" "); if (kkp > 0) printf (" "); if (smp > 0) printf (" "); if (ysp > 0) printf (" "); putchar ( \n ); return 0; int meichup () int a, b; a = tsb[gx][gy]; b = sb[gx][gy]; if (b!= N) return BH; if (a == SK) sb[gx][gy] = BM; skp--; return SK; if (a == JK) 105
110 sb[gx][gy] = BM; jkp--; return JK; if (a == KK) sb[gx][gy] = BM; kkp--; return KK; if (a == SM) sb[gx][gy] = BM; smp--; return SM; if (a == YS) sb[gx][gy] = BM; ysp--; return YS; sb[gx][gy] = BH; return BH; int meichud () if (k == BH) printf (" \n"); return BH; else if (k == SK) printf (" "); if (skp <= 0) printf (" \n"); return SK; putchar ( \n ); 106
111 else if (k == JK) printf (" "); if (jkp <= 0) printf (" \n"); return JK; putchar ( \n ); else if (k == KK) printf (" "); if (kkp <= 0) printf (" \n"); return KK; putchar ( \n ); else if (k == SM) printf (" "); if (smp <= 0) printf (" \n"); return SM; putchar ( \n ); else if (k == YS) printf (" "); if (ysp <= 0) printf (" \n"); return YS; putchar ( \n ); return BM; 107
112 C.5 Score C.5.1 senkan100.c #include <stdio.h> #include <stdlib.h> #include <time.h> #include "senkan.h" char line[100]; void haichi (); void dispsb (); int zanteki (); void shoot (); int meichup (); int meichud (); int tsb[10][10], sb[10][10]; int skp = 5, jkp = 4, kkp = 3, smp = 3, ysp = 2; int gx=0, gy=0; int i, kekka, k; int bx, by; int fun_c=0, at_flg=0; int up, rig, dow, lef; int main (void) int j, a, b, total = 0; for (j = 1; j <= 100; j++) skp = 5, jkp = 4, kkp = 3, smp = 3, ysp = 2; fun_c = 0, at_flg = 0; haichi (); for (a = 0; a < 10; a++) for (b = 0; b < 10; b++) sb[a][b] = N; 108
113 zanteki (); i = 1; shoot (); for (i = 2; i <= 101; i++) k = meichup (); kekka = meichud (); if (zanteki () i == 101) break; shoot (); i--; total = total + i; printf ("%3d %3d \n", j, i); printf (" %6.2f\n", total / 100.0); void haichi () int tate, yoko, cx, cy; static unsigned int seed = 1; srand ((unsigned int) time (NULL) * seed); for (tate = 0; tate < 10; tate++) for (yoko = 0; yoko < 10; yoko++) tsb[tate][yoko] = N; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 6; 109
114 tsb[cx][cy] = SK; tsb[cx + 1][cy] = SK; tsb[cx + 2][cy] = SK; tsb[cx + 3][cy] = SK; tsb[cx + 4][cy] = SK; else /* */ cx = rand () % 10; cy = rand () % 6; tsb[cx][cy] = SK; tsb[cx][cy + 1] = SK; tsb[cx][cy + 2] = SK; tsb[cx][cy + 3] = SK; tsb[cx][cy + 4] = SK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 7; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N tsb[cx + 3][cy]!= N) cy = rand () % 10; cx = rand () % 7; tsb[cx][cy] = JK; tsb[cx + 1][cy] = JK; tsb[cx + 2][cy] = JK; tsb[cx + 3][cy] = JK; else /* */ cx = rand () % 10; cy = rand () % 7; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N tsb[cx][cy + 3]!= N) cx = rand () % 10; cy = rand () % 7; tsb[cx][cy] = JK; 110
115 tsb[cx][cy + 1] = JK; tsb[cx][cy + 2] = JK; tsb[cx][cy + 3] = JK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 8; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N) cy = rand () % 10; cx = rand () % 8; tsb[cx][cy] = KK; tsb[cx + 1][cy] = KK; tsb[cx + 2][cy] = KK; else /* */ cx = rand () % 10; cy = rand () % 8; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N) cx = rand () % 10; cy = rand () % 8; tsb[cx][cy] = KK; tsb[cx][cy + 1] = KK; tsb[cx][cy + 2] = KK; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 8; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N) cy = rand () % 10; cx = rand () % 8; tsb[cx][cy] = SM; tsb[cx + 1][cy] = SM; 111
116 tsb[cx + 2][cy] = SM; else /* */ cx = rand () % 10; cy = rand () % 8; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!= N) cx = rand () % 10; cy = rand () % 8; tsb[cx][cy] = SM; tsb[cx][cy + 1] = SM; tsb[cx][cy + 2] = SM; if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 9; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N) cy = rand () % 10; cx = rand () % 9; tsb[cx][cy] = YS; tsb[cx + 1][cy] = YS; else /* */ cx = rand () % 10; cy = rand () % 9; while (tsb[cx][cy]!= N tsb[cx][cy + 1]!= N) cx = rand () % 10; cy = rand () % 9; tsb[cx][cy] = YS; tsb[cx][cy + 1] = YS; seed = rand (); 112
1 1 2 2 2.1 Java......... 2 2.2................................. 3 2.3.................................. 3 3 4 3.1....................................
06H082 1 1 2 2 2.1 Java......... 2 2.2................................. 3 2.3.................................. 3 3 4 3.1..................................... 4 3.2 GP.....................................
1 1 2 2 2.1................................................ 2 2.2......................................... 2 3 Battle Ship 3 3.1......................
2013 10H071 1 1 2 2 2.1................................................ 2 2.2......................................... 2 3 Battle Ship 3 3.1............................................ 3 3.2............................................
‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
PowerPoint Presentation
p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight
PowerPoint プレゼンテーション
"# "# $%&' "#$% $# & $# $% % ' ()(*"#$% +,(- ()(*"#$%.' ()(* $/.0##'' %0$&0% 1*2#/0/%'&0343$56 789#/0/'%&04../ "3"0##"$ "0%0$" "7 1*2#.30///04%.$ 789#.30///0#$'4 http://www.ibie2016.com/exhibitorlist/
Ｃ言語によるアルゴリズムとデータ構造
Algorithms and Data Structures in C 4 algorithm List - /* */ #include List - int main(void) { int a, b, c; int max; /* */ Ÿ 3Ÿ 2Ÿ 3 printf(""); printf(""); printf(""); scanf("%d", &a); scanf("%d",
8 if switch for while do while 2
(Basic Theory of Information Processing) ( ) if for while break continue 1 8 if switch for while do while 2 8.1 if (p.52) 8.1.1 if 1 if ( ) 2; 3 1 true 2 3 false 2 3 3 8.1.2 if-else (p.54) if ( ) 1; else
‚æ2›ñ C„¾„ê‡Ìš|
I 8 10 10 I ( 6 ) 10 10 1 / 23 1 C ( ) getchar(), gets(), scanf() ( ) putchar(), puts(), printf() 1 getchar(), putchar() 1 I ( 6 ) 10 10 2 / 23 1 (getchar 1 1) 1 #include 2 void main(void){ 3 int
(search: ) [1] ( ) 2 (linear search) (sequential search) 1
![(search: ) [1] ( ) 2 (linear search) (sequential search) 1](/thumbs/97/131825822.jpg "(search: ) [1] ( ) 2 (linear search) (sequential search) 1")
2005 11 14 1 1.1 2 1.2 (search:) [1] () 2 (linear search) (sequential search) 1 2.1 2.1.1 List 2-1(p.37) 1 1 13 n
r07.dvi
19 7 ( ) 2019.4.20 1 1.1 (data structure ( (dynamic data structure 1 malloc C free C (garbage collection GC C GC(conservative GC 2 1.2 data next p 3 5 7 9 p 3 5 7 9 p 3 5 7 9 1 1: (single linked list 1
ohp07.dvi
19 7 ( ) 2019.4.20 1 (data structure) ( ) (dynamic data structure) 1 malloc C free 1 (static data structure) 2 (2) C (garbage collection GC) C GC(conservative GC) 2 2 conservative GC 3 data next p 3 5
( ) 1 1: 1 #include <s t d i o. h> 2 #include <GL/ g l u t. h> 3 #include <math. h> 4 #include <s t d l i b. h> 5 #include <time. h>
2007 12 5 1 2 2.1 ( ) 1 1: 1 #include 2 #include 3 #include 4 #include 5 #include 6 7 #define H WIN 400 // 8 #define W WIN 300 // 9
:30 12:00 I. I VI II. III. IV. a d V. VI
2018 2018 08 02 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF N N y N x N xy yx : yxxyxy N N x, y N (parse tree) (1) yxyyx (2) xyxyxy (3) yxxyxyy (4) yxxxyxxy N y N x N yx
Python @HACHINONE 10 1 V Python 2014 2 : L[i] # -*- coding: utf-8 -*- def search(l, e): """L をリスト e をオブジェクトとする L に e が含まれていれば True そうでなければ False を返す """ for i in range(len(l)): if L[i] == e: return True
PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU
1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf
●70974_100_AC009160_KAPヘ<3099>ーシス自動車約款（11.10）.indb
" # $ % & ' ( ) * +, -. / 0 1 2 3 4 5 6 7 8 9 : ; < = >? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y " # $ % & ' ( ) * + , -. / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B
untitled
II yacc 005 : 1, 1 1 1 %{ int lineno=0; 3 int wordno=0; 4 int charno=0; 5 6 %} 7 8 %% 9 [ \t]+ { charno+=strlen(yytext); } 10 "\n" { lineno++; charno++; } 11 [^ \t\n]+ { wordno++; charno+=strlen(yytext);}
Microsoft PowerPoint - CproNt02.ppt [互換モード]
![Microsoft PowerPoint - CproNt02.ppt [互換モード]](/thumbs/95/124866096.jpg "Microsoft PowerPoint - CproNt02.ppt [互換モード]")
第 2 章 C プログラムの書き方 CPro:02-01 概要 C プログラムの構成要素は関数 ( プログラム = 関数の集まり ) 関数は, ヘッダと本体からなる 使用する関数は, プログラムの先頭 ( 厳密には, 使用場所より前 ) で型宣言 ( プロトタイプ宣言 ) する 関数は仮引数を用いることができる ( なくてもよい ) 関数には戻り値がある ( なくてもよい void 型 ) コメント
A/B (2018/06/08) Ver kurino/2018/soft/soft.html A/B
A/B (2018/06/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2018/soft/soft.html 2018 6 8 A/B 1 2018 6 8 2 1 1 1.1 OHP.................................... 1 1.2
main
14 1. 12 5 main 1.23 3 1.230000 3 1.860867 1 2. 1988 1925 1911 1867 void JPcalendar(int x) 1987 1 64 1 1 1 while(1) Ctrl C void JPcalendar(int x){ if (x > 1988) printf(" %d %d \n", x, x-1988); else if(x
listings-ext
(6) Python (2) ( ) ohsaki@kwansei.ac.jp 5 Python (2) 1 5.1 (statement)........................... 1 5.2 (scope)......................... 11 5.3 (subroutine).................... 14 5 Python (2) Python 5.1
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/97/134738565.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2
K227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:
![[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:](/thumbs/97/132863283.jpg "[ 1] 1 Hello World!! 1 #include <s t d i o. h> 2 3 int main ( ) { 4 5 p r i n t f ( H e l l o World!! \ n ) ; 6 7 return 0 ; 8 } 1:")
005 9 7 1 1.1 1 Hello World!! 5 p r i n t f ( H e l l o World!! \ n ) ; 7 return 0 ; 8 } 1: 1 [ ] Hello World!! from Akita National College of Technology. 1 : 5 p r i n t f ( H e l l o World!! \ n ) ;
I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *
2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +
P03.ppt
(2) Switch case 5 1 1 2 1 list0317.c if /*/ intnum; printf(""); scanf("%d", &num); 2 if (num % 3 == 0) puts( 0"); else if (num % 3 == 1) puts(" 1"); else puts( 32"); 3 if list0318.c /*/ intnum; printf("");
I ASCII ( ) NUL 16 DLE SP P p 1 SOH 17 DC1! 1 A Q a q STX 2 18 DC2 " 2 B R b
I 4 003 4 30 1 ASCII ( ) 0 17 0 NUL 16 DLE SP 0 @ P 3 48 64 80 96 11 p 1 SOH 17 DC1! 1 A Q a 33 49 65 81 97 113 q STX 18 DC " B R b 34 50 66 8 98 114 r 3 ETX 19 DC3 # 3 C S c 35 51 67 83 99 115 s 4 EOT
10
2: http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html kota@fbs.osaka-u.ac.jp 10 : 0 1 2 n 2 n 0 1 1 0 1 0 0 1 (2) = 105 1 = 8 1 2 8 = 256 0 9 105 i 106 j 256 2 1 #include int main(void)
C¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç
C (3) if else switch AND && OR (NOT)! 1 BMI BMI BMI = 10 4 [kg]) ( [cm]) 2 bmi1.c Input your height[cm]: 173.2 Enter Input your weight[kg]: 60.3 Enter Your BMI is 20.1. 10 4 = 10000.0 1 BMI BMI BMI = 10
I. Backus-Naur BNF : N N 0 N N N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) (2) (3) (4) II. 0(0 101)* (
2016 2016 07 28 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF : 11011 N N 0 N N 11 1001 N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) 1100100 (2) 1111011 (3) 1110010 (4) 1001011
fp.gby
1 1 2 2 3 2 4 5 6 7 8 9 10 11 Haskell 12 13 Haskell 14 15 ( ) 16 ) 30 17 static 18 (IORef) 19 20 OK NG 21 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a]
新・明解Java入門
537,... 224,... 224,... 32, 35,... 188, 216, 312 -... 38 -... 38 --... 102 --... 103 -=... 111 -classpath... 379 '... 106, 474!... 57, 97!=... 56 "... 14, 476 %... 38 %=... 111 &... 240, 247 &&... 66,
Java updated
Java 2003.07.14 updated 3 1 Java 5 1.1 Java................................. 5 1.2 Java..................................... 5 1.3 Java................................ 6 1.3.1 Java.......................
1 return main() { main main C 1 戻り値の型 関数名 引数 関数ブロックをあらわす中括弧 main() 関数の定義 int main(void){ printf("hello World!!\n"); return 0; 戻り値 1: main() 2.2 C main
C 2007 5 29 C 1 11 2 2.1 main() 1 FORTRAN C main() main main() main() 1 return 1 1 return main() { main main C 1 戻り値の型 関数名 引数 関数ブロックをあらわす中括弧 main() 関数の定義 int main(void){ printf("hello World!!\n"); return
I J
I 065763J 8 7 7 31 jikken/ +----- accumulation_demupa.c +----- accumulation_rain.c +----- frequency_demupa.c +----- frequency_rain.c +----- go.sh +----- graph_maker.sh +----- mesure-ryudai/ 2007/4/1 2007/6/30
Microsoft PowerPoint - C_Programming(3).pptx
H23 年度秋学期情報スキル活用 入門 担当 : 田中基彦 ( 工学部共通教育科 ) Email: ak_tanaka@isc.chubu.ac.jp 授業のホームページ学術情報センター > 教育支援 > 情報リテラシー 授業の日程 講義内容提出課題 連絡事項を掲載 > 定期的にアクセスして確認する C 言語によるプログラミング (3) 制御文 繰り返し文 if, while, switch, for,
18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf("hello World\n"); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o
![18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o](/thumbs/95/124976715.jpg "18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o")
18 C ( ) 1 1 1.1 hello world.c 5 printf("hello World\n"); 6 } [ ] [ ] #include % cc hello_world.c %./a.out Hello World [a.out ] % cc hello_world.c -o hello_world [ ( ) ] (K&R 4.1.1) #include
Prog1_14th
2012 年 7 月 19 日 ( 木 ) 実 施 構 造 体 レコードと 構 造 体 前 々 回 の 教 材 で 触 れたように, 複 数 の 項 目 に 渡 るデータを 一 まとめにしたものをレコードとい う 例 えば, 次 のように 学 籍 番 号, 氏 名, 履 修 科 目 コード, 点 数, 評 価 といった 項 目 による 1 人 分 のデータを 一 まとめにしたものは 1 件 分 のレコードである
2009 T
T060061 Wii Visual C++ 2008 Express Edition Visual C++ 2008 Express Edition ++ ++ Paint.net ++ 1 2009 T060061 2 1 4 2 4 2.1 Visual C++ 2008 Express Edition.......................... 4 2.2.....................................
Java演習(4) -- 変数と型 --
50 20 20 5 (20, 20) O 50 100 150 200 250 300 350 x (reserved 50 100 y 50 20 20 5 (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics; (reserved public class Blocks1 extends
解きながら学ぶC++入門編
!... 38!=... 35 "... 112 " "... 311 " "... 4, 264 #... 371 #define... 126, 371 #endif... 369 #if... 369 #ifndef... 369 #include... 3, 311 #undef... 371 %... 17, 18 %=... 85 &... 222 &... 203 &&... 40 &=...
fuga scanf("%lf%*c",&fuga); 改行文字を読み捨てる 10 進数の整数 おまじない取り込んだ値を代入する変数 scanf( %d%*c,&hoge); キーボードから取り込め という命令 1: scanf 1 1: int double scanf %d %lf printf
C 2007 5 16 9 1 9 9 if else for 2 hoge scanf("%d%*c",&hoge); ( 1 ) scanf 1 %d 10 2 %*c (p.337) [Enter] &hoge hoge 1 2 10 decimal number d 1 fuga scanf("%lf%*c",&fuga); 改行文字を読み捨てる 10 進数の整数 おまじない取り込んだ値を代入する変数
TEX American Mathematical Society PostScript Adobe Systems Incorporated
P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp) 1996 11 2 TEX American Mathematical Society PostScript Adobe Systems Incorporated pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD
血統詳細‐本番／３日目 ４８２‐７５０
2-1-, '($ # 10)*/.%- 345 " "!")* + +%& - #,'(%!! 3l 5h "%%%#%%%$ (% *)&' * &' +,- $!!! ""!!$!"" "#!!!""!!!""!! . 11 c %*) '( '(& %'(&+ %& -'( $!"! $, ###$ $, " #$ #"! "#!! + 14 a %& *) *'%&$ * ", "!" "
やさしいJavaプログラミング －Great Ideas for Java Programming サンプルPDF
pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) 3 5 14 18 21 23 23 24 28 29 29 31 32 34 35 35 36 38 40 44 44 45 46 49 49 50 pref : 2004/6/5 (11:8) 50 51 52 54 55 56 57 58 59 60 61
Minimum C Minimum C Minimum C BNF T okenseq W hite Any D
6 2019 5 14 6.1 Minimum C....................... 6 1 6.2....................................... 6 7 6.1 Minimum C Minimum C BNF T okenseq W hite Any Digit ::= 0 1 2... 9. Number ::= Digit Digit. Alphabet
解きながら学ぶJava入門編
44 // class Negative { System.out.print(""); int n = stdin.nextint(); if (n < 0) System.out.println(""); -10 Ÿ 35 Ÿ 0 n if statement if ( ) if i f ( ) if n < 0 < true false true false boolean literalboolean
A/B (2018/10/19) Ver kurino/2018/soft/soft.html A/B
A/B (2018/10/19) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2018/soft/soft.html 2018 10 19 A/B 1 2018 10 19 2 1 1 1.1 OHP.................................... 1
tuat1.dvi
( 1 ) http://ist.ksc.kwansei.ac.jp/ tutimura/ 2012 6 23 ( 1 ) 1 / 58 C ( 1 ) 2 / 58 2008 9 2002 2005 T E X ptetex3, ptexlive pt E X UTF-8 xdvi-jp 3 ( 1 ) 3 / 58 ( 1 ) 4 / 58 C,... ( 1 ) 5 / 58 6/23( )
コーディング基準.PDF
Java Java Java Java.java.class 1 private public package import / //////////////////////////////////////////////////////////////////////////////// // // // // ////////////////////////////////////////////////////////////////////////////////
<4D F736F F D20438CBE8CEA8D758DC F0939A82C282AB2E646F63>
C 言語講座第 2 回 作成 : ハルト 前回の復習基本的に main () の中カッコの中にプログラムを書く また 変数 ( int, float ) はC 言語では main() の中カッコの先頭で宣言する 1 画面へ出力 printf() 2 キーボードから入力 scanf() printf / scanf で整数を表示 / 入力 %d 小数を表示 / 入力 %f 3 整数を扱う int 型を使う
新版明解Ｃ言語 実践編
2 List - "max.h" a, b max List - max "max.h" #define max(a, b) ((a) > (b)? (a) : (b)) max List -2 List -2 max #include "max.h" int x, y; printf("x"); printf("y"); scanf("%d", &x); scanf("%d", &y); printf("max(x,
XMPによる並列化実装2
2 3 C Fortran Exercise 1 Exercise 2 Serial init.c init.f90 XMP xmp_init.c xmp_init.f90 Serial laplace.c laplace.f90 XMP xmp_laplace.c xmp_laplace.f90 #include int a[10]; program init integer
Python Speed Learning
Python Speed Learning 1 / 76 Python 2 1 $ python 1 >>> 1 + 2 2 3 2 / 76 print : 1 print : ( ) 3 / 76 print : 1 print 1 2 print hello 3 print 1+2 4 print 7/3 5 print abs(-5*4) 4 / 76 print : 1 print 1 2
r08.dvi
19 8 ( ) 019.4.0 1 1.1 (linked list) ( ) next ( 1) (head) (tail) ( ) top head tail head data next 1: NULL nil ( ) NULL ( NULL ) ( 1 ) (double linked list ) ( ) 1 next 1 prev 1 head cur tail head cur prev
Microsoft PowerPoint - 15Game.ppt
ゲームの作成 マインスイーパの概要マインスイーパの準備マインスイーパの完成マインスイーパの改良 マインスイーパの概要 ゲームの目的 地雷が隠れているマス目を開けずに ( できるだけ早く ) すべての地雷を見つけること ゲームの勝敗 スコア 地雷を掘り出したら負け 地雷以外を全部開けたら勝ち ( 所要時間は短いほうが良い ) ゲームのやり方 マス目の座標を入力してマス目を開く 表示される数字は隣接する周囲のマス目に隠れている地雷の数を示す
64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/5/16) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009383 このサンプルページの内容は, 新装版 1 刷発行時のものです. i 2 22 2 13 ( ) 2 (1) ANSI (2) 2 (3) Web http://www.morikita.co.jp/books/mid/009383
ohp08.dvi
19 8 ( ) 2019.4.20 1 (linked list) ( ) next ( 1) (head) (tail) ( ) top head tail head data next 1: 2 (2) NULL nil ( ) NULL ( NULL ) ( 1 ) (double linked list ) ( 2) 3 (3) head cur tail head cur prev data
untitled
JavaScript HP JavaScript JavaScript Web JavaScript Web JavaScript JavaScript JavaScript HTML HTML HTML JavaScript 1. JavaScript ON/OFF 2. JavaScript 3. 4. 5. 6. 7. 8. 9. 10. if 11. if 12. switch 13. 14.
double float
2015 3 13 1 2 2 3 2.1.......................... 3 2.2............................. 3 3 4 3.1............................... 4 3.2 double float......................... 5 3.3 main.......................
:30 12:00 I. I VI II. III. IV. a d V. VI
2017 2017 08 03 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF X [ S ] a S S ; X X X, S [, a, ], ; BNF X (parse tree) (1) [a;a] (2) [[a]] (3) [a;[a]] (4) [[a];a] : [a] X 2 222222
Condition DAQ condition condition 2 3 XML key value
Condition DAQ condition 2009 6 10 2009 7 2 2009 7 3 2010 8 3 1 2 2 condition 2 3 XML key value 3 4 4 4.1............................. 5 4.2...................... 5 5 6 6 Makefile 7 7 9 7.1 Condition.h.............................
Microsoft PowerPoint - C言語の復習（配布用）.ppt [互換モード]
![Microsoft PowerPoint - C言語の復習（配布用）.ppt [互換モード]](/thumbs/96/127138597.jpg "Microsoft PowerPoint - C言語の復習（配布用）.ppt [互換モード]")
if 文 (a と b の大きい方を表示 ) C 言語 Ⅰ の復習 条件判定 (if, 条件式 ) ループ (for[ 二重まで ], while, do) 配列 ( 次元 次元 ) トレース int a, b; printf( 整数 a: ); scanf( %d, &a); printf( 整数 b: ); scanf( %d, &b); //つのif 文で表現する場合間違えやすい どっちに =
r03.dvi
19 ( ) 019.4.0 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void... argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0 a a \0 b b b \0 c c c \0 1: // argdemo1.c ---
64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/7/10) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
C B
C 095707B 2010 6 8 1 LEVE1 2 1.1 LEVEL 1.1................................................ 2 1.1.1 1................................................ 2 1.1.2 1.2..............................................
数値計算
プログラム作成から実行まで 数値計算 垣谷公徳 17 号館 3 階電子メール : kimi@ee.ous.ac.jp Source program hello.c printf("hello\n"); コンパイラ Library libc.a 0011_printf000101001 1101_getc00011100011 1011_scanf1110010100 コンパイル Object module
明解Javaによるアルゴリズムとデータ構造
21 algorithm List 1-1 a, b, c max Scanner Column 1-1 List 1-1 // import java.util.scanner; class Max3 { public static void main(string[] args) { Scanner stdin = new Scanner(System.in); Chap01/Max3.java
Microsoft PowerPoint - 14Chap17.ppt
17.1 do-while 文 p.161 例 17.1.1 p.22 例 5.1.1 第 17 章その他の制御文 17.1 do-while 文 17.2 goto 文とラベル 17.3 break 文による繰返し制御 17.4 continue 文による繰返し制御 /* ex17_1_1.c */ do while (i < 10); 条件を満たさなくても 1 回は実行 i = 10; とすると違いがわかる
ohp03.dvi
19 3 ( ) 2019.4.20 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void int main(int argc, char *argv[]) {... 2 (2) argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0
C ( ) C ( ) C C C C C 1 Fortran Character*72 name Integer age Real income 3 1 C mandata mandata ( ) name age income mandata ( ) mandat
C () 14 5 23 C () C C C C C 1 Fortran Character*72 name Integer age Real income 3 1 C 1.1 3 7 mandata mandata () name age income mandata () mandata1 1 #include struct mandata char name[51];
P06.ppt
p.130 p.198 p.208 2 1 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i < NUM; i++ ) if ( weight[i] > max ) max = weight[i]: if ( weight[i] < min ) min = weight[i]: weight 3 maxof(a,
I 2 tutimura/ I 2 p.1/??
I 2 tutimura@mist.i.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/ 2002 4 25 I 2 p.1/?? / / Makefile I 2 p.2/?? Makefile make GNU make I 2 p.3/?? Makefile L A T E X I 2 p.4/?? core (1) gcc,
10/8 Finder,, 1 1. Finder MAC OS X 2. ( ) MAC OS X Java ( ) 3. MAC OS X Java ( ) / 10
10/8 2015-10-08 URL : http://webct.kyushu-u.ac.jp, 10/8 1 / 10 10/8 Finder,, 1 1. Finder MAC OS X 2. ( ) MAC OS X Java ( ) 3. MAC OS X Java ( ) 1. 30 2 / 10 10/8 Finder 1 Figure : : Apple.com 2, 3 / 10
明解Javaによるアルゴリズムとデータ構造
74 searching 3 key Fig.3-1 75 2を探索 53を探索 3-1 5 2 1 4 3 7 4 を探索 Fig.3-1 76 3 linear searchsequential search 2 Fig.3-2 0 ❶ ❷ ❸ 配列の要素を先頭から順に走査していく 探索すべき値と等しい要素を発見 Fig.3-2 6 4 3 2 3-2Fig.3-3 77 5 Fig.3-3 0
$%&$%'"! $%&)& )&! )&)')' )')&!!)&! )&)& )( )& "#! )&)&!)')&!$%& $%&!! )&)( $%()( # )&)')(
!!!!! "!! &'( +)+)+ *+*! &'(+)+) &'*&'(!! $ &'( &'* &')&'*!#! +*+* +*+* $% +(! +)+( +)+*+* +* $%&$%'"! $%&)& )&! )&)')' )')&!!)&! )&)& )( )& "#! )&)&!)')&!$%& $%&!! )&)( $%()( # )&)')( !!! +)% %!# +(+*&')
#"
!" #" !!! $" x %" 2011.3.11 3.12 3.1 4.02 4.17 4.24 4.28 4.29 5.8 5.14 6.4 7.3 8.1 8.10 8.23 8.28 9.10 9.30 11.13 11.21 12.23 12.28 2012.2.24 3.18 3.20 3.24 &" ! '" (" )" *" !+" !!" !#" !$" !%" !& !'"
ディジタル信号処理
http://www.cfme.chiba-u.jp/~yama// C 言 語 におけるファイル 入 出 力 テキスト バイナリの 取 り 扱 い ( )..[4]% gcc Wall o hoge hoge.c..[5]%./hoge 1 : 1 2 : 2 3 : 3 4 : 0 6..[6]% (! )..[4]% gcc Wall o hoge hoge.c..[5]%!g gcc Wall
数値計算
数値計算 垣谷公徳 17 号館 3 階電子メール : kimi@ee.ous.ac.jp プログラミング言語の一般論 データ型 ( 定数と変数 配列 ) 代入 基本演算 ( 四則演算 ) 入出力 分岐 繰返処理 関数 外部手続き 1 2 入力関数 入出力 getchar, getc, fgetc ; 一文字入力 gets, fgets, fread ; 文字列 ( データ列 ) 入力 scanf,
19 3!! (+) (>) (++) (+=) for while 3.1!! (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics;
19 3!!...... (+) (>) (++) (+=) for while 3.1!! 3.1.1 50 20 20 5 (20, 20) 3.1.1 (1)(Blocks1.java) public class Blocks1 extends JApplet { public void paint(graphics g){ 5 g.drawrect( 20, 20, 50, 20); g.drawrect(
DA100データアクイジションユニット通信インタフェースユーザーズマニュアル
Instruction Manual Disk No. RE01 6th Edition: November 1999 (YK) All Rights Reserved, Copyright 1996 Yokogawa Electric Corporation 801234567 9 ABCDEF 1 2 3 4 1 2 3 4 1 2 3 4 1 2
新・明解Ｃ言語 ポインタ完全攻略
2 1-1 1-1 /* 1-1 */ 1 int n = 100; int *p = &n; printf(" n %d\n", n); /* n int */ printf("*&n %d\n", *&n); /* *&n int */ printf(" p %p\n", p); /* p int * */ printf("&*p %p\n", &*p); /* &*p int * */ printf("sizeof(n)
[1] #include<stdio.h> main() { printf("hello, world."); return 0; } (G1) int long int float ± ±
![[1] #include<stdio.h> main() { printf(hello, world.); return 0; } (G1) int long int float ± ±](/thumbs/99/143405735.jpg "[1] #include<stdio.h> main() { printf(hello, world.); return 0; } (G1) int long int float ± ±")
[1] #include printf("hello, world."); (G1) int -32768 32767 long int -2147483648 2147483647 float ±3.4 10 38 ±3.4 10 38 double ±1.7 10 308 ±1.7 10 308 char [2] #include int a, b, c, d,
Java Java Java Java Java 4 p * *** ***** *** * Unix p a,b,c,d 100,200,250,500 a*b = a*b+c = a*b+c*d = (a+b)*(c+d) = 225
Java Java Java Java Java 4 p35 4-2 * *** ***** *** * Unix p36 4-3 a,b,c,d 100,200,250,500 a*b = 20000 a*b+c = 20250 a*b+c*d = 145000 (a+b)*(c+d) = 225000 a+b*c+d = 50600 b/a+d/c = 4 p38 4-4 (1) mul = 1
血統詳細／ＢＴ
17 b!$$$"$$$# $% '& # $%#""! "#!! " "!"!! ""#! "!!"! '!!!#!! " "#! "!! )&' +) +* +)* #( $% ( 14 a $% " " (! "##!## "#!!!!!!"!!!! 3d *,*),)* +! #! "## "" "",$%#( (,()'& #$% ##!"!! ##" "!! )* 2f ")+! * "!!
Microsoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
2008 DS T050049
DS T050049. PSP DS DS DS RPG DS OS Windows XP DevkiPro OS DS CPU ARM devkitarm MSYS MinGW MSYS MinGW Unix OS C++ C++ make nds nds DS DS micro SD Card nds DS DS DS nds C Java C++ nds nds DS 2008 DS T050049
7 "%%%#%%%$.'(. '(& - "$ $$$, 0/ '( ## ##$ "! $ " $ $ *+'() &%, %'(*&+.&*,.'(!!
, 26 "%%%#%%%$ %&' %& () + + + ## #! $ " #$ $ $! " * $!!#!#$$!! 7 "%%%#%%%$.'(. '(& - "$ $$$, 0/ '( ## ##$ "! $ " $ $ *+'() &%, %'(*&+.&*,.'(!! 0 6e )* )* )* )* )* )* $ #!"#$$ $$ # "$$$ $$$ $$$)*+ '(%&
1.1 1 C IIA $ cd comp3a %endminipage ~/comp3a mkdir $ mkdir comp3a $ cd comp3a C.c Emacs Cntrol x Control s 2 Emacs Control-x Control-f Control-
1 C IIA 1 C IIA IIA 1.1 Mac OS X 1.1.1 Mac OS X Unicode(UTF-8) UTF-8 Jedit X( ) Emacs( ) Emacs Emacs Emacs [Finder] [] Emacs dock Jedit X C 1. Jedit X Dock drag & drop Jedit X [Finder] [] Jedit X Folder
超初心者用
3 1999 10 13 1. 2. hello.c printf( Hello, world! n ); cc hello.c a.out./a.out Hello, world printf( Hello, world! n ); 2 Hello, world printf n printf 3. ( ) int num; num = 100; num 100 100 num int num num
(1 ) scanf(
I 1 C 1 1.1.................................... 1 1.2.................................... 1 1.3.................................... 2 1.4............................ 2 1.4.1.............................
橡Pro PDF
1 void main( ) char c; /* int c; */ int sum=0; while ((c = getchar())!= EOF) if(isdigit(c) ) sum += (c-'0'); printf("%d\n", sum); main()int i,sum=0; for(i=0;i
1/8 ページ Java 基礎文法最速マスター Java Javaの文法一覧です 他の言語をある程度知っている人はこれを読めばJavaの基礎をマスターしてJavaを書くことができるようになっています 簡易リファレンスとしても利用できると思いますので これは足りないと思うものがあれば教えてください 1. 基礎 class の作成プログラムはclassに記述します たとえばSampleという名前のclassを作る場合
Microsoft PowerPoint - kougi9.ppt
C プログラミング演習 第 9 回ポインタとリンクドリストデータ構造 1 今まで説明してきた変数 #include "stdafx.h" #include int _tmain(int argc, _TCHAR* argv[]) { double x; double y; char buf[256]; int i; double start_x; double step_x; FILE*
2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
新・明解Javaで学ぶアルゴリズムとデータ構造
第 3 章 探索 Arrays.binarySearch 743 3-1 探索 探索 searching key 配列 探索 Fig.3-1 b c 75 a 6 4 3 2 1 9 8 2 b 64 23 53 65 75 21 3-1 53 c 5 2 1 4 3 7 4 Fig.3-1 a 763 3-2 線形探索 線形探索 linear search sequential search 2
Microsoft Word - Cプログラミング演習(8)
第 8 回 (6/11) プログラミングスタイルなど [1] 名前のつけかた グローバル変数にはわかりやすい名前を, ローカル変数には短い名前を 関連性のあるものには関連性のある名前をつけて, 統一しよう 関数には能動的な名前を 名前は的確に 例題 1 次のコードの名前と値の選び方についてコメントせよ? #define TRUE 0? #define FALSE 1?? if ((ch = getchar())