Battle Ship
|
|
|
- のぶあき かに
- 9 years ago
- Views:
Transcription
1 H071
2 Battle Ship Battle Ship Compare A 12 A A.2 Compare A A
3 1 [1,2] [3] Battle Ship Battle Ship 2 3 Battle Ship 4 Battle Ship Compare
4 2 Battle Ship ( ) Battle Ship Battle Ship 2
5 3 Battle Ship Battle Ship 3.1 Battle Ship [4]( : [3] ) Battle Ship Practice Verification Score Battle Ship 3
6 4 Compare Battle Ship Compare Score Compare 1 Compare 2 1 Compare.c 4
7 2 Compare 5
8 5 Battle Ship 5.1 Battle Ship 5.2 Battle Ship Battle Ship 3 Score 4 3 6
9 4 Score 7
10 6 Battle Ship Battle Ship Battle Ship 1 8
11 7 Battle Ship 9
12 8 Battle Ship Battle Ship Battle Ship terminal terminal terminal GUI 5 5 Battle Ship play 10
13 [1] [2] [3] - wikipedia. #.E3.83.AC.E3.83.BC. E E3.83.BC.E4.BD.9C.E6.88.A6.E3.82.B2.E3.83.BC.E3.83.A0. [4] Battleship (game). 11
14 A A.1 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <unistd.h> int main(void) int a=0; char buff[64],number[16]; char *login = getlogin(); while(a!= 9) printf("\nmode select\n1:practice 2:Verification 3:Score 4.Compare 9:Quit\n"); scanf("%d",&a); switch(a) case 1: system("./practice"); break; case 2: sprintf(buff,"gcc -o %s function.o verification.o %s.c",login,login); system(buff); sprintf(buff,"./%s",login); system(buff); break; case 3: sprintf(buff,"gcc -o %s function.o score.o %s.c",login,login); system(buff); sprintf(buff,"./%s",login); 12
15 system(buff); break; case 4: sprintf(buff,"gcc -o %s function.o compare.o name_entry.o %s.c",login,login); system(buff); sprintf(buff,"./%s",login); system(buff); break; default: break; return; 13
16 A.2 Compare #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; float average; 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; 14
17 zanteki (); i = 1; 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); average = total / 100.0; printf (" %6.2f\n", average); name_entry(average); return 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; 15
18 if (rand () % 2 == 0) /* */ cy = rand () % 10; cx = rand () % 6; 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) 16
![() % 10; cx = rand () % 7; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!= N tsb[cx + 2][cy]!= N tsb[cx + 3][cy]!](/docs-images/49/20189101/images/page_18.jpg "= 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")
19 cx = rand () % 10; cy = rand () % 7; tsb[cx][cy] = JK; 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; 17
![= 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]!](/docs-images/49/20189101/images/page_19.jpg "= N tsb[cx][cy + 1]!= N tsb[cx][cy + 2]!")
20 cx = rand () % 8; tsb[cx][cy] = SM; tsb[cx + 1][cy] = SM; 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; 18
![= 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](/docs-images/49/20189101/images/page_20.jpg "() % 9; while (tsb[cx][cy]!= N tsb[cx + 1][cy]!")
21 seed = rand (); void dispsb () int i, j; printf (" printf (" \n"); \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 () if (skp <= 0 && jkp <= 0 && kkp <= 0 && smp <= 0 && ysp <= 0) /* printf(" \n"); */ 19
22 return 1; /* printf(" "); if(skp > 0) printf(" "); if(jkp > 0) printf(" "); if(kkp > 0) printf(" "); if(smp > 0) printf(" "); if(ysp > 0) printf(" "); putchar( \n ); */ return 0; int meichup () /* x->gx, y->gy change */ 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) 20
23 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) return BH; else if (k == SK && skp <= 0) return SK; else if (k == JK && jkp <= 0) return JK; else if (k == KK && kkp <= 0) 21
24 return KK; else if (k == SM && smp <= 0) return SM; else if (k == YS && ysp <= 0) return YS; return BM; 22
25 A.3 #include <stdio.h> #include <stdlib.h> #include <string.h> FILE *file; char *score,str[16] ; int i,j,temp; int dist[200] = 0; int main (void) file = fopen("./result.txt", "r"); for(i=1; i<150; i++) while(fgets(str, 16, file)) score = strtok(str, ","); temp = atoi(score); temp = temp / 10; dist[temp]++; break; printf(" \n"); for(i=0;i<10;i++) if(i<4) dist[4] += dist[i]; else if(i>4) printf("%d ~ %d :\t",i*10,i*10+9); for(j=0;j<dist[i];j++) putchar( * ); 23
26 printf("\n"); else printf("49 :\t"); for(j=0;j<dist[i];j++) putchar( * ); printf("\n"); fclose(file); return 0; 24
27 A.4 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <unistd.h> FILE *temp,*file; int i; float x; char str[16]; char *pt,*student; int name_entry (float average) file = fopen("./result.txt","r"); temp = fopen("./temp.txt", "a"); for(i=0; i<255; i++) while(fgets(str, 16, file)) if(strstr(str,student)) fputs(str,temp); else pt = strtok(str,","); x = atof(pt); if(average < x) printf("new RECORD!\tNEW:%2.2lf\tOLD:%2.2lf\n",average,x); fprintf(temp,"%2.2lf,%s\n",average,student); fclose(file); fclose(temp); system("cp temp.txt result.txt && rm temp.txt"); 25
28 return 0; 26
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: 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
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
Ｃ言語によるアルゴリズムとデータ構造
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",
10
2: http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html [email protected] 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)
‚æ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
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
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
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
●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
: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
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 ([email protected]) 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)
新・明解Ｃ言語 ポインタ完全攻略
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)
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);}
[ 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 ) ;
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("");
超初心者用
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
解きながら学ぶ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 &=...
コーディング基準.PDF
Java Java Java Java.java.class 1 private public package import / //////////////////////////////////////////////////////////////////////////////// // // // // ////////////////////////////////////////////////////////////////////////////////
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
Microsoft PowerPoint - CproNt02.ppt [互換モード]
![Microsoft PowerPoint - CproNt02.ppt [互換モード]](/thumbs/95/124866096.jpg "Microsoft PowerPoint - CproNt02.ppt [互換モード]")
第 2 章 C プログラムの書き方 CPro:02-01 概要 C プログラムの構成要素は関数 ( プログラム = 関数の集まり ) 関数は, ヘッダと本体からなる 使用する関数は, プログラムの先頭 ( 厳密には, 使用場所より前 ) で型宣言 ( プロトタイプ宣言 ) する 関数は仮引数を用いることができる ( なくてもよい ) 関数には戻り値がある ( なくてもよい void 型 ) コメント
新版明解Ｃ言語 実践編
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,
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
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 文で表現する場合間違えやすい どっちに =
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 ([email protected]) 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)
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
[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プログラミング －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
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) +
void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=
![void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=](/thumbs/89/97513163.jpg "void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=")
II 14 2018 7 26 : : [email protected] 14,, 8 2 12:00 1 O(1) n O(n) O(log n) O(1) 32 : 1G int 4 250 M 2.5 int 21 2 0 100 0 100 #include #define HASHSIZE 100 /* */ #define NOTFOUND 0
Microsoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
第3章 OpenGL の基礎
3 OpenGL April 11, 2017 1 / 28 3.1 ( ) OpenGL OpenGL 2 / 28 3.2 OpenGL OpenGL OpenGL (Open Graphics Library) Silicon Graphics, Inc. 2 3 API (Application Program Interface) [4] UNIX OS Windows Macintosh
untitled
H8/300,H8S,H8SX [H8S,H8/300 Tool Chain Ver6.2.0.0] #define Inline static inline //************************************************** Inline char sil_and_mem(char *mem,char and) return (*((volatile
/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v
1 http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html [email protected] /* do-while */ #include #include int main(void) double val1, val2, arith_mean, geo_mean; printf( \n );
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.......................
<4D F736F F D20438CBE8CEA8D758DC F0939A82C282AB2E646F63>
C 言語講座第 2 回 作成 : ハルト 前回の復習基本的に main () の中カッコの中にプログラムを書く また 変数 ( int, float ) はC 言語では main() の中カッコの先頭で宣言する 1 画面へ出力 printf() 2 キーボードから入力 scanf() printf / scanf で整数を表示 / 入力 %d 小数を表示 / 入力 %f 3 整数を扱う int 型を使う
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
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
実装規約第１．１版Ｒ２.PDF
ISO/IEC 14443-3 IC A B PCD PICC 1 PICC PCD 2 PICC PCD A PICC 100 PCD PICC ID b1 b8 8 b8 MSB b1 LSB PCD 2 PICC PCD PICC 1 1 1etu 128/fc 9.4 s 55 PICC Slotted Aloha PICC UID A 56 AFI APa APc APf APn ATA
jikken.dvi
1 1 PI 2 1 2 ( 1) H8-Tiny H8/3672 HD64F3672FP 16 CPU ( 16MHz) ROM 16KB, RAM 2048 2KB AD LED 1(c) ( A ) 赤外 LED 前 CdS セル LED 表示 RS232C 端子 (PC との接続端子 ) センサ類 ラインセンサ x3 (LED+CdS セル ) モータドライバ ターゲット Start ボタン
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.......................
-34-
-33- -34- ! -35- ! -36- ! -37- -38- -39- -40- -41- -42- -43- -44- -45- -46- -47- -48- -49- -50- ! -51- -52- !! -53- -54- ! -55- -56- -57- !!!!! "" "!!! " "" " -58- -59- !!! -60- -61- -62- -63- ! -64- !
- - http://168iroha.net 018 10 14 i 1 1 1.1.................................................... 1 1.................................................... 7.1................................................
2 1 list0415.c forfor #include int i, j; for (i = 1; i 新・明解Ｃ言語 実践編
第 1 章 見 21 1-1 見えないエラー 見 List 1-1 "max2x1.h" a, b max2 List 1-1 chap01/max2x1.h max2 "max2x1.h" #define max2(a, b) ((a) > (b)? (a) : (b)) max2 List 1-2 List 1-2 chap01/max2x1test.c max2 #include
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
untitled
Q 8 1 8.1 (C++) C++ cin cout 5 C++ 16 6 p.63 8.3 #include 7 showbase noshowbase showpoint noshowpoint 8.3 uppercase 16 nouppercase 16 setfill(int) setprecision(int) setw(int) setbase(int) dec
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
広報さがみはら第1242号
LINE UP 3 1 5 6 1 NO.1242 S A G A M I H A R A 1 1 1 16 16 1 6 1 6 1 6 1 1 1 1 1 11 1 1 1 1 1 1 6 1 6 1 1 1 1 1 1 1 1 11 1 1 16 1 1 1 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 6 1 16 1 16 1 6 1 1 1 1 1 1
£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡
(2018) 2018 5 17 0 0 if switch if if ( ) if ( 0) if ( ) if ( 0) if ( ) (0) if ( 0) if ( ) (0) ( ) ; if else if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 (0) 2 if else
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]
橡Taro9-生徒の活動.PDF
3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13
! "! # # # #!#!# # # # # # !"!! " " ##### ##!### # $%&'( )*+! " # ! " # $$$$ $ % % % & ' ' ' ( ) )* ) )* +,,* - +,,*. / 0 0* 1 2 1 1 3 1 2 1 1 * 42 5 4 4 6 5 4 1)2 1)5 1) /+2 /+ /+* : ; < = = *!! > >
#"
!" #" !!! $" 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 &" ! '" (" )" *" !+" !!" !#" !$" !%" !& !'"
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
血統詳細‐本番／３日目 ４８２‐７５０
2-1-, '($ # 10)*/.%- 345 " "!")* + +%& - #,'(%!! 3l 5h "%%%#%%%$ (% *)&' * &' +,- $!!! ""!!$!"" "#!!!""!!!""!! . 11 c %*) '( '(& %'(&+ %& -'( $!"! $, ###$ $, " #$ #"! "#!! + 14 a %& *) *'%&$ * ", "!" "
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
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,
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
char int float double の変数型はそれぞれ 文字あるいは小さな整数 整数 実数 より精度の高い ( 数値のより大きい より小さい ) 実数 を扱う時に用いる 備考 : 基本型の説明に示した 浮動小数点 とは数値を指数表現で表す方法である 例えば は指数表現で 3 書く
変数 入出力 演算子ここまでに C 言語プログラミングの様子を知ってもらうため printf 文 変数 scanf 文 if 文を使った簡単なプログラムを紹介した 今回は変数の詳細について習い それに併せて使い方が増える入出力処理の方法を習う また 演算子についての復習と供に新しい演算子を紹介する 変数の宣言プログラムでデータを取り扱う場合には対象となるデータを保存する必要がでてくる このデータを保存する場所のことを
橡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
ex01.dvi
,. 0. 0.0. C () /******************************* * $Id: ex_0_0.c,v.2 2006-04-0 3:37:00+09 naito Exp $ * * 0. 0.0 *******************************/ #include int main(int argc, char **argv) double
j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E
8 9 7 6 4 2 3 5 1 j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E a n 1 H = ae l j, j=1 l j = x j+1 x j, x n x 1 = n 1 j=1 l j, l j = ±l l > 0) n 1 H = ϵ l j, j=1 ϵ e x x
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 ---