TEX American Mathematical Society PostScript Adobe Systems Incorporated
|
|
- くにひと さかわ
- 5 years ago
- Views:
Transcription
1 P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp)
2 TEX American Mathematical Society PostScript Adobe Systems Incorporated
3 pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD GOTO BASIC C PAD PAD pad2ps PAD PADEL(PAD Expression Language) C C, C++, Bourne shell, C shell, Java, AWK PAD PostScript PDF L A TEX Encapsulated PostScript (EPS) 4 pad2ps L A TEX pad.sty pad2tex pad2ps
4 2 1 PAD PostScript PDF L A TEX Encapsulated PostScript(EPS) PADEL PAD PAD C C Bourne shell C shell Java AWK PADEL L A TEX PAD PAD PAD
5 PAD PAD PAD PAD A pad2ps 33
6 4 1. PAD input N sum = 0 N > 1 i = 1, N print sum sum = sum + i 1: 1 N 1 PAD pad2ps PAD 1.1 pad2ps PAD PAD PAD PADEL(PAD Expression Language) PADEL PAD C pad2ps PAD C 1 N input N if(n > 1) sum = 0 for(i = 1, N) sum = sum + i print sum foo.pad 1.2 PostScript PostScript pad2ps % pad2ps foo.pad > foo.ps
7 1.3. PDF 5 PostScript PDF PostScript PDF PDF pad2pdf % pad2pdf foo.pad > foo.pdf 1.4 L A TEX L A TEX pad2tex % pad2tex foo.pad > foo.tex L A TEX dvi % jlatex foo.tex % xdvi foo.dvi C PAD L A TEX PostScript L A TEX pad2tex L A TEX \\ L A TEX 1 PAD L A TEX foo.tex \beginfigure[h] \endfigure \padseq% \fbox% PAD \documentstyle pad.sty 1 \fboxsep=10pt PAD pad2tex L A TEX /* pad2ps: texmode = latex */ \LaTeX /* pad2ps: message = $\sqrt2$ */ $ x = 1 $ while ( $ x^2-2 > $) $ \displaystyle x = x - \fracx^2-22 x $
8 6 1. PAD 2 x = 1 x 2 2 > x = x x2 2 2x 2: L A TEX texmode latex L A TEX 2 PAD pad2tex L A TEX 4 -tab -tab Encapsulated PostScript(EPS) EPS PAD L A TEX EPS pad2eps % pad2eps foo.pad foo pad2ps pad2tex pad2ps PostScript EPS foo.1.eps foo.2.eps.eps.1.eps ls -stdin % cat foo.pad pad2eps -stdin foo EPS PAD L A TEX \documentstyle epsf.sty EPS \epsfilefile=foo.1.eps,width=5cm,height=7cm EPS pad.sty 1.1j
9 7 2 PADEL PADEL(PAD Expression Language) PAD PAD 1 pad2ps PAD PADEL C C PADEL PAD 1 \ PADEL pad2ps if( (^_^;;; ) m( )m <== "^\(-o-) PADEL (ˆ ˆ;;; m( )m <== ˆ\( o ) PAD 1.4 pad2tex texmode latex L A TEX L A TEX \ \\ L A TEX PADEL 2.1 PAD PADEL PAD n factorial(n) f = 1 for(i = 1, n) f = f * i return f
10 8 2. PADEL PADEL 1 PAD C 1 C 1 PADEL PAD PAD 1 C factorial(n) f = 1 for(i = 1, n) f = f * i return f PADEL ( ) 1 PAD ( ) 1 PAD PADEL 1 /* // PAD 2.2 input x print x*x input x print x x
11 for while 1 else while catch L1: /* // 1 for ( i = 0, 10 ) /* comment */ for ( i = 0, 10 ) / comment / 2.3 PADEL PAD PAD PAD PAD PAD vsp PAD
12 10 2. PADEL ( ) ( ) input a.x input a.y input b.x input b.y c.x = a.x + b.x c.y = a.y + b.y print c.x print c.y input a.x input a.y input b.x input b.y c.x = a.x + b.x c.y = a.y + b.y print c.x print c.y PAD 1 /* // PADEL while do while for do input N while(n < 1)
13 for(i = 1, N) input A[i] for(i = 2, N) j = i while(j >= 2 && A[j-1] > A[j]) A[j-1] <-> A[j] j = j - 1 for(i = 1, N) print A[i] N < 1 i = 1, N i = 2, N i = 1, N input N input A[i] j = i j >= 2 && A[j 1] > A[j] print A[i] A[j 1] < > A[j] j = j 1 N N 1 N for 1 while for while PAD for while 1 for(i = 1, N) input A[i] for(i = 1, N) C for(i = 1, N) input A[i]
14 12 2. PADEL for(i = 1, N) input A[i] for(i = 1, N) input A[i] do while do input N while(n < 1) for(i = 1, N) input A[i] for ( i = 1, N ) input A[i] 2.6 if else switch if else switch if else 1 if else if else if if(x < 0) x = -x x < 0 x = x
15 else i if(x >= 0) print sqrt(x) else print sqrt(-x) print i x >= 0 print sqrt(x) print sqrt( x) print i if else 1 if(x < 0) x = -x if(x < 0) x = -x if(x >= 0) else x = -x if(x < 0) else if ( x >= 0 ) print sqrt(x) else print sqrt(-x) print i switch
16 14 2. PADEL switch case x>0: return 1 case x=0: return 0 case x<0: return -1 x>0 x=0 x<0 return 1 return 0 return 1 3 case C switch(n%3) case 0: print case 1: print case 2: print switch case n%3=0: print case n%3=1: print case n%e=2: print default default PAD 1 1 one = 0 prime = 0 others = 0 for(i = 1, N) switch(a[i]) case 1: one = one + 1 case 2:
17 case 3: case 5: case 7: prime = prime + 1 default: others = others + 1 one = 0 prime = 0 others = 0 i = 1, N A[i]=1 A[i]=2 A[i]=3 A[i]=5 A[i]=7 one = one + 1 prime = prime + 1 others = others + 1 case default switch case x%3=0: case x%3=1: move(+1) case x%3=2: move(-1) x%3=0 x%3=1 x%3=2 move(+1) move( 1)
18 16 2. PADEL PAD 2 switch case default 1 switch case n > 0 && m > 0: print n*m > 0 case n < 0: print n < 0 if else if else if(x>0) return 1 else if(x=0) return 0 else error switch switch case x>0: return 1 case x=0: return 0 default: error x>0 x=0 return 1 return 0 error else if if else if else if(x>0) return 1 else if(x=0) return 0 else error 2 pad2tex LATEX
19 if else x>0 return 1 return 0 x=0 error if PAD 2.7 try catch try for(x = 0, 1, 0.01) y = f(x) / g(x) print y catch(g(x) = 0) print Divided by 0! x = 0, 1, 0.01 y = f(x) / g(x) print y g(x) = 0 print Divided by 0! if PAD try catch try catch 1 try print sty catch(str = NULL) print NULL! try print sty
20 18 2. PADEL catch (str = NULL) print NULL! try print sty catch(str = NULL) print NULL! 2.8 PADEL PAD PAD label refer PAD refer label Let s start! input x label Repeat 10 times. for (i = 1, 10) print x*i refer (Let s start!) goto Let s start! input x Repeat 10 times. i = 1, 10 goto Let s start! print x i label 1 refer refer ( ) goto 3
21 refer (LABEL) goto refer refer (EXIT) if (x = 0) print \n print The End if (x = 0) print \n EXIT print The End C ( ) : ( ) PADEL LABEL1: label LABEL1 1 1 : ( ) PADEL : : for 2.9 PADEL PAD C C++ /* */ // 2 PADEL 1 PADEL /* // */
22 20 2. PADEL for ( i = 0, N ) /* N */ sum = sum + i C PAD 4
23 21 3 PAD pad2ps C PA D pad2ps PAD pad2ps PADEL PAD PAD PADEL PADEL mkpad C % mkpad -c foo.c > foo.pad foo.pad pad2ps pad2ps PAD PADEL mkpad PADEL PADEL 3.1 C C PAD % pad2ps -c foo.c > foo.ps.c -c C c2pad PADEL % mkpad -c foo.c > foo.pad -c C PAD PAD -O ; ( ) PAD -semicolon C #ifdef foo.c PAD foo.c % gcc foo.c -DJAPANESE -DJAPANESE pad2ps PA D % pad2ps foo.c -D JAPANESE > foo.ps
24 22 3. PAD -D C C pad2ps #include <stdio.h> -D -ifdef % pad2ps foo.c -ifdef C PAD C #define NUMBER(X). puts("print Numbers"); NUMBER( 9 ) putchar( \n ); int a; for( a= 0 ; a<=x ; a++) putchar(a); ; ( ) PAD 3.2 C++ C++ PAD % pad2ps -c++ foo.c > foo.ps.c,.cc,.cpp -c++ C++ c2pad PADEL % mkpad -c++ foo.c > foo.pad -c++ C++ C 3.1 C++ PAD -inline
25 3.3. Bourne shell Bourne shell Bourne shell PAD % pad2ps -sh foo.sh > foo.ps.sh -sh Bourne shell sh2pad PADEL % mkpad -sh foo.sh > foo.pad -sh Bourne shell 1 PAD PAD function PAD PAD PAD Bourne shell cat << EOF EOF. cat << EOF EOF 1 PAD Bourne shell PAD 3.4 C shell C shell PAD % pad2ps -csh foo.csh > foo.ps.csh -csh C shell csh2pad PADEL % mkpad -csh foo.csh > foo.pad -csh C shell 1 PAD PAD C shell cat << EOF EOF. cat << EOF EOF 1 PAD C shell PAD
26 24 3. PAD 3.5 Java Java PAD % pad2ps -java foo.java > foo.ps.java -java Java java2pad PADEL % mkpad -java foo.java > foo.pad -java Java PAD PAD -O ; ( ) PAD -semicolon Java PAD 3.6 AWK AWK PAD % pad2ps -awk foo.awk > foo.ps.awk -awk AWK awk2pad PADEL % mkpad -awk foo.awk > foo.pad -awk AWK BEGIN END PAD BEGIN END PAD AWK PAD j Tcl/Tk, Pascal, Fortran, Perl C sed awk pad2ps C
27 25 4 PAD PADEL /* pad2ps: centering = on */ -P % pad2ps foo.pad -P centering=on > foo.ps message comment newpage vsp 4 L A TEX 4.1 title /* pad2ps: title = This is a pad title. */ 4.2 message PAD message input N /* pad2ps: message = */ for(i = 1, N) input A[i] input N i = 1, N input A[i]
28 26 4. PAD 1 /* pad2ps: message = */ for(i = 1, N) if( A[i] > 0 ) /* pad2ps: message = */ m = m + 1 else /* pad2ps: message = */ m = m - 1 /* pad2ps: message = */ for(i = 1, N) if( A[i] > 0 ) /* pad2ps: message = */ m = m + 1 else /* pad2ps: message = */ m = m PADEL comment 2.9 PADEL PAD PAD sum = 0 N = 100 // pad2ps: comment = /* */ for(i = 1, N) sum = sum + i * i // pad2ps: comment = /* */
29 4.4. PADEL L A TEX 27 sum = 0 N = 100 / / i = 1, N sum = sum + i i / / PAD 1 ( ) for(i = 1, N) /* pad2ps: comment = */ sum = sum + i * i 4.4 PADEL L A TEX pad2tex L A TEX texmode latex verbatim PADEL L A TEX L A TEX PADEL verbatim PADEL PAD latex /* pad2ps: texmode = latex */ /* pad2ps: message = $\sqrt2$ */ $ x = 1 $ while ( $ x^2-2 > $) $ \displaystyle x = x - \fracx^2-22 x $ PAD 2 x = 1 x 2 2 > x = x x2 2 2x verbatim
30 28 4. $\sqrt2$ $ x = 1 $ $ xˆ2 2 > $ $ \displaystyle x = x \fracxˆ2 22 x $ 4.5 centering on off on off on 4.6 PAD locate topdown bottomup middle middle 4.7 page figure 4.9 figure locate top bottom PAD PAD top PAD bottom bottom top 4.10 PAD titlebox on off PAD off PAD (C ) PA D on PAD PAD PAD off titlebox on
31 N input N sum = 0 N > 1 i = 1, N print sum sum = sum + i 4.11 pageframe on off 4.12 PAD padframe on PAD on off centering on PAD off 4.13 PAD slice on PAD PAD 1 1 PAD off PAD 4.14 pad2ps PAD hrate vrate 1.0 hrate hrate poster on vrate 4.15 PAD pad2ps 1 PAD PAD 1
32 : PAD hrate 1 PA D poster on PostScript PAD poster on hrate vrate PAD 3 ( 3) ack.pad poster on PAD PAD 4.16 PAD pad2ps PAD PAD pad2ps PAD PAD PA D max length min length 0 pad2ps 4.17 newpage
33 4.18. PAD PAD PAD PAD 2 vsp PAD PADEL vsp vsp PAD vsp PAD PAD PAD 4.19 page top page bottom page left page right page left page right centering off on page bottom fontsize fontwidth fontsize jfontwidth PAD PAD
34 32 4. title rate 2.0 padtitle rate PAD 1.5 figure rate 1.5 padtitle rate figure rate figure 4.21 PAD PAD pad vspace 400 vspace 200 hspace 200 if vspace 50 box hspace 125 if rightspace 200 sideline space 50 padframe vspace 180 padframe hspace PAD linewidth PAD 16 padlinewidth PAD 16 framelinewidth PAD 8
35 33 A pad2ps pad2ps
36 34 pad2ps pad2df pad2tex pad.sty texmode tab pad2eps stdin epsf.sty PADEL , , , while do while for , if else , switch case default if else try catch label refer / / // mkpad C c c2pad O semicolon D ifdef C c c2pad inline Bourne shell sh sh2pad C shell csh csh2pad Java java java2pad O semicolon AWK awk awk2pad P title message , comment , texmode centering locate page figure figure locate titlebox pageframe padframe slice hrate vrate poster max length min length newpage vsp page top page bottom page left page right fontsize fontwidth jfontwidth
37 35 title rate padtitle rate figure rate pad vspace vspace hspace if vspace box hspace if rightspace sideline space padframe vspace padframe hspace linewidth padlinewidth framelinewidth
電気通信大学 コンピュータリテラシー 文書整形 --- LaTeX ---
1 L A TEX B5 1. LaTeX ( ) : 1 3 2. LaTeX ( ) : 4 7 3. LaTeX (,, EPS ) : 8 10 4. LaTeX ( ) : 11 textlatex.pdf : tiny.tex, tiny.pdf : 1 small.tex, small.pdf : 2 normal.tex, normal.pdf : f1.eps : normal.tex
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 informationL A TEX? Word Word Word Word WYSIWYG T E X by Donald Knuth L A T E X by Leslie Lamport L A T E X 2ε L A T E X 2ε, pt E X, pl A T E X LATEX p.2/27
L A TEX 2007 2007 10 5 ( ) 338 8570 255 Tel: 048 858 3577, Fax : 048 858 3716 Email: tohru@mail.saitama-u.ac.jp URL: http://www.nls.ics.saitama-u.ac.jp/ tohru/ LATEX p.1/27 L A TEX? Word Word Word Word
More informationgnuplot.dvi
gnuplot gnuplot 1 gnuplot exit 2 10 10 2.1 2 plot x plot sin(x) plot [-20:20] sin(x) plot [-20:20][0.5:1] sin(x), x, cos(x) + - * / ** 5 ** plot 2**x y =2 x sin(x) cos(x) exp(x) e x abs(x) log(x) log10(x)
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 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 informationAppendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1) (2) ( ) BASIC BAS
Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1 (2 ( BASIC BASIC download TUTORIAL.PDF http://hp.vector.co.jp/authors/va008683/
More information超初心者用
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
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 informationMinimum 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
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 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 informationC 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in
C 1 / 21 C 2005 A * 1 2 1.1......................................... 2 1.2 *.......................................... 3 2 4 2.1.............................................. 4 2.2..............................................
More informationP03.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("");
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 informationjoho12.ppt
n φ 1 (x),φ 2 (x),,φ n (x) (x i, f i ) Q n c 1,,c n (,f k ) q n = c i φ i (x) x Q n i=1 c 1 = 0 c 1 n ( c 1 ) = q n f k 2 Q n ( c 1 ) = q 2 2 n ( ) 2 f k q n ( ) + f k Q n c 1 = c 1 q n 2 q n( ) q n q
More informationC¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç
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
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 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 informationlexex.dvi
(2018, c ) http://istksckwanseiacjp/ ishiura/cpl/ 4 41 1 mini-c lexc,, 2 testlexc, lexc mini-c 1 ( ) mini-c ( ) (int, char, if, else, while, return 6 ) ( ) (+, -, *, /, %, &, =, ==,!=, >, >=,
More informationコンピュータ概論
4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
More informationall.dvi
fortran 1996 4 18 2007 6 11 2012 11 12 1 3 1.1..................................... 3 1.2.............................. 3 2 fortran I 5 2.1 write................................ 5 2.2.................................
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
More information: gettoken(1) module P = Printf exception End_of_system (* *) let _ISTREAM = ref stdin let ch = ref ( ) let read () = (let c =!ch in ch := inp
7 OCaml () 1. 2. () (compiler) (interpreter) 2 OCaml (syntax) (BNF,backus normal form ) 1 + 2; let x be 2-1 in x; ::= ; let be in ; ::= + - ::= * / ::= 7.1 ( (printable characters) (tokens) 1 (lexical
More informationohp07.dvi
17 7 (2) 2017.9.13 1 BNF BNF ( ) ( ) 0 ( ) + 1 ( ) ( ) [ ] BNF BNF BNF prog ::= ( stat ) stat ::= ident = expr ; read ident ; print expr ; if ( expr ) stat while ( expr ) stat { prog expr ::= term ( +
More informationex01.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
More informationex01.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
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 information卒 業 研 究 報 告.PDF
C 13 2 9 1 1-1. 1-2. 2 2-1. 2-2. 2-3. 2-4. 3 3-1. 3-2. 3-3. 3-4. 3-5. 3-5-1. 3-5-2. 3-6. 3-6-1. 3-6-2. 4 5 6 7-1 - 1 1 1-1. 1-2. ++ Lisp Pascal Java Purl HTML Windows - 2-2 2 2-1. 1972 D.M. (Dennis M Ritchie)
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 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 informationUSB 0.6 https://duet.doshisha.ac.jp/info/index.jsp 2 ID TA DUET 24:00 DUET XXX -YY.c ( ) XXX -YY.txt() XXX ID 3 YY ID 5 () #define StudentID 231
0 0.1 ANSI-C 0.2 web http://www1.doshisha.ac.jp/ kibuki/programming/resume p.html 0.3 2012 1 9/28 0 [ 01] 2 10/5 1 C 2 3 10/12 10 1 2 [ 02] 4 10/19 3 5 10/26 3 [ 03] 6 11/2 3 [ 04] 7 11/9 8 11/16 4 9 11/30
More information新版明解C言語 実践編
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,
More information橡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
More information3 Java 3.1 Hello World! Hello World public class HelloWorld { public static void main(string[] args) { System.out.println("Hello World");
(Basic Theory of Information Processing) Java (eclipse ) Hello World! eclipse Java 1 3 Java 3.1 Hello World! Hello World public class HelloWorld { public static void main(string[] args) { System.out.println("Hello
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[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 information2.4.7 \ AWK AWK......
AWK ogurisu@lagendra.s.kanazawa-u.ac.jp 2001 1 8 ( ): 1 2002 10 10 ( ): 1.1 AWK C Java AWK perl, ruby web AWK A4 A4 1 ( :p) 2 1 AWK 2 2 AWK 4 2.1 AWK............................... 5 2.2 AWK NR NF.....................................
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
More information1 4 2 EP) (EP) (EP)
2003 2004 2 27 1 1 4 2 EP) 5 3 6 3.1.............................. 6 3.2.............................. 6 3.3 (EP)............... 7 4 8 4.1 (EP).................... 8 4.1.1.................... 18 5 (EP)
More informationr07.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
More informationohp07.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
More informationtex02.dvi
2002 2 L A TEX 2002 4 15 : L A TEX EPS EPS 1 L A TEX L A TEX L A TEX L A TEX 1.1 L A TEX 1.1.1 L A TEX TEX.tex.tex.tex 1.1.2 TEX 1. TEX L A TEX Y TEX L A TEX Y (@ ) TEX L A TEX 2. 1 YTeX YTeX ( ) 3. 2
More informationtex03final1.dvi
2002 3 L A TEX 2002 4 20 : TEX dvi PDF mikilab 1 L A TEX 1.1 Table 1.1 Table 1 1 1400 1 1700 Fig. 1 \begin{tabular}{ ()}. Fig. 2 tabular Table 2 tabular l c r \begin{center} \begin{tabular}{lcr} & & \\
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 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 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 informationMIFES Ver.7.0 マクロマニュアル
iv v vi 2 3 4 5 6 * * * 7 8 @6=@str3[@7++]+A insstr(mifes) :sub1 move(@@str3) :if then / goto : / gosub : if then if input(@str3,) == 0 then exit() goto if @ code == 0x0d0a @code == 0x000a goto :ret gosub
More informationver 0.3 Chapter 0 0.1 () 0( ) 0.2 3 4 CHAPTER 0. http://www.jaist.ac.jp/~t-yama/k116 0.3 50% ( Wikipedia ) ( ) 0.4! 2006 0.4. 5 MIT OCW ( ) MIT Open Courseware MIT (Massachusetts Institute of Technology)
More information解きながら学ぶ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
More information9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)
E-mail: takio-kurita@aist.go.jp 1 ( ) CPU ( ) 2 1. a f(a) =(a 1.0) 2 (1) a ( ) 1(a) f(a) a (1) a f(a) a =2(a 1.0) (2) 2 0 a f(a) a =2(a 1.0) = 0 (3) 1 9 8 7 (x-1.0)*(x-1.0) 6 4 2.0*(x-1.0) 6 2 5 4 0 3-2
More information1. 入力した正の整数を降順に並べ換えて出力するプログラムを作成せよ プログラムは個別にコンパイルし make コマンドで実行すること 入力データは 50 以下とし 以下の数が混在しているとする 16 進数 : 先頭 1 文字が x または X( エックスの小文字か大文字 ) 8 進数 : 先頭 1
1. 入力した正の整数を降順に並べ換えて出力するプログラムを作成せよ プログラムは個別にコンパイルし make コマンドで実行すること 入力データは 50 以下とし 以下の数が混在しているとする 16 進数 : 先頭 1 文字が x または X( エックスの小文字か大文字 ) 8 進数 : 先頭 1 文字が 0( 零 ) 10 進数 : 先頭 1 文字が 0( 零 ) 以外の数字 1.1 プログラム
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 information(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1
(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1 17 Fortran Formular Tranlator Lapack Fortran FORTRAN, FORTRAN66, FORTRAN77, FORTRAN90, FORTRAN95 17.1 A Z ( ) 0 9, _, =, +, -, *,
More information第1章
...1... 1... 1...3... 3... 5... 6...9... 9... 9... 9... 10... 12... 14 Windows...16... 16... 16...21... 21... 25...30...31...32...33 3 1 2 3 4 5 6 7 8 n x, y i 0,1,, n 1 i i y P x ) i 0, 1,, n 1 n 1 i
More informationWindows Cygwin Mac *1 Emacs Ruby ( ) 1 Cygwin Bash Cygwin Windows Cygwin Cygwin Mac 1 Mac 1.2 *2 ls *3 *1 OS Linux *2 *3 Enter ( ) 2
September 2016 1 Windows Cygwin Mac *1 Emacs Ruby 1 1.1 ( ) 1 Cygwin Bash Cygwin Windows Cygwin Cygwin Mac 1 Mac 1.2 *2 ls *3 *1 OS Linux *2 *3 Enter ( ) 2 ~/16:00:20> ls 2 2 ls ls -a ~/16:00:20> ls -a
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 information10/ / /30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20 6. http, CGI Perl 11/27 7. ( ) Perl 12/ 4 8. Windows Winsock 12/11 9. JAV
tutimura@mist.i.u-tokyo.ac.jp kaneko@ipl.t.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/sem3/ 2002 11 20 p.1/34 10/16 1. 10/23 2. 10/30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20
More informationRR-US470 (RQCA1588).indd
RR-US470 Panasonic Corporation 2006 2 3 4 http://www.sense.panasonic.co.jp/ 1 2 3 ( ) ZOOM 5 6 7 8 9 10 4 2 1 3 4 2 3 1 3 11 12 1 4 2 5 3 1 2 13 14 q φ φ 1 2 3 4 3 1 2 3 4 2 3 15 16 1 2 3 [/]p/o 17 1 2
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 information[ 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 ) ;
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 information/
/ 1 UNIX AWK( ) 1.1 AWK AWK AWK A.V.Aho P.J.Weinberger B.W.Kernighan 3 UNIX AWK GNU AWK 1 1.2 1 mkdir ~/data data ( ) cd data 1 98 MS DOS FD 1 2 AWK 2.1 AWK 1 2 1 byte.data 1 byte.data 900 0 750 11 810
More informationn 第1章 章立ての部分は、書式(PC入門大見出し)を使います
FORTRAN FORTRAN FORTRAN ) DO DO IF IF FORTRAN FORTRAN(FORmula TRANslator)1956 IBM FORTRAN IV FORTRAN77 Fortran90 FORTRAN77 FORTRAN FORTARN IF, DO C UNIX FORTRAN PASCAL COBOL PL/I BASIC Lisp PROLOG Lisp
More information̤Äê
SNS 1, IT.,.,.,., SNS,,,..,,.,,,.,.,,. 2 1 6 1.1................................................ 6 1.2................................................ 6 1.3...............................................
More informationfuga 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 進数の整数 おまじない取り込んだ値を代入する変数
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 information( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1
() 2006 2 27 1 10 23 () 30 () 27 [1] p.97252 7 2 2.1 2.1.1 1 LIFO(last in first out, ) (push) (pup) 1 1: 2.1.2 1 List 4-1(p.100) stack[] stack top 1 2 (push) (pop) 1 2 void stack push(double val) val stack
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 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平成 31 年度 筑波大学大学院博士課程 システム情報工学研究科 コンピュータサイエンス専攻 博士前期課程 ( 一般入学試験 8 月期 ) 試験問題基礎科目 ( 数学, 情報基礎 ) Mathematics/Fundamentals of Computer Science [ 注意事項 ][Inst
平成 31 年度 筑波大学大学院博士課程 システム情報工学研究科 コンピュータサイエンス専攻 博士前期課程 ( 一般入学試験 8 月期 ) 試験問題基礎科目 ( 数学, 情報基礎 ) Mathematics/Fundamentals of Computer Science [ 注意事項 ][Instructions] 1. 試験開始の合図があるまで, 問題の中を見てはいけません. また, 筆記用具を手に持ってはいけません.
More informationjavascript key
Associate Professor Department of International Social Studies KYOAI GAKUEN UNIVERSITY Email: ogashiwa@c.kyoai.ac.jp, ogashiwa@wide.ad.jp sample
More informationContents P. P. 1
Contents P. P. 1 P. 2 TOP MESSAGE 3 4 P. P. 5 P. 6 7 8 9 P. P. P. P. P. 10 11 12 Economy P. P. 13 14 Economy P. 1,078 1,000 966 888 800 787 716 672 600 574 546 556 500 417 373 449 470 400 315 336 218 223
More information導入基礎演習.ppt
Multi-paradigm Programming Functional Programming Scheme Haskell ML Scala X10 KL1 Prolog Declarative Lang. C Procedural Lang. Java C++ Python Object-oriented Programming / (root) bin home lib 08 09
More informationMicrosoft Word - report#8.docx
プログラミング I report#8 提出日 :7 月 18 日 ( 木 ) 所属 : 工学部情報工学科学籍番号 :135713B 氏名 : 天願寛之 目次 ソース cardinal についての考察ソース conv10 についての考察ソース select_sort.c についての考察ソース print_num.c についての考察ソース msg.c についての考察感想 P4 P7 P10 P13 P14
More information解きながら学ぶ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 &=...
More information8 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
More informationDA100データアクイジションユニット通信インタフェースユーザーズマニュアル
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
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 information18 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
More information13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software Nspire Nspire Nspir
13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software 37.1 37.1 Nspire Nspire Nspire 37.1: Student Software 13 2 13 Student Software esc
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 informationuntitled
1 4 4 6 8 10 30 13 14 16 16 17 18 19 19 96 21 23 24 3 27 27 4 27 128 24 4 1 50 by ( 30 30 200 30 30 24 4 TOP 10 2012 8 22 3 1 7 1,000 100 30 26 3 140 21 60 98 88,000 96 3 5 29 300 21 21 11 21
More informationuntitled
C -1 - -2 - concept lecture keywords FILE, fopen, fclose, fscanf, fprintf, EOF, r w a, typedef gifts.dat Yt JZK-3 Jizake tsumeawase 45 BSP-15 Body soap set 3 BT-2 Bath towel set 25 TEA-2 Koutya
More informationlistings-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
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A, B Z Z m, n Z m n m, n A m, n B m=n (1) A, B (2) A B = A B = Z/ π : Z Z/ (3) A B Z/ (4) Z/ A, B (5) f : Z Z f(n) = n f = g π g : Z/ Z A, B (6)
More informationMicrosoft PowerPoint - C_Programming(3).pptx
H23 年度秋学期情報スキル活用 入門 担当 : 田中基彦 ( 工学部共通教育科 ) Email: ak_tanaka@isc.chubu.ac.jp 授業のホームページ学術情報センター > 教育支援 > 情報リテラシー 授業の日程 講義内容提出課題 連絡事項を掲載 > 定期的にアクセスして確認する C 言語によるプログラミング (3) 制御文 繰り返し文 if, while, switch, for,
More information# let rec sigma (f, n) = # if n = 0 then 0 else f n + sigma (f, n-1);; val sigma : (int -> int) * int -> int = <fun> sigma f n ( : * -> * ) sqsum cbsu
II 4 : 2001 11 7 keywords: 1 OCaml OCaml (first-class value) (higher-order function) 1.1 1 2 + 2 2 + + n 2 sqsum 1 3 + 2 3 + + n 3 cbsum # let rec sqsum n = # if n = 0 then 0 else n * n + sqsum (n - 1)
More informationMicrosoft Word - no206.docx
3.2 双方向リスト 今までのリストは 前から順にたどることしかできませんでした 今度は逆にもたどることができる 双方向リストを扱います この場合は 構造体には次を表すポインタの他に前を表すポインタを持つ ことになります 今回は最初と最後をポインタを使うと取り扱いが面倒になるので 最初 (start) と最後 (end) を どちらとも構造体 ( 値は意味を持たない ) を使うことにします こうすることによって
More information2008 IIA (program) pro(before)+gram(write) (artificial language) (programming languege) (programming) (machine language) (assembly language) ( )
2008 IIA 1 1.1 (program) pro(before)+gram(write) (artificial language) (programming languege) (programming) (machine language) (assembly language) () (high-level language) 3 (machine language) (CPU) 0
More informationMicrosoft Word - 03-数値計算の基礎.docx
δx f x 0 + δ x n=0 a n = f ( n) ( x 0 ) n δx n f x x=0 sin x = x x3 3 + x5 5 x7 7 +... x ( ) = a n δ x n ( ) = sin x ak = (-mod(k,2))**(k/2) / fact_k 10 11 I = f x dx a ΔS = f ( x)h I = f a h I = h b (
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 informationCopyright c 2006 Zhenjiang Hu, All Right Reserved.
1 2006 Copyright c 2006 Zhenjiang Hu, All Right Reserved. 2 ( ) 3 (T 1, T 2 ) T 1 T 2 (17.3, 3) :: (Float, Int) (3, 6) :: (Int, Int) (True, (+)) :: (Bool, Int Int Int) 4 (, ) (, ) :: a b (a, b) (,) x y
More informationax 2 + bx + c = n 8 (n ) a n x n + a n 1 x n a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 4
20 20.0 ( ) 8 y = ax 2 + bx + c 443 ax 2 + bx + c = 0 20.1 20.1.1 n 8 (n ) a n x n + a n 1 x n 1 + + a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 444 ( a, b, c, d
More informationスパコンに通じる並列プログラミングの基礎
2016.06.06 2016.06.06 1 / 60 2016.06.06 2 / 60 Windows, Mac Unix 0444-J 2016.06.06 3 / 60 Part I Unix GUI CUI: Unix, Windows, Mac OS Part II 0444-J 2016.06.06 4 / 60 ( : ) 6 6 ( ) 6 10 6 16 SX-ACE 6 17
More information