r2.dvi
|
|
- きみえ ふしはら
- 5 years ago
- Views:
Transcription
1 ( ( ( Ruby ( ( 2 Chris Pine,, 2,, Yugui, Ruby,, Ruby 1 ( Ruby ( 2 ( i i j ( ) /( (regular expression Ruby /.../ ( 1
2 if / / =~ =~ else e * c --- ( * * [c 1 c 2 c 3...] --- c 1, c 2, c 3... * [c 1 -c 2 ] --- c 1 c 2 * [^...] ( ) * e* --- e 0 * e? --- e 0 1 * e+ --- e 1 * e 1 e e 1 e 2 * ^e --- e * e$ --- e * (e) --- e (\+1 * \n --- * \r --- * \s --- ( ) * \d --- ( ) * \w --- ( ) [] /( \ \\ 3 \ ( \ aaa bbb \ ccc ddd ee\ e fg => aaa bbb ccc ddd eee fg 2
3 def readdata open( test2.txt ) do f f.each_line do s r.push(s.chop) def writedata(a) a.each do s puts(s) def contlines(a) ; l = "" a.each do s if s =~ /\\$/ then l += s.chop else l += s; r.push(l); l = "" if l!= "" then r.push(l) $data1 = readdata $data2 = contlines($data1) writedata($data2) contlines l \ l l r if l \ ( l ( a. # b. 2 c. a. \ \ d. a. b. ( e. a. 1 \ ( 2 s 2 s[1..-1] 3
4 f. a ( grain2012.txt # ,830, ,961, ,500, ,908, ( ( s =~ /^\s*\d+\s+([^\s]+)\s+([0-9,]+)$/ 3 "# this is a comment" " 1 Japan 123,456,789 " \s* \d+ \s+ [^\s]+ \s+ [0-9,]+ ( ) ( ) $1: "Japan" $2: "123,456,789" 1: 1 \s*\d+\s+[^\s]+\s+[0-9,]+ 3 Web 4
5 , 1 2 (/^ $/) 1 2 ( ;(...); $1 $2 def readdata open( grain2012.txt ) do f f.each_line do s r.push(s.chop) def pickdata(a) a.each do s if s =~ /^#/ then # do nothing elsif s =~ /^\s*\d+\s+([^\s]+)\s+([0-9,]+)/ then name = $1; quant = $2 r.push([quant.gsub(/,/, ).to_i, name]) else $stderr.puts("wrong format: #{s}") def showdata(a) a.each do d puts "#{d[0]} #{d[1]}" $data1 = readdata $data2 = pickdata($data1) showdata($data2) readdata ppickdata r # ( ( (\s ( 1 $1 1 $2 1 OK 2 name quant ( $1 2 r r 5
6 .gsub(/,/, (.to i wrong format: ( return showdata ( 2 1 ( 0 1 2, CSV ( def totaldata(a) sum = 0.0 a.each do d sum += d[0] return sum 7 \s+ \s 8 a. avgdata b. sddata Math.sqrt( 4 c. maxmindata(2 d. mediandata 5 e. 1 3 quantdata( sort.sort a ( 2 4 m σ i(x i m) 2 /n ( 6
7 a.sort! # b = a.sort #!, 2 $data2.sort! do x, y x[0] <=> y[0] x y 2 ( 2 ( x ( ) 0... x y ( ) x ( ) <=> 2 ( ( $data2.sort! do x, y y[0] <=> x[0] $data2.sort! do x, y x[1] <=> y[1] 6 ( ) (same for readdata, pickdata) def histdata(a, w, m) r = Array.new(m+1, 0) a.each do d n = d[0].to_i / w if n >= r.size then n = r.size-1 r[n] += 1 def showhist(h, w) h.each_index do i printf("%12d %4d\n", w*i, h[i]) $data1 = readdata $data2 = pickdata($data1) $hist1 = histdata($data2, , 20) showhist($hist1, ) readdata pickdata histdata w m ( m+1 0 7
8 w n ( n 1 showdata printf C ( %nd n 10 w m 11 ( / a. b. ( 100% c. b ( 1 ID,,,,,, 1 # #panel,shop,receipt,time,count,amount,itemname 15360,20,643,20,1,138, 22568,22,7093,11,1,98, 28192,22,5043,16,1,98,,, 8
9 def readdata open( ITEM1.csv ) do f f.each_line do s r.push(s.chop) def pickdata(x) x.each do s if s =~ /^#/ then # do nothing elsif s =~/^(\d+),(\d+),(\d+),(\d+),(\d+),(\d+),(.+)$/ then a,b,c,d,e,f,g = $1,$2,$3,$4,$5,$6,$7 r.push([a.to_i, b.to_i, c.to_i, d.to_i, e.to_i, f.to_i, g]) else $stderr.puts("wrong format: #{s}"); def show1(d) d.each do a printf("%3d %8d %s\n", a[4], a[5], a[6]); $data1 = readdata $data2 = pickdata($data1) show1($data2) readdata pickdata a. b. c. d. e ( 9
10 (hash 2 (key (value ( h = Hash.new(0) h[ a ] = 1 h = { a => 3, bx = 1} h[ bx ] = 1 h[ a ] = h[ bx ] + 2 key a bx value 3 1 2: Hash.new(0 2 ( Hash.new(00 0 ( 0 2 { =>, =>, } def readdata open( ITEM1.csv ) do f f.each_line do s r.push(s.chop) def pickdata(x) x.each do s if s =~ /^#/ then # do nothing elsif s =~/^(\d+),(\d+),(\d+),(\d+),(\d+),(\d+),(.+)$/ then a,b,c,d,e,f,g = $1,$2,$3,$4,$5,$6,$7 r.push([a.to_i, b.to_i, c.to_i, d.to_i, e.to_i, f.to_i, g]) else $stderr.puts("wrong format: #{s}"); def show2(d) total = Hash.new(0); max = 0; maxid = 0 d.each do a total[a[0]] += a[5] if total[a[0]] > max then max = total[a[0]]; maxid = a[0] printf("max = %d, panel = %d\n", total[maxid], maxid); $data1 = readdata $data2 = pickdata($data1) show2($data2) 10
11 total id ( 0 total id id 15 readdata pickdata a. b. c. ( :.size d. e. ID ( : ( 1 ) gssm.k-kiso ( 11
¥¤¥ó¥¿¡¼¥Í¥Ã¥È·×¬¤È¥Ç¡¼¥¿²òÀÏ Âè2²ó
2 212 4 13 1 (4/6) : ruby 2 / 35 ( ) : gnuplot 3 / 35 ( ) 4 / 35 (summary statistics) : (mean) (median) (mode) : (range) (variance) (standard deviation) 5 / 35 (mean): x = 1 n (median): { xr+1 m, m = 2r
More information離散数理工学 第 2回 数え上げの基礎:漸化式の立て方
2 okamotoy@uec.ac.jp 2015 10 20 2015 10 18 15:29 ( ) (2) 2015 10 20 1 / 45 ( ) 1 (10/6) ( ) (10/13) 2 (10/20) 3 ( ) (10/27) (11/3) 4 ( ) (11/10) 5 (11/17) 6 (11/24) 7 (12/1) 8 (12/8) ( ) (2) 2015 10 20
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 information¥¤¥ó¥¿¡¼¥Í¥Ã¥È·×¬¤È¥Ç¡¼¥¿²òÀÏ Âè2²ó
2 2015 4 20 1 (4/13) : ruby 2 / 49 2 ( ) : gnuplot 3 / 49 1 1 2014 6 IIJ / 4 / 49 1 ( ) / 5 / 49 ( ) 6 / 49 (summary statistics) : (mean) (median) (mode) : (range) (variance) (standard deviation) 7 / 49
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 information離散数理工学 第 2回 数え上げの基礎:漸化式の立て方
2 okamotoy@uec.ac.jp 2014 10 21 2014 10 29 10:48 ( ) (2) 2014 10 21 1 / 44 ( ) 1 (10/7) ( ) (10/14) 2 (10/21) 3 ( ) (10/28) 4 ( ) (11/4) 5 (11/11) 6 (11/18) 7 (11/25) ( ) (2) 2014 10 21 2 / 44 ( ) 8 (12/2)
More informationRuby Ruby ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( ) 44=>
Ruby Ruby 200779 ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( 2+3+4+5+6+7+8+9 ) 44 irb(main):002:0> irb irb(main):001:0> 1+2+3+4 => 10 irb(main):002:0>
More information取扱説明書 [F-06C]
23 24 25 26 2 1 27 3 e e 5 4 e e 6 28 7 1 2 3 e 4 5 29 6 8 7 30 1 2 3 e 4 5 31 1 1 ee e ee e aee b e 2 e eee ee 32 2 3 4 1 ee ee 33 1 2 3 4 34 5 7 8 e 6 35 9 11 10 1 2 3 e 4 36 1 b a c 37 3 e 1 e ee 2
More informationつくって学ぶプログラミング言語 RubyによるScheme処理系の実装
Ruby Scheme 2013-04-16 ( )! SICP *1 ;-) SchemeR SICP MIT * 1 Structure and Interpretaion of Computer Programs 2nd ed.: 2 i SchemeR Ruby Ruby Ruby Ruby & 3.0 Ruby ii https://github.com/ichusrlocalbin/scheme_in_ruby
More information1
0 1 2 OK NG 3 ID 4 CMS 5 CMS 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 [PDF 7KB] [ ] 22 23 (HP ( pt) ) () ( 24 25 ( ) 26 27 28 29 #() URL # # 30 [PDF 7KB] [ ] 31 32 33 34 35 HTML HTML 36 37 38 39 40
More information¥¢¥ë¥´¥ê¥º¥à¥¤¥ó¥È¥í¥À¥¯¥·¥ç¥ó ÎØ¹Ö #1
#1 id:motemen August 27, 2008 id:motemen 1-3 1-5 6-9 10-14 1 2 : n < a 1, a 2,..., a n > a 1 a 2 a n < a 1, a 2,..., a n > : Google: insertion sort site:youtube.com 1 : procedure Insertion-Sort(A) for
More informationr1.dvi
Ruby 2009.9.7 1 ( ) --- ( ( ) ( ) 1 --- ( ) 1 ( ) (?) IT 7K( )?? ( ) ( )? IT ( ) --- ( ) 1 ( ) --- ( ) (?) 2-3% Top-Level ICT Professional 5% ICT Professional 10% 100% 50% 20% Devl. Experiment Adv. ICT
More informationRuby 50 Ruby UTF print, \n [Ruby-1] print("hello, Ruby.\n") [Ruby-2] Hello, Ruby. [Ruby-3] print("hello, \"Ruby\".\n") 2 [Ruby-4] seisuu = 10 pr
Ruby 50 Ruby UTF-8 1 1 print, \n [Ruby-1] print("hello, Ruby.\n") [Ruby-2] Hello, Ruby. [Ruby-3] print("hello, \"Ruby\".\n") 2 [Ruby-4] seisuu = 10 print(seisuu, "\n") jissuu = 3.141592 print(jissuu, "\n")
More informationP02.ppt
int If 2 1 ,,, 3 a + b ab a - b ab a * b ab a / b ab a % b ab a + b 4 2 list0201.c /, % /*/ int vx, vy; puts(""); printf("vx"); scanf("%d", &vx); printf("vy"); scanf("%d", &vy); printf("vx + vy = %d\n",
More informationMicrosoft PowerPoint - ruby_instruction.ppt
Ruby 入門 流れ Ruby の文法 画面に出力 キーボードから入力 数値 文字列 変数 配列 ハッシュ 制御構造 ( 分岐 繰り返しなど ) if while case for each 関数 クラス Ruby とは プログラミング言語 インタプリタ言語 オブジェクト指向 国産 ウェブアプリケーションフレームワーク RubyOnRails で注目 弊社での Web アプリケーション開発に利用 画面に出力
More informationedaenumerate (1) (2) (3) (4) (5) (6) (7) (8) (9) 2. 3 edaenumerate edaenumerate 2 <..> \begin{enumerate}<3> (1) (2) (3) (4) (5) (6) (7) (8) (9)
emathey.sty v 0.00 tdb 2005/09/03 enumerate http://emath.s40.xrea.com/ 1 1 2 4 2.1... 4 2.2... 11 2.3 yokoenumerate... 12 3 * 13 1 1. 2 edaenumerate (1) (2) (3) (4) (5) (6) (7) (8) (9) 2. 3 edaenumerate
More information2004
2008 3 20 400 1 1,222 7 1 2 3 55.8 54.8 3 35.8 6 64.0 50.5 93.5 1 1,222 1 1,428 1 1,077 6 64.0 52.5 80.5 56.6 81.5 30.2 1 2 3 7 70.5 1 65.6 2 61.3 3 51.1 1 54.0 2 49.8 3 32.0 68.8 37.0 34.3 2008 3 2 93.5
More informationRuby演習テキスト1
Ruby言語 基礎演習 社会人技術者研修 2014年度 テキスト 社会人技術者研修 2014年度テキスト 2014.11 Ruby基礎演習 1 2014.11 2015.2.1 puts "Hello Ruby >ruby hello.rb ( リターン ) > ruby hello.rb Hello Ruby # はじめての ruby プログラム puts "Hello Ruby" > ruby
More information1 Ex Ex. 2 2
I 20 100 85 40 85 PDF Windows TA ruby TA6 2 8 1. 2. PDF 3. PDF 1 Ex. 1 2 2 Ex. 2 2 2 Ex. 3 seisu = Array.new(3, 0) seisu[0] = gets.chomp.to_i seisu[1] = gets.chomp.to_i seisu[2] = gets.chomp.to_i wa =
More information1 2 3 1 34060120 1,00040 2,000 1 5 10 50 2014B 305,000140 285 5 6 9 1,838 50 922 78 5025 50 10 1 2
0120-563-506 / 9001800 9001700 123113 0120-860-777 163-8626 6-13-1 Tel.03-6742-3111 http://www.himawari-life.co.jp 1 2 3 1 34060120 1,00040 2,000 1 5 10 50 2014B 305,000140 285 5 6 9 1,838 50 922 78 5025
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 information1-4 int a; std::cin >> a; std::cout << "a = " << a << std::endl; C++( 1-4 ) stdio.h iostream iostream.h C++ include.h 1-4 scanf() std::cin >>
1 C++ 1.1 C C++ C++ C C C++ 1.1.1 C printf() scanf() C++ C hello world printf() 1-1 #include printf( "hello world\n" ); C++ 1-2 std::cout
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 information15 Phoenix HTML 15.1 ModestGreeter RAVT web/router.ex web/router.ex : 12 scope "/", ModestGreeter do 13 pipe_through :browser get "/", TopCont
15 Phoenix HTML 15.1 ModestGreeter RAVT web/router.ex web/router.ex : 12 scope "/", ModestGreeter do 13 pipe_through :browser 14 15 + get "/", TopController, :index 16 get "/hello/:name", HelloController,
More information2
2 485 1300 1 6 17 18 3 18 18 3 17 () 6 1 2 3 4 1 18 11 27 10001200 705 2 18 12 27 10001230 705 3 19 2 5 10001140 302 5 () 6 280 2 7 ACCESS WEB 8 9 10 11 12 13 14 3 A B C D E 1 Data 13 12 Data 15 9 18 2
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 information110-H724型,110-H725型,110-H726型,110-H727型,110-H728型,110-H729型,110-H730型,110-H731型,110-H732型,110-H733型
e e q w e q w e q h w w q q w 12 q w w q 12 q w e r q w e r D D D D D ;;; 1 2 12 ; q w eee ee : : : : : b eeeee ee q w e r t y b ee 1 2 q w e D D q w e D ; D D D D D D D q w D er t q q t w e r e D
More informationA/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B
A/B (2010/10/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2010 10 8 A/B 1 2010 10 8 2 1 1 1.1 OHP.................................... 1 1.2.......................................
More informationohp1.dvi
2008 1 2008.10.10 1 ( 2 ) ( ) ( ) 1 2 1.5 3 2 ( ) 50:50 Ruby ( ) Ruby http://www.ruby-lang.org/ja/ Windows Windows 3 Web Web http://lecture.ecc.u-tokyo.ac.jp/~kuno/is08/ / ( / ) / @@@ ( 3 ) @@@ :!! ( )
More informationFUJITSU Security Solution 手のひら静脈認証PCログオンソフトウェア
FUJITSU Security Solution PC PalmSecure LOGONDIRECTOR PC PalmSecure LOGONDIRECTOR / ID ID ID/ PalmSecure LOGONDIRECTOR ID/ 1 / & 1 Windows PCWindowsID/PC PalmSecure LOGONDIRECTOR ID/ & 2 ID/Windows ID/
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 informationLW2244T”æ’à_HM†Q01
q w e q w e e e q h w w q D D q w e b r q w e r D å å å 2 12 \ [ ;;; ; D D b ; : : : : : eee eee b q w e r t y ee q w e D D D ; D D ; D D D D D D D D D D D q w q D er t w e e r t D D
More informationohp03.dvi
19 3 ( ) 2019.4.20 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void int main(int argc, char *argv[]) {... 2 (2) argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0
More informationEmacs Ruby..
command line editor 27014533 2018 3 1 5 1.1................................... 5 1.2................................... 5 2 6 2.1 Emacs...................................... 6 2.2 Ruby.......................................
More informationHEM-737(C)
This warranty is valid only in Japan. HEM-737 Tel. Tel. HEM-737 1615300-6C OPEN 1 2 3 4 5 6 OPEN ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 7 8 () 180 160 140 130 120 () 80 85 90 100 110 *International Society of
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 informationparser.y 3. node.rb 4. CD-ROM
1. 1 51 2. parser.y 3. node.rb 4. CD-ROM 1 10 2 i 0 i 10 " i i+1 3 for(i = 0; i
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取扱説明書 [F-12D]
12.7 ISSUE DATE: NAME: PHONE NUMBER: MAIL ADDRESS: F-12D e e e 1 e 2 1 2 3 4 5 6 7 8 9 10 11 a b c d a b c d 12 a b cd e a b c d e 13 14 15 a b c d 16 17 a b d a b e f g h i l m e n o p c j k c q r s t
More informationKyosuke MOROHASHI
Practical Meta Programming on Rails Application @2013-12-17 Ruby 1 in MOROHASHI Kyosuke (@moro) Kyosuke MOROHASHI Aga toolbox Ruby " " Ruby http://www.amazon.co.jp/exec/obidos/asin/4048687158/morodiary05-22/ref=noism
More information東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプロ
東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプログラム全体の見通しを悪くするため, コールバック地獄と呼ばれる. そこで JavaScript でコールバック地獄が起こる原因と既存の解決方法について調査した.
More informationI 1 1 ( *) ( *) ex1-1.rb ) 2 CGI
I 1 1 ( *) ( *) ex1-1.rb ) 2 CGI 1-1 http://klis.tsukuba.ac.jp/klib/subjects/progi/example2018/ 1-1 1-2 http://klis.tsukuba.ac.jp/klib/subjects/progi/example2018/ 1-2 I \( ) ( ) 1 3 Ruby 1 1? 1-3 ( ) I
More informationr03.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 ---
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 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 information1 1 1 1 7-7 - 0 % % 1 d w v 2 2 2 1 3 - - - - - - d 2 2 1 12 11 10 2 9 3 8 7 6 5 4 2 - - d - 2 - 2 1 2 2 % % % % % % % % % % % - d - - - - 2 % % 2 - - - - - - 3 3 3 e e e e e e e e e e e e e e 3 e e e
More informationuntitled
Summer 2008 1 7 12 14 16 16 16 SAS Academic News B-8 4 B-9 6 B-11 7 B-15 10 DATA _NULL_; dlm=","; char1="" char2="" char3="15" char4="a",,15,a results=catx(dlm, OF char1-char4); PUT results; DATA
More information¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~alse
I Exercise on Programming I http://bit.ly/oitprog1 12 of 14 ( RD S ) I 12 of 14 1 / 35 https://bit.ly/oitprog1 ( RD S ) I 12 of 14 2 / 35 game.rb ( RD S ) I 12 of 14 3 / 35 game.rb 11 ( ) 1 require "io/console"
More informationI J
I 065763J 8 7 7 31 jikken/ +----- accumulation_demupa.c +----- accumulation_rain.c +----- frequency_demupa.c +----- frequency_rain.c +----- go.sh +----- graph_maker.sh +----- mesure-ryudai/ 2007/4/1 2007/6/30
More information- 1 - - 0.5%5 10 10 5 10 1 5 1
- - - 1 - - 0.5%5 10 10 5 10 1 5 1 - 2 - - - - A B A A A B A B B A - 3 - - 100 100 100 - A) ( ) B) A) A B A B 110 A B 13 - 4 - A) 36 - - - 5 - - 1 - 6-1 - 7 - - 8 - Q.15 0% 10% 20% 30% 40% 50% 60% 70%
More information地域と文化資産
11 2005 1980 151 20 65 1 6 37 7 A D E F G H - 2 - 2005 8 6 10:00 10:30 2-432 A D 7 E 8 1-F 1-G - 3 - 2005 H 1970 2005 8 26-4 - A B D E F G H 3 7 8 1 5 6 1 10-5 - 2005 10 1 5 6 1 1 30 2 3 5 3 2 1 2005 8
More information1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 http://www.moj.go.jp/press/090130-1.html 55 56 57
More informationuntitled
30 callcc yhara ( ( ) (1) callcc (2) callcc (3) callcc callcc Continuation callcc (1) (2) (3) (1) (2) (3) (4) class Foo def f p 1 callcc{ cc return cc} p 2 class Bar def initialize @cc = Foo.new.f def
More informationWindows [ ] [ (R)..] cmd [OK] Z:\> mkdir progi [Enter] \ ) mkdir progi ) (command ) help [Enter] help ( help ) mkdir make directory Windows ) mkdir mk
Ruby I I 1 Windows 1 Meadow 1: Meadow I Meadow 2 2 Ruby 2.1 I Z progi 1 Windows [ ] [ (R)..] cmd [OK] Z:\> mkdir progi [Enter] \ ) mkdir progi ) (command ) help [Enter] help ( help ) mkdir make directory
More information27011559 2018 3 1 3 2 4 2.1........................ 4 2.2.................................. 5 2.3 pseudovasp................................... 7 3 8 3.1 EAM potential.................................
More informationuntitled
... 2... 3... 5... 5... 8... 13... 18 HTML... 19 HTML... 20 PDF... 20 PDF... 22... 25 1 2 3 WEB (HTML,PDF, ) 4 5 6 7 WV O JDBC Data SourceDataSource01(N) > CSV 8 mysql JDBC mysql jar 9 10 11 12 13 14 15
More informationBW BW
Induced Sorting BW 11T2042B 2015 3 23 1 1 1.1................................ 1 1.2................................... 1 2 BW 1 2.1..................................... 2 2.2 BW.................................
More informationclass Cpd MW = { 'C'=>12.011, 'H'=>1.00794, 'N'=>14.00674, 'O' => 15.9994, 'P' => 30.973762 } def initialize @comp = Hash.new attr_accessor :name, :definition, :formula # formula def composition @formula.scan(/([a-z]+)(\d+)/)
More informationuntitled
2010824 1 2 1031 5251020 101 3 0.04 % 2010.8.18 0.05 % 1 0.06 % 5 0.12 % 3 0.14 % 2010.8.16 5 0.42 % 2010.7.15 25 5 0.42 % 0.426% 2010.6.29 5 0.496 % 2010.8.12 4 0.85 % 2010.8.6 10 0.900 % 2010.8.18 2.340
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-1 - -2 - -3 - -4-2000 -5 - -6 - -7 - -8 - -9 - - 10 - -11-60 200 2,000 1980 24-12 - - 13 - - 14 - - 15 - - 16 - - 17 - 1998 '98 593'98.4. 604'99.3. 1998 '98.10.10 11 80 '98.11. 81'99.3. 49 '98.11. 50
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 informationdouble 2 std::cin, std::cout 1.2 C fopen() fclose() C++ std::fstream 1-3 #include <fstream> std::fstream fout; int a = 123; fout.open( "data.t
C++ 1 C C++ C++ C C C++ 1.1 C printf() scanf() C++ C 1-1 #include int a; scanf( "%d", &a ); printf( "a = %d\n", a ); C++ 1-2 int a; std::cin >> a; std::cout
More information10 (1) s 10.2 rails c Rails 7 > item = PlanItem.new => #<PlanItem id nil, name nil,...> > item.name = "" => "" > item.valid? => true valid? true false
10 (1) 16 7 PicoPlanner validations 10.1 PicoPlanner Web Web invalid values validations Rails validates validate 107 10 (1) s 10.2 rails c Rails 7 > item = PlanItem.new => #
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 informationMC-440 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 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 65 66 67
More informationA ,000 7,539 7,593
A+ 64 1 300 16 6,000 7,539 7,593 13 3,329 178 1,168 12% 11% 35 3 26 3 761.2 6 8,947 6,044 432 7,774 CONTENTS 01 02 04 07 11 20 38 6,677 6,706 6,044 5,519 5,489 2011 2012 2013 2014 2015 866 796 522
More information新版明解C言語入門編
175cm 60kg ( ) 175cm 175.3cm 175.869758 cm 175cm 60kg p.177 18-1 vx - vy vx vy List -1 List -1 int vx, vy; puts(""); printf(" vx "); scanf("%d", &vx); printf(" vy "); scanf("%d", &vy); printf("vx + vy
More informationY z x c n m, 0 3 4 5
Y z x c n m, 0 3 4 5 5 K K K 5 7 65 65 Y Y o o 56 65 7 s s s s s @ x v z c \ b z x c \ c e 0 d b f d 65 C C D E F B E k 7 k 778 23 k 850 778 0 C C F F C 5 F F ^ C B E B F F O O P 5 5 Z D D D D B F C F
More information¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~alse
I Exercise on Programming I http://bit.ly/oitprog1 13 of 14 ( RD S ) I 13 of 14 1 / 39 https://bit.ly/oitprog1 ( RD S ) I 13 of 14 2 / 39 game.rb ( RD S ) I 13 of 14 3 / 39 game.rb 12 ( ) 1 require "io/console"
More information<4D F736F F D2095BD90AC E937890B68A888F4B8AB E397C394EF82CC93AE8CFC82C98AD682B782E992B28DB895AA90CD2E646F6378>
29 5 IT 1,234 1,447 2,130 1,200 3,043 2 9,275 2,818 ICD-10 p.2 27 3 7,848 1,234 10 4,291 11.3% 10 33.3% 32.4%12.9% 32.2%26.9%18.5% 1,095 874 339 490 189 178 6,358 5,279 3,380 2,345 1,994 1,693 37.6 34.9
More information取扱説明書 [F-04J]
17.2 ISSUE DATE: NAME: PHONE NUMBER: MAIL ADDRESS: F-04J e e e 1 2 1 2 3 4 5 6 7 8 9 10 11 12 a b c d a b c d 13 a b cd e a b c d e 14 15 a b a b 16 a 17 b c d 18 f g c d h e i n o p q r s t u a b j k
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 httpd School of Information Science, Japan Advanced Institute of Science and Technology
I117 17 4 httpd School of Information Science, Japan Advanced Institute of Science and Technology httpd HTTP httpd log file access log access.log CERN httpd common format lighttpd common format 2 1000
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 information{:from => Java, :to => Ruby } Java Ruby KAKUTANI Shintaro; Eiwa System Management, Inc.; a strong Ruby proponent http://kakutani.com http://www.amazon.co.jp/o/asin/4873113202/kakutani-22 http://www.amazon.co.jp/o/asin/477413256x/kakutani-22
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 information