Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal
|
|
|
- うきえ しもね
- 7 years ago
- Views:
Transcription
1 Pascal
2 Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal if case for while repeat A Pascal 12 A.1 Pascal A.2 Pascal B 13 1
3 1 Pascal 1.1 Hello. Pascal 1.1. Hello. program Lesson1; writeln( Hello. ); 1 Pascal program ; ;() 2 () 3 Hello. 4 ()? No? Yes No 1.2 Pascal Hello. Yes PCPad.exe 2
4 1.3 2 a b Pascal program Lesson2; var a,b,wa:integer; write( a= ); readln(a); write( b= ); readln(b); wa:=a+b; writeln( a+b=, wa); 1 Pascal program ; ;() 2 a, b, wa 3 () 4 a= write writeln 5 a 8 a+b wa ( ) = := 9 a+b= wa 10 () Pascal program ; const type var procedure function const < >=< >; < >=< >; n=10 v= name= const n=10; v=2.71e-12; name= ; Pascal 3
5 type < >=< >; < >=< >; vector Pascal sin function < >(>,, <>):< >; < > type vector=array[1..3] of real; 1.7. a b ( ) var < >,, < >:< >; < >,, < >:< >; 1.5. a,b x,y,r ans name 30 var a,b:integer; x,y,r:real; ans:char; name:string[30]; Pascal BASIC procedure <>(>,, <>); 1.6. a b procedure exchg(var a,b:integer); var c:integer; c:=a; a:=b; b:=c; function max(a,b:real):real; if a>b then max:=a else max:=b; BASIC FORTRAN Pascal 5 byte shortint integer word longint MaxInt=32767 MaxLongInt= a, b 4
6 program Lesson3; var a,b,wa,sa,seki,shou,amari:integer; write( a= ); readln(a); write( b= ); readln(b); wa:=a+b; sa:=a-b; seki:=a*b; shou:=a div b; amari:=a mod b; writeln( a+b=, wa); writeln( a-b=, sa); writeln( a*b=, seki); writeln( a div b=, shou); writeln( a mod b=, amari); 2 a, b, wa, seki, shou, amari 6 a+b wa 7 a-b sa 8 a b seki 9 a div b shou 10 a mod b amari 11 a+b = wa 15 a mod b = amari 2.2 Pascal real ( ) 11 + / : trunc(x) round(x) x ; x 2.2. v x program Lesson4; var v, x:real; h, m:integer; write( ); readln(v); write( (km) ); readln(x); h:=trunc(x/v); m:=round((x/v - h)*60); writeln(h,,m, ); 12 a-b = sa 13 a b = seki 14 a div b = shou 2 v, x 3 h, m 5
7 5 6 v 7 (km) 8 x 9 x/v h 10 x/v-h 60 m 11 h m n:=length(name); writeln( Length is, n); writeln( Initial is, init); 2 name 20 3 init 4 n 5 Your first name? 2.3 a,..., z A,..., Z 0,..., 9 1 : var c1,c2: char; 1 2 : var name: string[20]; 2.3. ( ) 6 name 7 init name 1 8 n name 9 Length is n 10 Initial is init 2.4 true( ) false( ) 2 : var c: boolean; program Lesson5; var name: string[20]; init: char; n: integer; write( Your first name? ); readln(name); init:=name[1]; : not, and, or, =, <>, <=, >=, <, > 2.4. a=b c d true false (a=b) and (c>=d) 6
8 a 1, a 2,..., a 100 Pascal a a[1], a[2],, a[100] 2.5. a b var a: array[1..100] of integer; b: array[1..100] of real; if if if 2 : if then if then 1 else else 1 ; program Lesson6; var a,b,d,x1,x2: real; writeln( x^2 + ax + b = 0 ); write( a= ); readln(a); write( b= ); readln(b); d:=a*a - 4*b; if d>=0 then 3.2 case x1:=(-a - sqrt(d))/2; x2:=(-a + sqrt(d))/2; writeln(x1:5:3); writeln(x2:5:3); end else writeln( ); 1 case case : case of case,, case : ; case,, case : ; 3.3. program Lesson7; var mon:integer; write( ); readln(mon); case mon of 3..5 : write( ); 6..8 : write( ); : write( ); 12, 1..2 : write( ); 7
9 2 mon 4 5 mon 6 11 mon 3 5 mon 6 8 mon 9 11 mon for for for 2 : for := to do ( 1 ) for := downto do ( 1 ) 4 n= n 5 s 0 6 a 1 n s s+a n s a b<c c n program Lesson9; var a,b,c,n: integer; write( n = ); readln(n); for a:=1 to n do for b:=a to n do for c:=b to n do if a*a+b*b=c*c then writeln(a:5,b:5,c:5); n program Lesson8; var a,n,s: integer; write( n = ); readln(n); s:=0; for a:=1 to n do s:=s + a; writeln( ,n, =,s); 2 a, n, s 2 a, b, c, n 4 n= n 5 8 a 1 n b a n c b n a a+b b=c c a b c program Lesson10; const n=10; var a: array[1..n] of integer; 8
10 h,s,t,v:real; i,x:integer; for i:=1 to n do readln(a[i]); s:=0; for i:=1 to n do s:=s+a[i]; h:=s/n; (* *) t:=0; for i:=1 to n do t:=t+sqr(a[i]-h); v:=sqrt(t/n); (* *) writeln(h:5:2,, v:5:2); 2 n 10 3 a h, s, t, v 5 i, x 7 i 1 n a i a[i] 8 s 0 9 i 1 n s s+a[i] s a[1] a[n] 10 h s/n h a[1] a[n] (* *) 11 t 0 12 i 1 n t t+(a[i]-h) 2 t (a[1]-h) 2 (a[n]-h) 2 13 v t/n v a[1] a[n] 14 h v 4.2 while while : while do 4.4. program Lesson11; var a,n,amax: integer; write( 2 ); readln(n); amax:=trunc(sqrt(n)); if n mod 2=0 then if n=2 then writeln(n, ) else writeln(n, ); end else a:=3; while (n mod a<>0) and (a<=amax) do a:=a+2; if (n mod a=0) and (n>a) then writeln(n, ) else writeln(n, ); 2 a, n, amax 4 2 n 9
11 5 amax n 6 n 2 0 (n ) 7 9 n=2 n n 10 n r:=a mod b; a:=b; b:=r; until b=0; writeln(,a); 2 a, b, r 11 a 3 12 n a 0 a amax a a+2 13 n a 0 n>a n 14 n 4 a= a 5 b= b 6 b>a 7 r a a b b r 4.3 repeat 9 11 r a b a b b r b 0 repeat : 12 a repeat until 4.5. program Lesson12; var a,b,r: integer; write( a = ); readln(a); write( b = ); readln(b); if b>a then r:=a; a:=b; b:=r; repeat : procedure <>(>,, <>); < > var var 10
12 5.1. program Lesson13; type complex=array[1..2] of real; var x,y,z: complex; (* c:=a*b *) procedure compmul(var c: complex; a,b: complex); c[1]:=a[1]*b[1]-a[2]*b[2]; c[2]:=a[1]*b[2]+a[2]*b[1]; write( Re x = ); readln(x[1]); write( Im x = ); readln(x[2]); write( Re y = ); readln(y[1]); write( Im y = ); readln(y[2]); compmul(z,x,y); writeln( x*y =,z[1]:4:2, +,z[2]:4:2, i ); 2 complex x, y, z complex 5 9 a b c compmu lc a b 11 Re x = x[1] 12 Im x = x[2] 13 Re y = y[1] 14 Im y = y[2] 15 compmul x y z 16 x y = z[1] + z[2] i ( ): function < >(>,, <>):< >; < > 5.2. program Lesson14; var a,b,d:integer; function gcd(a,b:integer):integer; var r: integer; if b>a then r:=a; a:=b; b:=r; repeat r:=a mod b; a:=b; b:=r; until b=0; gcd:=a; (* main *) write( = ); readln(a); write( = ); readln(b);
13 d:=gcd(a,b); a:=a div d; b:=b div d; write(a, /,b); 2 a, b, d 3 15 gcd = a 18 = b 19 a b d 20 a a d b b d 21 a / b A Pascal A.1 Pascal absolute end inline procedure type and external interface program unit array file interrupt record until for label repeat uses case forward mod set var const function nil shl while div goto not shr with do if of string xor downto implementation or then else in packed to A.2 Pascal i,j,n:x:a:c,ch:f: s,st:b:w:write write c, s c:n, s:n n i i 10 i:n n x x 10 x:n n x:n:j x j 10 n read(f, v,..., v) readln(f, v,..., v) write(f, w,..., w) writeln(f, w,..., w) a:=abs(a) a:=sqr(a) x:=sin(a) x:=cos(a) x:=exp(a) x:=ln(a) x:=sqrt(a) x:=arctan(a) i:=trunc(x) i:=round(x) b:=odd(i) randomize x:=random i:=random(n) 2 v true false n 12
14 c:=chr(i) i:=ord(c) s:=copy(st,i,n) s:=concat(s 1,..., s n ) i:=length(st) i:=pos(s,st) ch:=upcase(c) delete(st,i,n) insert(s,st,i) str(w,s) val(s,a,i) st i n s 1 s n st st s ( 0 ) c st i n s st i w s s a ( i 0 s i ) B 2/10( ) ( 7F) 1. (A4 5 ) (a) (b) (c), Pascal [ 2 ],,
1. 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
基礎情報処理 I (文字型)
プログラミング 1 ( 文字型 ) program character1; a,b,c: char; writeln('1 文字づつ3 文字入力してください :'); readln(a); readln(b); readln(c); write(a); write(b); write(c); writeln; a,b,c:char; a:='a'; b:='b'; c:='c'; write(a);
第10回 コーディングと統合(WWW用).PDF
10 January 8, 2004 algorithm algorithm algorithm (unit testing) (integrated testing) (acceptance testing) Big-Bang (incremental development) (goto goto DO 50 I=1,COUNT IF (ERROR1) GO TO 60 IF (ERROR2)
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009631 このサンプルページの内容は, 初版 1 刷発行時のものです. Excel URL http://www.morikita.co.jp/books/mid/009631 i Microsoft Windows
1 シミュレーションとは何か?
Delphi P.1/16 Delphi Delphi Object Pascal Delphi Delphi Delphi (Borland) Windows Turbo Pascal Pascal Delphi Turbo Pascal Windows Pascal FORTRAN BASIC Java Algol Algol Pascal Pascal Pascal Pascal Delphi
解きながら学ぶ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
L N P Y F C T V W Z I X Pentomino Form Name Caption Position FormMain podesktopcenter
1. 1 1 1.1 5 12 60 3 20 4 15 5 12 6 10 12 L N P Y F C T V W Z I X 1.1.1 1.2 Pentomino 1.2.1 Form Name Caption Position FormMain podesktopcenter 1.2.2 unit PentominoU; interface uses Windows, Messages,
コンピュータ概論
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
n 第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
1. 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)
untitled
Fortran90 ( ) 17 12 29 1 Fortran90 Fortran90 FORTRAN77 Fortran90 1 Fortran90 module 1.1 Windows Windows UNIX Cygwin (http://www.cygwin.com) C\: Install Cygwin f77 emacs latex ps2eps dvips Fortran90 Intel
) 9 81
4 4.0 2000 ) 9 81 10 4.1 natural numbers 1, 2, 3, 4, 4.2, 3, 2, 1, 0, 1, 2, 3, integral numbers integers 1, 2, 3,, 3, 2, 1 1 4.3 4.3.1 ( ) m, n m 0 n m 82 rational numbers m 1 ( ) 3 = 3 1 4.3.2 3 5 = 2
K227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
1.ppt
/* * Program name: hello.c */ #include int main() { printf( hello, world\n ); return 0; /* * Program name: Hello.java */ import java.io.*; class Hello { public static void main(string[] arg)
VDM-SL VDM VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web bool
VDM-SL VDM++ 23 6 28 VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web 2 1 3 1.1............................................... 3 1.1.1 bool......................................... 3 1.1.2 real rat int
プログラミングI (手続き)
プログラミング 1 ( 手続き ) const n = 3; TVector = array[1..n] of integer; // 3 次元ベクトルを表示するための手続き procedure print(a:tvector); write('('); for i := 1 to n-1 do write(a[i],','); write(a[n],')'); // プログラム本体 vec: TVector;
2005 D Pascal CASL ( ) Pascal C 3. A A Pascal TA TA TA
2005 D 1 1.1 1.2 Pascal CASL ( ) Pascal 1. 2005 10 13 2006 1 19 12 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA TA TA [email protected] [email protected] [email protected] [email protected]
2004.11.29 4 Communication1 program communication1(input, output); procedure double; r1, r2: real; r2 := 2 * r1; double; end. Communication1 program communication1(input, output); procedure double; r1,
超初心者用
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
N88 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
新版明解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,
2009 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA
2009 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2009 10 15 2010 1 29 16 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA [email protected] TA [email protected] [email protected]
05秋案内.indd
1 2 3 4 5 6 7 R01a U01a Q01a L01a M01b - M03b Y01a R02a U02a Q02a L02a M04b - M06b Y02a R03a U03a Q03a L03a M08a Y03a R04a U04a Q04a L04a M09a Y04a A01a L05b, L07b, R05a U05a Q05a M10a Y05b - Y07b L08b
2011 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA enshu-
2011 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2011 10 6 2011 2 9 15 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA [email protected] TA [email protected] [email protected]
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
( 9 1 ) 1 2 1.1................................... 2 1.2................................................. 3 1.3............................................... 4 1.4...........................................
num2.dvi
[email protected] http://kanenko.a.la9.jp/ 16 32...... h 0 h = ε () 0 ( ) 0 1 IEEE754 (ieee754.c Kerosoft Ltd.!) 1 2 : OS! : WindowsXP ( ) : X Window xcalc.. (,.) C double 10,??? 3 :, ( ) : BASIC,
11042 計算機言語7回目 サポートページ:
11042 7 :https://goo.gl/678wgm November 27, 2017 10/2 1(print, ) 10/16 2(2, ) 10/23 (3 ) 10/31( ),11/6 (4 ) 11/13,, 1 (5 6 ) 11/20,, 2 (5 6 ) 11/27 (7 12/4 (9 ) 12/11 1 (10 ) 12/18 2 (10 ) 12/25 3 (11
案内最終.indd
1 2 3 4 5 6 IC IC R22 IC IC http://www.gifu-u.ac.jp/view.rbz?cd=393 JR JR JR JR JR 7 / JR IC km IC km IC IC km 8 F HPhttp://www.made.gifu-u.ac.jp/~vlbi/index.html 9 Q01a N01a X01a K01a S01a T01a Q02a N02a
コンピュータ工学講義プリント (7 月 17 日 ) 今回の講義では フローチャートについて学ぶ フローチャートとはフローチャートは コンピュータプログラムの処理の流れを視覚的に表し 処理の全体像を把握しやすくするために書く図である 日本語では流れ図という 図 1 は ユーザーに 0 以上の整数 n
コンピュータ工学講義プリント (7 月 17 日 ) 今回の講義では フローチャートについて学ぶ フローチャートとはフローチャートは コンピュータプログラムの処理の流れを視覚的に表し 処理の全体像を把握しやすくするために書く図である 日本語では流れ図という 図 1 は ユーザーに 0 以上の整数 n を入力してもらい その後 1 から n までの全ての整数の合計 sum を計算し 最後にその sum
1. 2 P 2 (x, y) 2 x y (0, 0) R 2 = {(x, y) x, y R} x, y R P = (x, y) O = (0, 0) OP ( ) OP x x, y y ( ) x v = y ( ) x 2 1 v = P = (x, y) y ( x y ) 2 (x
. P (, (0, 0 R {(,, R}, R P (, O (0, 0 OP OP, v v P (, ( (, (, { R, R} v (, (, (,, z 3 w z R 3,, z R z n R n.,..., n R n n w, t w ( z z Ke Words:. A P 3 0 B P 0 a. A P b B P 3. A π/90 B a + b c π/ 3. +
Appendix 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/
1990 IMO 1990/1/15 1:00-4:00 1 N N N 1, N 1 N 2, N 2 N 3 N 3 2 x x + 52 = 3 x x , A, B, C 3,, A B, C 2,,,, 7, A, B, C
0 9 (1990 1999 ) 10 (2000 ) 1900 1994 1995 1999 2 SAT ACT 1 1990 IMO 1990/1/15 1:00-4:00 1 N 1990 9 N N 1, N 1 N 2, N 2 N 3 N 3 2 x 2 + 25x + 52 = 3 x 2 + 25x + 80 3 2, 3 0 4 A, B, C 3,, A B, C 2,,,, 7,
Fortran90/95 [9]! (1 ) " " 5 "Hello!"! 3. (line) Fortran Fortran 1 2 * (1 ) 132 ( ) * 2 ( Fortran ) Fortran ,6 (continuation line) 1
Fortran90/95 2.1 Fortran 2-1 Hello! 1 program example2_01! end program 2! first test program ( ) 3 implicit none! 4 5 write(*,*) "Hello!"! write Hello! 6 7 stop! 8 end program example2_01 1 program 1!
45 VBA Fortran, Pascal, C Windows OS Excel VBA Visual Basic Excel VBA VBA Visual Basic For Application Microsoft Office Office Excel VBA VBA Excel Acc
\n Title 文 系 学 生 のための VBA プログラミング 教 育 についての 考 察 Author(s) 五 月 女, 仁 子 ; Soutome, Hiroko Citation 商 経 論 叢, 46(1): 45-60 Date 2010-10-31 Type Departmental Bulletin Paper Rights publisher KANAGAWA University
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
<リスト1> AD コンバータへのデータの出力例 NEC PC98 用 mov al,22h // CLK -> 1, CS -> 0, DI -> 0 out 32h,al // シリアル ポートにデータ出力 PC/AT 互換機用 mov al,00h // CLK -> 1 mov dx,3fb
AD コンバータへのデータの出力例 NEC PC98 用 mov al,22h // CLK -> 1, CS -> 0, DI -> 0 out 32h,al // シリアル ポートにデータ出力 PC/AT 互換機用 mov al,00h // CLK -> 1 mov dx,3fbh out dx al // シリアル ポートにデータ出力 mov al,03h // CS -> 0,
syspro-0405.ppt
3 4, 5 1 UNIX csh 2.1 bash X Window 2 grep l POSIX * more POSIX 3 UNIX. 4 first.sh #!bin/sh #first.sh #This file looks through all the files in the current #directory for the string yamada, and then prints
04年度LS民法Ⅰ教材改訂版.PDF
?? A AB A B C AB A B A B A B A A B A 98 A B A B A B A B B A A B AB AB A B A BB A B A B A B A B A B A AB A B B A B AB A A C AB A C A A B A B B A B A B B A B A B B A B A B A B A B A B A B A B
My関数の作成演習問題集
Excel Sum,Average,Max 330 BMI Excel My Excel VBA Visual BASIC Editor AltF11 Visual BASIC Editor My Function Function -1- Function ( As Single, As Single) As Double Function Funciton Funciton As Single
1 # 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,
94 expression True False expression FalseMSDN IsNumber WorksheetFunctionIsNumberexpression expression True Office support.office.com/ja-jp/ S
Excel VBA a Excel VBA VBA IsNumeric IsNumber SpecialCells SpecialCells MSDNMicrosoft Developer NetworkIsNumeric IsNumber SpecialCells IsNumeric VBA IsNumericexpression SpecialCells 94 expression True False
cpp1.dvi
2017 c 1 C++ (1) C C++, C++, C 11, 12 13 (1) 14 (2) 11 1 n C++ //, [List 11] 1: #include // C 2: 3: int main(void) { 4: std::cout
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.......................
情報の構造とデータ処理
[email protected] 2014 SQL information system input process output (information) (symbols) (information structure) (data) 201411 ton/kg m/feet km 2 /m 2 (data structure) (integer) (real) (boolean)
e ::= c op(e 1,..., e n ) if e 1 then e 2 else e 3 let x = e 1 in e 2 x let rec x y 1... y n = e 1 in e 2 e e 1... e n (e 1,..., e n ) let (x 1,..., x
e ::= c op(e 1,..., e n ) if e 1 then e 2 else e 3 let x = e 1 in e 2 x let rec x y 1... y n = e 1 in e 2 e e 1... e n (e 1,..., e n ) let (x 1,..., x n ) = e 1 in e 2 Array.create e 1 e 2 e 1.(e 2 ) e
# let st1 = {name = "Taro Yamada"; id = };; val st1 : student = {name="taro Yamada"; id=123456} { 1 = 1 ;...; n = n } # let string_of_student {n
II 6 / : 2001 11 21 (OCaml ) 1 (field) name id type # type student = {name : string; id : int};; type student = { name : string; id : int; } student {} type = { 1 : 1 ;...; n : n } { 1 = 1 ;...; n = n
PowerPoint プレゼンテーション
ループ ループとは? ある条件を満たすまで 指定の命令を繰り返す Do... Loop For Next For Each Next While WEnd ループの種類 Do Loop Do While 条件 ステートメント Loop Do ステートメント Loop While 条件 Do Until 条件 ステートメント Loop Do ステートメント Until Loop 条件 Do Loop
Microsoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
JavaScript 1.! DOM Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2
JavaScript (2) 1 JavaScript 1.! 1. 2. 3. DOM 4. 2. 3. Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2 (1) var a; a = 8; a = 3 + 4; a = 8 3; a = 8 * 2; a = 8 / 2; a = 8 % 3; 1 a++; ++a; (++
B 5 (2) VBA R / B 5 ( ) / 34
B 5 (2) VBAR / B 5 (2014 11 17 ) / 34 VBA VBA (Visual Basic for Applications) Visual Basic VBAVisual Basic Visual BasicC B 5 (2014 11 17 ) 1 / 34 VBA 2 Excel.xlsm 01 Sub test() 02 Dim tmp As Double 03
漸化式のすべてのパターンを解説しましたー高校数学の達人・河見賢司のサイト
https://www.hmg-gen.com/tuusin.html https://www.hmg-gen.com/tuusin1.html 1 2 OK 3 4 {a n } (1) a 1 = 1, a n+1 a n = 2 (2) a 1 = 3, a n+1 a n = 2n a n a n+1 a n = ( ) a n+1 a n = ( ) a n+1 a n {a n } 1,
pptx
iphone 2010 8 18 C [email protected] C Hello, World! Hello World hello.c! printf( Hello, World!\n );! os> ls! hello.c! os> cc hello.c o hello! os> ls! hello!!hello.c! os>./hello! Hello, World!! os>! os>
Windows 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
netcdf
1. Anetcdf.rb netcdf C ruby open new create NetCDF C filename String NetCDF NetCDF_open mode r r, w share false true or false open open netcdf filename String NetCDF NetCDF_create noclobber false true
Parametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
10/ / /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
[email protected] [email protected] http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/sem3/ 2002 12 11 p.1/33 10/16 1. 10/23 2. 10/30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20
140 120 100 80 60 40 20 0 115 107 102 99 95 97 95 97 98 100 64 72 37 60 50 53 50 36 32 18 H18 H19 H20 H21 H22 H23 H24 H25 H26 H27 1 100 () 80 60 40 20 0 1 19 16 10 11 6 8 9 5 10 35 76 83 73 68 46 44 H11
ケミカルエンジニアのためのExcelを用いた化学工学計算法
VBA 7.1 f ()= ( f ( )) y = f ()(1) y = f ( )( ) + f ( ) (1) 1 1 1 = f ( ) f ( ) (2) 1 n = = y = f() y = () 1 n+1 = n (f( n )f( n )) 1.7 1 2 log()2 145 7.2 f ( ) 1-1 -1 f ( ) (3) (4) 34 5 1 1) ( ) ( ) '(
A(6, 13) B(1, 1) 65 y C 2 A(2, 1) B( 3, 2) C 66 x + 2y 1 = 0 2 A(1, 1) B(3, 0) P 67 3 A(3, 3) B(1, 2) C(4, 0) (1) ABC G (2) 3 A B C P 6
1 1 1.1 64 A6, 1) B1, 1) 65 C A, 1) B, ) C 66 + 1 = 0 A1, 1) B, 0) P 67 A, ) B1, ) C4, 0) 1) ABC G ) A B C P 64 A 1, 1) B, ) AB AB = 1) + 1) A 1, 1) 1 B, ) 1 65 66 65 C0, k) 66 1 p, p) 1 1 A B AB A 67
haskell.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]
01_OpenMP_osx.indd
OpenMP* / 1 1... 2 2... 3 3... 5 4... 7 5... 9 5.1... 9 5.2 OpenMP* API... 13 6... 17 7... 19 / 4 1 2 C/C++ OpenMP* 3 Fortran OpenMP* 4 PC 1 1 9.0 Linux* Windows* Xeon Itanium OS 1 2 2 WEB OS OS OS 1 OS
iii 1 1 1 1................................ 1 2.......................... 3 3.............................. 5 4................................ 7 5................................ 9 6............................
データ構造とアルゴリズム論
15 10 7 A[1]A[2] 5 5 A1A2 A5 9 A4 A1 A2 A3 A4 A5 9 A[4] [1] [2] [3] [4] [5] 5 A1A2 A5 A(1)A(5) A1 i 1 A2 A3 i5 Yes No A4 A[i] A5 i+1 13 15 10 7 100 100 Java Java 10 A int A[]; A= new int[10]; int A[] =
tuat1.dvi
( 1 ) http://ist.ksc.kwansei.ac.jp/ tutimura/ 2012 6 23 ( 1 ) 1 / 58 C ( 1 ) 2 / 58 2008 9 2002 2005 T E X ptetex3, ptexlive pt E X UTF-8 xdvi-jp 3 ( 1 ) 3 / 58 ( 1 ) 4 / 58 C,... ( 1 ) 5 / 58 6/23( )
Lesson 1 1 EXVBA2000 Lesson01 Lesson01.xls 2
Excel2000VBA L e a r n i n g S c h o o l 1 Lesson 1 1 EXVBA2000 Lesson01 Lesson01.xls 2 3 Module1:(General)- Public Sub () Dim WS As Object Dim DiffDate As Integer Dim MaxRows As Integer, CopyRows As Integer
(1) (2) (3) (4) (1) (a) (b) (c) (d) kg 9.8 N 5.0 kg 19.6 m/s kg m/s 8.0kg (2) 1 r=1.0m ABC QA =1
2/ 土 28 6 11 10:30 11:20 似通った科目名がありますので注意してください. 受験許可されていない科目を解答した場合は無効 整理番号と科目コードは受験許可証とよく照合し正確に記入 30 10 11 12 00011 00016 2 01101 02607 4 (1) (2) (3) (4) 02703 (1) (a) (b) (c) (d) 1 5.0 kg 9.8 N 5.0
