2008 DS T050049
|
|
- てるえ のたけ
- 5 years ago
- Views:
Transcription
1 DS T 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
2 2008 DS T050049
3 devkitpro MinGW MSYS Emulator DS BG-MAP main I 1
4 1 DS DS DS DS C++ DS DS 2 OS Windows XP DS C++ DS CPU ARM ARM devkitpro cpp nds MinGW MSYS cpp make nds NO$GBA Windows Vista make vista 2.1 devkitpro devkitpro DS PSP DS SOUCEFORGE.NET devkitpro 2.1 devkitpro devkitpro devkitproupdater exe 1
5 2.1: devkitpro nds.h : 2.3: 2.3 Path C:devkitPro\devkitProARM\bin; nds.h nds.h 2.2 MinGW MSYS MinGW Windows GNU MSYS devkitpro 2
6 2.4: MinGW SOUCFORGE.NET MinGW 2.4 MinGW 2.5: MSYS devkitpro MinGW MinGW MSYS MSYS MinGW Windows CUI MinGW Unix CUI 2.5 MSYS 3
7 devkitpro Path C:\MinGW\bin; C:\msys\1.0\bin; make 2.3 Emulator OS CPU OS(CPU) DS DS NO$GBA ( GBA) GBA GBA DS DS NO$GBA NO$GBA 2.7: NO$GBA 2.6: Freeware 4
8 windows version devkitpro MinGW MSYS NO$GBA 3 DS 3.1 BG-MAP DS BG BG 1 Text Affine Extended Mode BG0 BG1 BG2 BG3 0 Text/3D Text Text Text 1 Text/3D Text Text Affine 2 Text/3D Text Affine Affine 3 Text/3D Text Text Extended 4 Text/3D Text Affine Extended 5 Text/3D Text Extended Extended 6 3D - Large - 1: BG Text 8x8 32x32 BG-Map Affine Text 8x8 16x16 128x128 Extended 32,768 Extendet Bitmap 3.2 DS grit bmp png DS devkitpro 5
9 devkitpro grit [4].grit sample.bmp 0 grit.exe sample.bmp -gt -gb8 build sample.grit # bitmap format -gt # 16 bit bitmap -gb8 data make #include <nds.h> #include <stdio.h> volatile int frame = 0; void vblank() { frame++; int main(void) { irqinit(); irqset(irq VBLANK, vblank); irqenable(irq VBLANK); videosetmode(0); videosetmodesub(mode 0 2D DISPLAY BG0 ACTIVE); vramsetbankc(vram C MAIN BG); 6
10 18 BG0 CR = BG MAP BASE(31); SUB BG0 CR = BG MAP BASE(31); BG PALETTE SUB[255] = RGB15(31,31,31); consoleinitdefault((u16 )SCREEN BASE BLOCK(31), (u16 )CHAR BASE BLOCK(0), 16); for(;;) swiwaitforvblank(); irqinit(); irqset(irq_vblank,vblank); irqenable(irq_vblank); videosetmode(0); videosetmodesub(mode_0_2d) DISPLAY_BG0_ACTIVE); vramsetbankc(fram_c_main_bg); (0) 4.2 #include <nds.h> #include <stdio.h> #include "othelloboard.h" int main(void) { irqinit(); irqset(irq VBLANK, 0); 7
11 videosetmode(mode 5 2D DISPLAY BG3 ACTIVE); vramsetbanka(vram A MAIN BG 0x ); lcdmainonbottom(); BG3 CR = BG BMP16 256x256 BG BMP BASE(0); BG3 YDX = 0; BG3 XDX = 1 8; BG3 XDY = 0; BG3 YDY = 1 8; BG3 CX = 0; BG3 CY = 0; for(int i = 0; i < ; i++) { ((u16 )BG BMP RAM(0))[i] = ((u16 )othelloboardbitmap)[i] BIT(15);; while(1) { swiwaitforvblank(); return 0; lcdmainonbottom(); BG3_CR = BG_BMP16_256x256 BG_BMP_BASE(0); VRAM DS BG3_YDX = 0; BG3_CY = 0; for 5 DS 8
12 char levelmap[max_level][80] = { { 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 3, 8, 13, 18, 23, 1, 1, 0, 0, 1, 4, 9, 14, 19, 24, 1, 1, 0, 0, 1, 5, 10, 15, 20, 25, 1, 1, 0, 0, 1, 6, 11, 16, 21, 26, 1, 1, 0, 0, 1, 7, 12, 17, 22, 27, 2, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, { 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 17, 3, 16, 21, 10, 1, 1, 0, 0, 1, 26, 13, 22, 9, 5, 1, 1, 0, 0, 1, 15, 8, 4, 14, 18, 1, 1, 0, 0, 1, 20, 24, 12, 11, 6, 1, 1, 0, 0, 1, 25, 19, 7, 23, 27, 2, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0 ; void setvramfrommap(u16* mapmemory, char* map) { for(int y = 0; y < 8; y++) { for(int x = 0; x < 10; x++) { char c = (*map++) * 9; mapmemory[x * 3 + y * 3 * 32] = c; 9
13 mapmemory[x * 3 + y * 3 * ] = c + 1; mapmemory[x * 3 + y * 3* ] = c + 2; mapmemory[x * 3 + (y * 3 + 1) * 32] = c + 3; mapmemory[x * 3 + (y * 3 + 1) * ] = c + 4; mapmemory[x * 3 + (y * 3 + 1) * ] = c + 5; mapmemory[x * 3 + (y * 3 + 2) * 32] = c + 6; mapmemory[x * 3 + (y * 3 + 2) * ] = c + 7; mapmemory[x * 3 + (y * 3 + 2) * ] = c + 8; VRAM DS 8x *9 5.3 void move(int dx, int dy, char*map) { int pos = 0; int a, b, c, d, e, Q; Q = 2; while(map[pos]!= Q) { pos++; int dp = dx + dy * 10; a = map[pos + dp]; b = map[pos + dp + dp]; c = map[pos + dp + dp + dp]; d = map[pos + dp + dp + dp + dp]; e = map[pos + dp + dp + dp + dp + dp]; if(a == 1) { count--; return; 10
14 if(b == 1 (b > 2 && b <= 27) (c > 2 && c <= 27) (d > 2 && d <= 27) e == 1) { map[pos] = a; map[pos + dp] = Q; return; pos map Q = 2 while Q pos pos + dp a = map[pos + dp] b c d e if if (a == 1) count main if b e b, c, d pos + dp 5.4 main main int main(void) { /* */ swicopy(soukobanpal, BG_PALETTE 256); /* */ swicopy(soukobantiles, tilememory, 24 * 24 * 28 / 2); char map[80]; swicopy(levelmap[0], map, 40); (1) scankeys(); if(kesdown()) { if(keysdown() & KEY_A) { (2) swicopy(levelmap[1], 40); 11
15 while(1) { iprintf("\x1b[10;0h count = %04d\n", count); scankeys(); if(keysdown()) { if(keyscown() & KEY_RIGHT){ count++; move(-1, 0, map); else if(keyscown() & KEY_LEFT){ count++; move(1, 0, map); else if(keyscown() & KEY_UP){ count++; move(0, -1, map); else if(keyscown() & KEY_DOWN){ count++; move(0, 1, map); else if(keyscown() & KEY_START){ swicopy(levelmap[stage],map, 40); count = 0; setbramfrommap(mapmemory, map); swiwaitforvblank(); return 0; (1) (2) DS A ( ) levelmap[1] While if count++; 5.3 count ; main count count 5.3 main count ; if else if(keysdown() & KEY_START) count 0 12
16 6 DS DS C++ [1] DS DS DS 13
17 [1] Nintendo DS [2] [3] GBA develop Wiki [4] i. Grit : Table of Contents 14
18 I #include <nds.h> #include <stdio.h> #include "souko.h" #define MAX LEVEL (4) char levelmap[max LEVEL][80] = { { 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 2, 9, 6, 1, 1, 1, 0, 0, 1, 1, 5, 8, 7, 1, 1, 1, 0, 0, 1, 1, 3, 4, 10, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0 ; void setvramfrommap(u16 mapmemory, char map) { for(int y = 0; y < 8; y++) { for(int x = 0; x < 10; x++) { char c = ( map++) 9; mapmemory[x 3 + y 3 32] = c; mapmemory[x 3 + y ] = c + 1; mapmemory[x 3 + y ] = c + 2; mapmemory[x 3 + (y 3 + 1) 32] = c + 3; mapmemory[x 3 + (y 3 + 1) ] = c + 4; mapmemory[x 3 + (y 3 + 1) ] = c + 5; mapmemory[x 3 + (y 3 + 2) 32] = c + 6; mapmemory[x 3 + (y 3 + 2) ] = c + 7; mapmemory[x 3 + (y 3 + 2) ] = c + 8; int checkclear(char map) { for(int i = 0; i < 80; i++) { 1
19 if(map[i] == 2) { return false; return true; void move(int dx, int dy, char map) { int pos = 0; int a,b, Q; Q = 10; while(map[pos] Q) { pos++; int dp = dx + dy 10; a = map[pos + dp]; b = map[pos + dp + dp]; if(a == 1) { return; if(b 9) { map[pos] = a; map[pos + dp] = Q; return; int main(void) { irqinit(); irqenable(irq VBLANK); videosetmode(mode 0 2D DISPLAY BG0 ACTIVE); videosetmodesub(mode 0 2D DISPLAY BG0 ACTIVE); vramsetmainbanks(vram A MAIN BG 0x , VRAM B LCD, VRAM C SUB BG, VRAM D LCD); SUB BG0 CR = BG MAP BASE(31); BG PALETTE SUB[255] = RGB15(0,31,0); consoleinitdefault((u16 )SCREEN BASE BLOCK SUB(31), 2
20 (u16 )CHAR BASE BLOCK SUB(0), 16); lcdmainonbottom(); BG0 CR = BG 32x32 BG COLOR 256 BG MAP BASE(0) BG TILE BASE(1); swicopy(soukopal, BG PALETTE, 256); u8 tilememory = (u8 )BG TILE RAM(1); u16 mapmemory = (u16 )BG MAP RAM(0); swicopy(soukotiles, tilememory, / 2); int stage = 0; int clear = 0; char map[80]; swicopy(levelmap[0], map, 40); while(1) { iprintf("\x1b[10;0h Stage %04d\n", stage + 1); scankeys(); if(keysdown()) { if(clear) { clear = 0; stage++; swicopy(levelmap[stage], map, 40); else if(keysdown() & KEY RIGHT) { move(1, 0, map); else if(keysdown() & KEY LEFT) { move( 1, 0, map); else if(keysdown() & KEY UP) { move(0, 1, map); else if(keysdown() & KEY DOWN) { move(0, 1, map); else if(keysdown() & KEY START) { swicopy(levelmap[stage], map, 40); setvramfrommap(mapmemory, map); swiwaitforvblank(); 3
21 return 0; 4
2008 T050092
T050092 2004 12 4 2008 4 1 C++ cpp devkitpro( )msys( ) nds NO$GBA microsd ( ) 10 1 100-100 15 10 3 2008 T050092 1 1 2 1 2.1 ARM......................... 2 2.2 msys devkitpro...................... 2 2.3
More informationdevkitpro msys
2009 RPG T050017 1 1 2 1 2.1 devkitpro msys....................... 1 2.2................................. 2 2.3......................... 2 2.4........... 2 3 3 3.1........................... 3 3.1.1.............................
More informationN(なんて)D(どうでもいい)S(作文だろうか)
N( なんて ) D( どうでもいい ) S( 作文だろうか ) N( 名前 )D( ですよ )S( さびたコイル ) 1. はじめに ここでは NDS( 任天堂 DS) 上で動くプログラムの作り方を説明しています 実機で動作させ るためには 別途マジコンが必要です 2. 開発環境の導入まずは開発環境の導入です NDS の CPU ARM で動くプログラムをコンパイルするために gcc ベースのコンパイラを使います
More informationC言語によるアルゴリズムとデータ構造
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",
More informationC による数値計算法入門 ( 第 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
More informationPC 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
More information/* 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 kota@fbs.osaka-u.ac.jp /* do-while */ #include #include int main(void) double val1, val2, arith_mean, geo_mean; printf( \n );
More information2009 T060050
T060050 C++ Microsoft Visual C++ 2008 Express Edition DX C DX VC++ Debug exe 1 2 2009 T060050 1 1 2 1 2.1...................... 1 2.2....................... 2 3 3 3.1................... 3 3.2.....................
More informationPowerPoint 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
More informationI. 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
More information2009 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.....................................
More information‚æ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
More informationI 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,
More informationII ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D
II 8 2003 11 12 1 6 ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 Daisuke 8 =>. 73 Daisuke 35 Hiroshi 64 Ichiro 87 Junko
More informationI. 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) +
More information2008chom.pdf
CHomP Pawe l Pilarczyk 1 CHomP Computational Homology Project [3] OS Windows Mac Unix Linux [3] CHomP [3] 2 3 CHomP CHomP 4 5 C++ [1] 2 CHomP 1 2 K 1 = { A 1 A 2 A 3, A 1 A 2, A 2 A 3, A 1 A 3, A 3 A 4,
More information1.1 EPS... 3 1.2 EPS... 3 1.2.1... 3 1.2.2... 4 1.3... 5 2.1 BMP... 6 2.2 BMP... 6 2.2.1... 6 2.2.2... 6 2.2.3 (Appendix )... 7 3.1 TIFF... 8 3.2 TIFF... 8 3.2.1... 8 3.2.2... 9 3.2.3 (Appendix )... 9
More informationJava 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.......................
More informationInformatics 2014
C 計算機の歴史 手回し計算機 新旧のソロバン バベッジの階差機関 スパコン ENIAC (1946) パソコン 大型汎用計算機 電卓 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating System) OS Windows 78, Vista, XP Windows Mac OS X
More information/* sansu1.c */ #include <stdio.h> main() { int a, b, c; /* a, b, c */ a = 200; b = 1300; /* a 200 */ /* b 200 */ c = a + b; /* a b c */ }
C 2: A Pedestrian Approach to the C Programming Language 2 2-1 2.1........................... 2-1 2.1.1.............................. 2-1 2.1.2......... 2-4 2.1.3..................................... 2-6
More information64bit 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)
More informationuntitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
More informationARM gcc Kunihiko IMAI 2009 1 11 ARM gcc 1 2 2 2 3 3 4 3 4.1................................. 3 4.2............................................ 4 4.3........................................
More information1 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
More information: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
More informationI 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
More informationr08.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
More informationtuat1.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( )
More informationmugensho.dvi
1 1 f (t) lim t a f (t) = 0 f (t) t a 1.1 (1) lim(t 1) 2 = 0 t 1 (t 1) 2 t 1 (2) lim(t 1) 3 = 0 t 1 (t 1) 3 t 1 2 f (t), g(t) t a lim t a f (t) g(t) g(t) f (t) = o(g(t)) (t a) = 0 f (t) (t 1) 3 1.2 lim
More informationJava 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
More information: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
More informationP06.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,
More informationプログラミング基礎
C プログラミング Ⅰ 条件分岐 if~else if~else 文,switch 文 条件分岐 if~else if~else 文 if~else if~else 文 複数の条件で処理を分ける if~else if~else 文の書式 if( 条件式 1){ 文 1-1; 文 1-2; else if( 条件式 2){ 文 2-1; 文 2-2; else { 文 3-1; 文 3-2; 真条件式
More informationohp08.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
More information(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
More information-1-1 1 1 1 1 12 31 2 2 3 4
2007 -1-1 1 1 1 1 12 31 2 2 3 4 -2-5 6 CPU 3 Windows98 1 -3-2. 3. -4-4 2 5 1 1 1 -5- 50000 50000 50000 50000 50000 50000 50000 50000 50000 50000-6- -7-1 Windows 2 -8-1 2 3 4 - - 100,000 200,000 500,000
More informationERATO100913
ERATO September 13, 2010, DC2 1/25 1. 2 2. 2/25 3/25 3/25 2 3/25 2 3/25 1 1 0.5 0.5 0 0 0.5 1 0 0 0.5 1 4/25 1 1 0.5 0.5 0 0 0.5 1 (0, 0) 0 0 0.5 1 4/25 1 1 0.5 0.5 0 0 0.5 1 (0, 0) ( 1, 0) 0 0 0.5 1 4/25
More informationMicrosoft Word - SU1204教本(Driver)原稿.docx
void setup(){ pinmode(13, OUTPUT); //13 void loop(){ digitalwrite(13, HIGH); //13 HIGH delay(500); digitalwrite(13, LOW); //13 LOW delay(500); setup pinmode loop delay C M B void setup(){ pinmode(12,output);
More informationr1.dvi
2014 1 2014.4.10 0 / 1 / 2 / 3 Lisp 4 5 ( ) 1 (5 1 ) 5 1 1.1? 0 1 (bit sequence) 5 101 3 11 2 (binary system) 2 1000 8 1 ( ) ( )? ( 1) r1 1000 1001 r2 1002... r3 1: (memory) (address) CPU (instruction)
More informationr11.dvi
19 11 ( ) 2019.4.20 1 / 1.1 ( n n O(n 2 O(n 2 ) ( 1 d n 1 n logn O(nlogn n ( n logn C 1.2 ( ( merge 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge int *ivec_new(int size) { int *a = (int*)malloc((size+1)
More informationohp11.dvi
19 11 ( ) 2019.4.20 1 / ( ) n O(n 2 ) O(n 2 ) ( ) 1 d n 1 n logn O(nlogn) n ( n logn C ) 2 ( ) ( merge) 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge 3 ( ) (2) int *ivec_new(int size) { int *a
More informationprogrammingII2019-v01
II 2019 2Q A 6/11 6/18 6/25 7/2 7/9 7/16 7/23 B 6/12 6/19 6/24 7/3 7/10 7/17 7/24 x = 0 dv(t) dt = g Z t2 t 1 dv(t) dt dt = Z t2 t 1 gdt g v(t 2 ) = v(t 1 ) + g(t 2 t 1 ) v v(t) x g(t 2 t 1 ) t 1 t 2
More informationC 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..............................................
More information課題
int starttime_msec; boolean counting = false; size(400,200); smooth(); //font は各自のものに変更してください font = loadfont("serif-48.vlw"); void mouseclicked(){ counting = true; starttime_msec = millis(); int t=0;
More information8 / 0 1 i++ i 1 i-- i C !!! C 2
C 2006 5 2 printf() 1 [1] 5 8 C 5 ( ) 6 (auto) (static) 7 (=) 1 8 / 0 1 i++ i 1 i-- i 1 2 2.1 C 4 5 3 13!!! C 2 2.2 C ( ) 4 1 HTML はじめ mkdir work 作業用ディレクトリーの作成 emacs hoge.c& エディターによりソースプログラム作成 gcc -o fuga
More information新・明解C言語で学ぶアルゴリズムとデータ構造
第 1 章 基本的 1 n 141 1-1 三値 最大値 algorithm List 1-1 a, b, c max /* */ #include int main(void) { int a, b, c; int max; /* */ List 1-1 printf("\n"); printf("a"); scanf("%d", &a); printf("b"); scanf("%d",
More information, m 1 1 m m b
4-155-700-06(1) Q&AOS http://support.d-imaging.sony.co.jp/www/s-frame/ index.html http://support.d-imaging.sony.co.jp/www/printer/ index.html http://www.sony.co.jp/mstaiou/ DPP-F700 WEB http://www.sony.co.jp/dpp-regi/
More information[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,
More informationhaskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
More informationr3.dvi
00 3 2000.6.10 0 Java ( 7 1 7 1 GSSM 1? 1 1.1 4 4a 4b / / 0 255 HTML X 0 255 16 (0,32,255 #0020FF Java xclock -bg #0020FF xclock ^C (Control C xclock 4c 1 import java.applet.applet; import java.awt.*;
More informationJava学習教材
Java 2016/4/17 Java 1 Java1 : 280 : (2010/1/29) ISBN-10: 4798120987 ISBN-13: 978-4798120980 2010/1/29 1 Java 1 Java Java Java class FirstExample { public static void main(string[] args) { System.out.println("
More informationC のコード例 (Z80 と同機能 ) int main(void) { int i,sum=0; for (i=1; i<=10; i++) sum=sum + i; printf ("sum=%d n",sum); 2
アセンブラ (Z80) の例 ORG 100H LD B,10 SUB A LOOP: ADD A,B DEC B JR NZ,LOOP LD (SUM),A HALT ORG 200H SUM: DEFS 1 END 1 C のコード例 (Z80 と同機能 ) int main(void) { int i,sum=0; for (i=1; i
More informationCプログラミング - 第8回 構造体と再帰
C 8 ( ) C 1 / 30 n! a n+2 = a n+1 + a n ( ) C 2 / 30 #include struct student{ char name[20]; int math; int phys; ; int main(void){ struct student a, b; struct student c={"frank", 90; ( ) C 3 /
More informationcpp4.dvi
2017 c 4 C++ (4) C++, 41, 42, 1, 43,, 44 45, 41 (inheritance),, C++,, 100, 50, PCMCIA,,,,,,,,, 42 1 421 ( ), car 1 [List 41] 1: class car { 2: private: 3: std::string m model; // 4: std::string m maker;
More informationjoho09.ppt
s M B e E s: (+ or -) M: B: (=2) e: E: ax 2 + bx + c = 0 y = ax 2 + bx + c x a, b y +/- [a, b] a, b y (a+b) / 2 1-2 1-3 x 1 A a, b y 1. 2. a, b 3. for Loop (b-a)/ 4. y=a*x*x + b*x + c 5. y==0.0 y (y2)
More information(Version: 2017/4/18) Intel CPU 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU do
(Version: 2017/4/18) 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)
More information64bit 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)
More informationuntitled
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
More informationdouble 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.......................
More informationprogram.dvi
2001.06.19 1 programming semi ver.1.0 2001.06.19 1 GA SA 2 A 2.1 valuename = value value name = valuename # ; Fig. 1 #-----GA parameter popsize = 200 mutation rate = 0.01 crossover rate = 1.0 generation
More informationuntitled
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);}
More informationWelfare Economics (1920) The main motive of economic study is to help social improvement help social improvement society society improvement help 1885
1 27 4 10 1 toyotaka.sakai@gmail.com Welfare Economics (1920) The main motive of economic study is to help social improvement help social improvement society society improvement help 1885 cool heads but
More informationX Window System X X &
1 1 1.1 X Window System................................... 1 1.2 X......................................... 1 1.3 X &................................ 1 1.3.1 X.......................... 1 1.3.2 &....................................
More informationInformatics 2010.key
http://math.sci.hiroshima-u.ac.jp/ ~ryo/lectures/informatics2010/ 1 2 C ATM etc. etc. (Personal Computer) 3 4 Input Output Device Central Processing Unit I/O CPU Memory 5 6 (CPU),,... etc. C, Java, Fortran...
More informationHPB16_表1-表4.ai
03-5324-762406-6886-9300 03-5324-760806-6886-8218 03-5324-760606-6886-5035 http://just-hpb.jp/ Contents 4988637153787 4988637153794 4988637153930 4988637153947 41 4988637153800 4988637153848 4988637153954
More informationDNxHD_WEB_JP_ indd
Avid DNxHD Avid DNxHD www.avid.com/jp Avid DNxHD Avid DNxHD...1 Avid HD HD...1 DNxHD...2...3 Avid DNxHD... 4 Avid DNxHD...5... 6...7...7 HD... 8... 8 Avid DNxHD... 9 2 Avid DNxHD Technology Avid DNxHD
More information新・明解C言語 実践編
第 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
More information¥×¥í¥°¥é¥ß¥ó¥°±é½¬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
More information( ) 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
More information玉島テレビ接続マニュアルHP用1504.indd
CONTENTS 1 11 2 1 3 2 2 6 2 1 22 2 7 22 3 8 3 33 4 1 5 4 2 6 1 6 4 6 2 6 5 6 3 7 8 1 8 2 8 3 8 4 10 4 4 4 1 12 4 13 44 2 14 4 4 3 15 5 5 5 WAN WAN X4 X3 X2 X1 18 6 6 1 6 20 6 21 6 22 6 2 6 23 6 24 6
More informationInformatics 2015
C 計算機の歴史 新旧のソロバン バベッジの階差機関 19C前半 手回し計算機 19C後半 20C後半 スパコン 1960年代 ENIAC (1946) 大型汎用計算機 1950年代 1980年代 電卓 1964 パソコン 1970年代 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating
More information情報科学概論 第1回資料
1. Excel (C) Hiroshi Pen Fujimori 1 2. (Excel) 2.1 Excel : 2.2Excel Excel (C) Hiroshi Pen Fujimori 2 256 (IV) :C (C 65536 B4 :2 (2 A3 Excel (C) Hiroshi Pen Fujimori 3 Tips: (1) B3 (2) (*1) (3) (4)Word
More information2
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...
More information£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (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
More informationXMPによる並列化実装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
More information( CUDA CUDA CUDA CUDA ( NVIDIA CUDA I
GPGPU (II) GPGPU CUDA 1 GPGPU CUDA(CUDA Unified Device Architecture) CUDA NVIDIA GPU *1 C/C++ (nvcc) CUDA NVIDIA GPU GPU CUDA CUDA 1 CUDA CUDA 2 CUDA NVIDIA GPU PC Windows Linux MaxOSX CUDA GPU CUDA NVIDIA
More informationMicrosoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
More informationC C UNIX C ( ) 4 1 HTML 1
C 2007 4 18 C UNIX 1 2 1 1.1 C ( ) 4 1 HTML 1 はじめ mkdir work 作業用ディレクトリーの作成 emacs hoge.c& エディターによりソースプログラム作成 gcc -o fuga hoge.c コンパイルにより機械語に変換 コンパイルエラー./fuga 実行 実行時エラー 完成 1: work hooge.c fuga 1 4 4 1 1.
More informationN88 BASIC 0.3 C: My Documents 0.6: 0.3: (R) (G) : enterreturn : (F) BA- SIC.bas 0.8: (V) 0.9: 0.5:
BASIC 20 4 10 0 N88 Basic 1 0.0 N88 Basic..................................... 1 0.1............................................... 3 1 4 2 5 3 6 4 7 5 10 6 13 7 14 0 N88 Basic 0.0 N88 Basic 0.1: N88Basic
More informationRubyWorld Conference 2011, Sep 5 2011 [6] 1 2 3 4-2SD -2SD -2SD -2SD [s] 56.9 68.8 33.7 36.6 27.1 29.1 22.5 24.0 21.8 20.5 22.9 22.3 24.3 24.0 24.4 24.2 [s] 101.9 115.1 85.2 92.8 57.1 62.9 42.5 46.3
More informationTaro-リストⅢ(公開版).jtd
リスト Ⅲ 0. 目次 2. 基本的な操作 2. 1 リストから要素の削除 2. 2 リストの複写 2. 3 リストの連結 2. 4 問題 問題 1 問題 2-1 - 2. 基本的な操作 2. 1 リストから要素の削除 まず 一般的な処理を書き つぎに 特別な処理を書く 一般的な処理は 処理 1 : リスト中に 削除するデータを見つけ 削除する場合への対応 特別な処理は 処理 2 : 先頭のデータを削除する場合への対応
More informationやさしい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
More informationuntitled
1 2 ...1 ...1...3...4...4...4...5...7...10 3-1...10 3-2...10 3-3...11 3-4 Windows2000 / XP...11 3-5 PC...13...14 4-1 SYSTEM...14 4-2 DISPLAY...15...17...20...22...23...24...25...25...25...25...26...28
More informationプログラミング基礎
C プログラミング Ⅰ 条件分岐 : if 文, if~else 文 条件分岐 条件分岐とは ある条件が成立したときとしないときで処理の内容を変更する場合に応じた, 複雑な処理を行うことができる 条件分岐 yes 成績が良かったか? no ご褒美に何か買ってもらう お小遣いが減らされる C 言語では,if 文,if~else 文,if~else if~else 文,switch 文で条件分岐の処理を実現できる
More informationNL-22/NL-32取扱説明書_操作編
MIC / Preamp ATT NL-32 A C ATT AMP 1 AMP 2 AMP 3 FLAT FLAT CAL.SIG. OVER LOAD DET. AMP 4 AMP 5 A/D D/A CONV. AMP 6 AMP 7 A/D CONV. Vref. AMP 8 AMP 10 DC OUT AMP 9 FILTER OUT AC DC OUT AC OUT KEY SW Start
More informationO(N) ( ) log 2 N
2005 11 21 1 1.1 2 O(N) () log 2 N 1.2 2 1 List 3-1 List 3-3 List 3-4? 3 3.1 3.1.1 List 2-1(p.70) 1 1 10 1 3.1.2 List 3-1(p.70-71) 1 1 2 1 2 2 1: 1 3 3.1.3 1 List 3-1(p.70-71) 2 #include stdlib.h
More informationVM-53PA1取扱説明書
VM-53PA1 VM-53PA1 VM-53 VM-53A VM-52 VM-52A VM-53PA1 VM-53PA1 VM-53A CF i ii VM-53 VM-53A VM-52 VM-52A CD-ROM iii VM-53PA1 Microsoft Windows 98SE operating system Microsoft Windows 2000 operating system
More information大統一Debian勉強会 gdb+python拡張を使ったデバッグ手法
Debian 2013 gdb+python nozzy@debian.or.jp 2013 6 29 Level Debian Up Debian Debian debian sid unstable Debian debian sid unstable *-dbg Debian debian sid unstable *-dbg gdb Debian debian sid unstable *-dbg
More informationthesis.dvi
H8 e041220 2009 2 Copyright c 2009 by Kentarou Nagashima c 2009 Kentarou Nagashima All rights reserved , H8.,,,..,.,., AKI-H8/3052LAN. OS. OS H8 Write Turbo. H8 C, Cygwin.,., windows. UDP., (TA7279P).,.
More informationpara02-2.dvi
2002 2 2002 4 23 : MPI MPI 1 MPI MPI(Message Passing Interface) MPI UNIX Windows Machintosh OS, MPI 2 1 1 2 2.1 1 1 1 1 1 1 Fig. 1 A B C F Fig. 2 A B F Fig. 1 1 1 Fig. 2 2.2 Fig. 3 1 . Fig. 4 Fig. 3 Fig.
More information1.3 ( ) ( ) C
1 1.1 (Data Base) (Container) C++ Java 1.2 1 1.3 ( ) ( ) 1. 2. 3. C++ 2 2.1 2.2 2.3 2 C Fortran C++ Java 3 3.1 (Vector) 1. 2. ( ) 3.2 3 3.3 C++ C++ STL C++ (Template) vector vector< > ; int arrayint vector
More information1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf ("%s", str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i
ABC066 / ARC077 writer: nuip 2017 7 1 For International Readers: English editorial starts from page 8. A : ringring a + b b + c a + c a, b, c a + b + c 1 # include < stdio.h> 2 3 int main (){ 4 int a,
More informationx h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i )
1 f(x) a b f(x)dx = n A(x i ) (1) ix [a, b] n i A(x i ) x i 1 f(x) [a, b] n h = (b a)/n y h = (b-a)/n y = f (x) h h a a+h a+2h a+(n-1)h b x 1: 1 x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x
More information(2 Linux Mozilla [ ] [ ] [ ] [ ] URL 2 qkc, nkc ~/.cshrc (emacs 2 set path=($path /usr/meiji/pub/linux/bin tcsh b
II 5 (1 2005 5 26 http://www.math.meiji.ac.jp/~mk/syori2-2005/ UNIX (Linux Linux 1 : 2005 http://www.math.meiji.ac.jp/~mk/syori2-2005/jouhousyori2-2005-00/node2. html ( (Linux 1 2 ( ( http://www.meiji.ac.jp/mind/tool/internet-license/
More informationA/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
More information