1 ( ) 1.1 (convert.sh) (18GHz 26GHz) C (convert.c, convert1.c) mesure-ryudai convert.sh #!/bin/sh # file1 file1= ls -1 $1 # file1 data for data in $fi
|
|
- ありあ おおふさ
- 6 years ago
- Views:
Transcription
1 I D : 4
2 1 ( ) 1.1 (convert.sh) (18GHz 26GHz) C (convert.c, convert1.c) mesure-ryudai convert.sh #!/bin/sh # file1 file1= ls -1 $1 # file1 data for data in $file1 do mkdir $data echo " $data " # file2 file2= ls -1 $1/$data echo "" echo " _csv.log " # grep date date= grep -v [a-z] $1/$data/ _csv.log echo "$date" > _csv.log # _cvs.log "convert"./convert _csv.log # $data mv _per10csv.log./$data/ echo " _csv.log " # grep date date= grep -v [a-z] $1/$data/ _csv.log echo "$date" > _csv.log # _cvs.log "convert1"./convert _csv.log # $data mv _per10csv.log./$data/ echo "" echo "" done 10 C (convert.c, convert1.c) convert.c 18GHz convert1.c 26GHz
3 convert.c int main(int argc, char *argv[]) char *p; char s[1000];/* */ int i = 1;/* */ int th,tm,ts,le,po,be1,be2;/* */ int x,y;/* */ int c = 1;/* */ int sle = 0, spo = 0, sbe = 0;/* */ if(date == NULL) return; if(feof(date)) sscanf(s, "%d:%d:%d,%d,%d,%d\n", &th, &tm, &ts, &le, &po, &be1); if(i == 1)/* */ datea = fopen(" _csv10.log","a"); fprintf(datea,"%d\n",(le+256)/2-121); x = ts % 10; spo = spo + po; c++; else if(i == 2)/* */ y = ts % 10; spo = spo + po; c++; else/* */
4 x = y; y = ts % 10; if(x > y) sle = sle / (c-1); spo = spo / (c-1); if(y == 1) ts = ts-1; if(y == 2) ts = ts-2; if(sle >= 0) datea = fopen(" _csv10.log","a"); fprintf(datea,"%d\n",sle/2-121); if(sle < 0) datea = fopen(" _csv10.log","a"); fprintf(datea,"%d\n",(sle+256)/2-121); sle = 0; spo = 0; c = 0; spo = spo + po; c++; else spo = spo + po; c++; i++; convert1.c int main(int argc, char *argv[]) char *p;
5 char s[1000];/* */ int i = 1;/* */ int th,tm,ts,le,po,be1,be2;/* */ int x,y;/* */ int c = 1;/* */ int sle = 0, spo = 0, sbe = 0;/* */ if(date == NULL) return; if(feof(date)) sscanf(s, "%d:%d:%d,%d,%d,%d,%d\n", &th, &tm, &ts, &le, &po, &be1, &be2); if(i == 1)/* */ datea = fopen(" _csv10.log","a"); fprintf(datea,"%d\n",le); x = ts % 10; spo = spo + po; c++; else if(i == 2)/* */ y = ts % 10; spo = spo + po; c++; else/* */ x = y; y = ts % 10; if(x > y) sle = sle / (c-1); spo = spo / (c-1); if(y == 1) ts = ts-1; if(y == 2) ts = ts-2; datea = fopen(" _csv10.log","a");
6 fprintf(datea,"%d\n",sle); sle = 0; spo = 0; c = 0; spo = spo + po; c++; else spo = spo + po; c++; i++; 1.2 convert.sh convert.c convert1.c ( convert, convert1) C 18GHz 26GHz be C fgets le 1803RXLEVEL sle 2 ( ) (18GHz,26GHz) 2.1 (h conv.sh) C (h.conv.c) mesure-ryukyu h conv.sh #!/bin/sh # file1 file1= ls -1 $1
7 echo "$file1" # file1 data1 for data1 in $file1 do echo " $data " # file2 file2= ls -1 $1/$data for data2 in $file2 do if [ $data2!= basename $data2 _rain.csv ] ; then echo "$1" echo "$data1" echo "$data2" echo "$1/$data1/$data2" # grep date date= grep -v [a-z] $1/$data1/$data2 echo "$date" > rainof$data1 # "h_conv"./h_conv "rainof$data1" done fi done h conv.c int main(int argc, char *argv[]) char *p; char s[1000];/* */ int i = 0;/* */ int ca,mo,da,th,tm,rs;/* */ int c = 1;/* */ int srs = 0;/* */ if(date == NULL) return;
8 if(feof(date)) sscanf(s, "%d/%d/%d %d:%d,%d\n",&ca,&mo,&da,&th,&tm,&rs); /* */ if(c == 1) /* */ c++; i--; else if(i < 59) srs = srs + rs; else if(i == 59) srs = srs + rs; datea = fopen("rain","a"); fprintf(datea,"%d/%02d/%02d %02d:%02d,%d\n",ca,mo,da,th+1,tm-59,srs); srs = 0; i = -1; i++; 2.2 h conv.sh h conv.c h conv rain C h conv.c sscanf 2.3 h conv.c rain rain C frequency r.c frequency r.c whie frequency r.c
9 int main(int argc, char *argv[]) char *p; char s[1000]; int b[1500]; int c[1500]; int a = 0; int i = 0; int g = 0; int ca,mo,da,th,tm,rs; int srs = 0; if(i == 1500) if(feof(date)) sscanf(s, "%d/%d/%d %d:%d,%d\n",&ca,&mo,&da,&th,&tm,&rs); if( i*5 <= rs && rs <= i*5+5 ) a++; g++; b[i]=i*5+10; c[i]=a; datea = fopen("r_fre_distribute","a"); fprintf(datea,"%d %d\n",i*5+10,a); printf("%d %d\n",i*5+10,a); i++; a=0; fclose(date); i=1500; if(i < 0) printf("%d %d\n",b[i],c[i]);
10 datea = fopen("r_fre_distribute_rev","a"); fprintf(datea,"%d %d\n",b[i],c[i]); i--; printf("%d\n",g); r fre distribute r fre distribute 2.4 frequency r.c r fre distribute rev r fre distribute rev C r accumulate.c frequency r.c int main(int argc, char *argv[])
11 char *p; char s[1000]; int i = 0; int y = 0; int xk = 0.0; double sr = 0.0; double ss = 0.0; double b = 0.0; if(i == 1500) if(feof(date)) sscanf(s, "%d %d\n",&y,&xk); printf("%d\n",xk); sr = (xk / )*100; ss = ss + sr; printf("%f\n",ss); datea = fopen("rrain","a"); fprintf(datea,"%f %d\n",ss,y); i++; r accu distribute
12 r accu distribute (18GHz,26GHz) (18GHz,26GHz) (m conv.sh) C (m conv.c, m conv1) m conv.sh #!/bin/sh # file file= ls -1 $1 # file1 data for data in $file do echo " $data " echo "" echo " _per10csv.log " date= cat $1/$data/ _per10csv.log echo "$date" > date18./m_conv date18
13 mv conv18 $1/$data echo " _per10csv.log " date= cat $1/$data/ _csv10.log echo "$date" > date26./m_conv1 date26 mv conv26 $1/$data echo "" echo "" done m conv.c int main(int argc, char *argv[]) char *p; char s[1000]; int i = 1; int th,tm,ts,le,po,be1,be2; int sle = 0, spo = 0, sbe = 0; int c = 1; int srs = 0; if(date == NULL) return; if(feof(date)) sscanf(s, "%d\n",&le); if(i < 6) else if(i == 6) datea = fopen("conv18","a"); fprintf(datea,"%d\n",sle/6);
14 sle = 0; i = 0; i++; m conv1.c int main(int argc, char *argv[]) char *p; char s[1000]; int i = 1; int th,tm,ts,le,po,be1,be2; int sle = 0, spo = 0, sbe = 0; int c = 1; int srs = 0; if(date == NULL) return; if(feof(date)) sscanf(s, "%d\n",&le); if(i < 6) else if(i == 6) datea = fopen("conv26","a"); fprintf(datea,"%d\n",sle/6); sle = 0; i = 0;
15 i++; 2.6 (18GHz,26GHz) (h conv1826.sh) C (h conv18.c, h conv26) h conv1826.sh #!/bin/sh # file file= ls -1 $1 # file data for data in $file do echo " $data " echo " _per10csv.log " date= cat $1/$data/conv18 echo "$date" > h_date18./h_conv18 h_date18 echo " _per10csv.log " date= cat $1/$data/conv26 echo "$date" > h_date26./h_conv26 h_date26 done echo "" echo "" h conv18.c int main(int argc, char *argv[]) char *p;
16 char s[1000]; int i = 0; int le; int sle = 0; int c = 1; int srs = 0; if(date == NULL) return; if(feof(date)) sscanf(s, "%d\n",&le); if(i < 59) else if(i == 59) datea = fopen("hour18","a"); fprintf(datea,"%d\n",sle/60); sle = 0; i = 0; i++; h conv26.c int main(int argc, char *argv[]) char *p; char s[1000]; int i = 0; int le; int sle = 0;
17 int c = 1; int srs = 0; if(date == NULL) return; if(feof(date)) sscanf(s, "%d\n",&le); if(i < 59) else if(i == 59) datea = fopen("hour26","a"); fprintf(datea,"%d\n",sle/60); sle = 0; i = 0; i++; 2.7 C (frequency 18.c, frequency 26.c) frequency 18.c int main(int argc, char *argv[]) char *p; char s[1000];
18 int b[1500]; int c[1500]; int a = 0; int i = 0; int g = 0; int le; int srs = 0; if(i == 70) if(feof(date)) sscanf(s, "%d\n",&le); if( -i*2-2 <= le && le <= -i*2 ) a++; g++; b[i]=i*2+2; c[i]=a; datea = fopen("e18_fre_distribute","a"); fprintf(datea,"%d %d\n",-i*2-2,a); printf("%d %d\n",-i*2-2,a); i++; a=0; fclose(date); i=1500; if(i < 0) printf("%d %d\n",b[i],c[i]); datea = fopen("e18_fre_distribute_rev","a"); fprintf(datea,"%d %d\n",b[i],c[i]); i--; printf("%d\n",g);
19 frequency 26.c int main(int argc, char *argv[]) char *p; char s[1000]; int b[1500]; int c[1500]; int a = 0; int i = 0; int g = 0; int le; int srs = 0; if(i == 70) if(feof(date)) sscanf(s, "%d\n",&le); if( -i*2-2 <= le && le <= -i*2 ) a++; g++; b[i]=i*2+2; c[i]=a; datea = fopen("e26_fre_distribute","a"); fprintf(datea,"%d %d\n",-i*2,a); printf("%d %d\n",-i*2,a);
20 i++; a=0; fclose(date); i=1500; if(i < 0) printf("%d %d\n",b[i],c[i]); datea = fopen("e26_fre_distribute_rev","a"); fprintf(datea,"%d %d\n",b[i],c[i]); i--; printf("%d\n",g); e18 fre distribute,e26 fre distribute e18 fre distribute
21 e26 fre distribute 2.8 e18 fre distribute, e26 fre distribute C (e18 accumulate.c, e26 accumulate e18 accumulate.c int main(int argc, char *argv[]) char *p; char s[1000]; int i = 0; int y = 0; int xk = 0.0; double sr = 0.0; double ss = 0.0; double b = 0.0;
22 if(i == 140) if(feof(date)) sscanf(s, "%d %d\n",&y,&xk); printf("%d\n",xk); sr = (xk / )*100; ss = ss + sr; printf("%f\n",ss); datea = fopen("e18_accu_distribute","a"); fprintf(datea,"%f %d\n",ss,y); i++; e26 accumulate.c int main(int argc, char *argv[]) char *p; char s[1000]; int i = 0; int y = 0; int xk = 0.0; double sr = 0.0; double ss = 0.0; double b = 0.0; if(i == 140) if(feof(date))
23 sscanf(s, "%d %d\n",&y,&xk); printf("%d\n",xk); sr = (xk / )*100; ss = ss + sr; printf("%f\n",ss); datea = fopen("e26_accu_distribute","a"); fprintf(datea,"%f %d\n",ss,y); i++; e18 accu distribute,e26 accu distribute e18 accu distribute
24 e26 accu distribute 3
I 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£Ã¥×¥í¥°¥é¥ß¥ó¥°(2018) - Âè11²ó – ½ÉÂꣲ¤Î²òÀ⡤±é½¬£² –
(2018) 11 2018 12 13 2 g v dv x dt = bv x, dv y dt = g bv y (1) b v 0 θ x(t) = v 0 cos θ ( 1 e bt) (2) b y(t) = 1 ( v 0 sin θ + g ) ( 1 e bt) g b b b t (3) 11 ( ) p14 2 1 y 4 t m y > 0 y < 0 t m1 h = 0001
More information£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裶²ó ¨¡ À©¸æ¹½Â¤¡§·«¤êÊÖ¤· ¨¡
(2018) 2018 5 24 ( ) while ( ) do while ( ); for ( ; ; ) while int i = 0; while (i < 100) { printf("i = %3d\n", i); i++; while int i = 0; i while (i < 100) { printf("i = %3d\n", i); i++; while int i =
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 information(18,26) 10/ GHz.xls [ (18GHz) ] GHz.xls [ (26GHz) ] +----all.sh [ 2 10 ] +----mesure-ryudai/ / _csv.log [
I 065762A 19.08.19 19.08.24 19.08.20 1 (18,26) 10/ +----18GHz.xls [ (18GHz) ] +----26GHz.xls [ (26GHz) ] +----all.sh [ 2 10 ] +----mesure-ryudai/ +----20070401/ +----192.168.100.9_csv.log [ (18GHz) ] +----192.168.100.11_csv.log
More informationunix15-script2_09.key
UNIX講習会 シェルスクリプト2 31/July/2015 情報管理解析室 西出 浩世 SGE ~/unix15/sge $ cd ~/unix15/sge $ ls script* script2.sh script3.sh script4.sh ~/unix15/sge/results sam 12 $ ls results/*.sam $ rm -r results $ cp -r /usr/local/data/unix15/sge/results.
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 information£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裱£²²ó ¡Ý½ÉÂꣲ¤Î²òÀ⡤±é½¬£²¡Ý
(2018) 2018 7 5 f(x) [ 1, 1] 3 3 1 3 f(x) dx c i f(x i ) 1 0 i=1 = 5 ) ( ) 3 ( 9 f + 8 5 9 f(0) + 5 3 9 f 5 1 1 + sin(x) θ ( 1 θ dx = tan 1 + sin x 2 π ) + 1 4 1 3 [a, b] f a, b double G3(double (*f)(),
More informationex14.dvi
1,, 0, b (b b 2 b ) n k n = n j b j, (0 n j b 1), n =(n k n k 1...n 1 n 0 ) b, n j j j +1, 0,...,b 1 (digit). b b, n b 1 ñ, ñ = k (b 1 n j )b j b N, n b n, n = b N n, n =ñ+1 b N, n m n + m (mod b N ),
More informationfile"a" file"b" fp = fopen("a", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose(fp); fp = fopen("b", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose
I117 9 2 School of Information Science, Japan Advanced Institute of Science and Technology file"a" file"b" fp = fopen("a", "r"); while(fgets(line, BUFSIZ, fp)) {... fclose(fp); fp = fopen("b", "r"); while(fgets(line,
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 informationMicrosoft PowerPoint - kougi9.ppt
C プログラミング演習 第 9 回ポインタとリンクドリストデータ構造 1 今まで説明してきた変数 #include "stdafx.h" #include int _tmain(int argc, _TCHAR* argv[]) { double x; double y; char buf[256]; int i; double start_x; double step_x; FILE*
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 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 informationSOWC04....
99 100 101 2004 284 265 260 257 235 225 222 211 207 205 200 197 192 190 183 183 183 183 180 176 171 169 166 165 156 152 149 143 141 141 138 138 136 126 126 125 123 123 122 118 110 109 108 107 107 105 100
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 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 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超初心者用
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 informationLAN
HUB 1090248 21 3 19 1 1 2 3 2.1...................................... 3 2.1.1................................ 4 2.1.2 LAN................................. 6 2.2................................... 8 3 12
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 informationMicrosoft PowerPoint - kougi11.ppt
C プログラミング演習 中間まとめ 2 1 ソフトウエア開発の流れ 機能設計 外部仕様 ( プログラムの入力と出力の取り決め ) 構成設計 詳細設計 論理試験 内部データ構造や関数呼び出し方法などに関する取り決めソースプログラムの記述正しい入力データから正しい結果が得られるかテスト関数単位からテストをおこなう 耐性試験 異常な入力データに対して, 異常を検出できるかテスト異常終了することはないかテスト
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 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 informationTaro-ファイル処理(公開版).jtd
ファイル処理 0. 目次 1. はじめに 2. ファイル内容の表示 3. ファイル内容の複写 3. 1 文字単位 3. 2 行単位 4. 書式付き入出力 5. 文字配列への入出力 6. 課題 6. 1 課題 1 ( ファイル圧縮 復元 ) - 1 - 1. はじめに ファイル処理プログラムの形は次のようになる #include main() { FILE *fp1,*fp2; ファイルポインタの宣言
More information-2 gnuplot( ) j ( ) gnuplot /shell/myscript 1
-2 gnuplot( ) j 2006 05 03 2006 05 12 2006 05 09 2 ( ) gnuplot /shell/myscript 1 1 shell script Level 1 myls #!/bin/sh # nowdir= pwd # if [ -f $1 -o -z $1 ] ; then echo "Enter pass" echo "ex) myls.sh./"
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 informationII 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C main main 1 NULL NULL for 2 (a) Yacc 2 (b) 2 3 y
II 3 yacc (2) 2005 : Yacc 0 ~nakai/ipp2 1 C 1 6 9 1 main main 1 NULL NULL 1 15 23 25 48 26 30 32 36 38 43 45 47 50 52 for 2 (a) 2 2 1 Yacc 2 (b) 2 3 yytext tmp2 ("") tmp2->next->word tmp2 yytext tmp2->next->word
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 information実際の株価データを用いたオプション料の計算
2002 2 20 1 1 3 2 3 2.1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.1.1 : : : : : : : : : : : : : : : : : : : : 5 2.1.2 : : : : : : : : : : : : : : : : : : : : 6 2.2 : : : : : : : : : :
More information第5回お試しアカウント付き並列プログラミング講習会
qstat -l ID (qstat -f) qscript ID BATCH REQUEST: 253443.batch1 Name: test.sh Owner: uid=32637, gid=30123 Priority: 63 State: 1(RUNNING) Created at: Tue Jun 30 05:36:24 2009 Started at: Tue Jun 30 05:36:27
More informationOriginal : Hello World! (0x0xbfab85e0) Copy : Hello World! (0x0x804a050) fgets mstrcpy malloc mstrcpy (main ) mstrcpy malloc free fgets stream 1 ( \n
2008 3 10 1 mstrcpy char *mstrcpy(const char *src); mstrcpy malloc (main free ) stdio.h fgets char *fgets(char *s, int size, FILE *stream); s size ( ) stream FILE ( man ) 40 ( ) %./a.out String : test
More informationProg1_6th
2012 年 5 月 24 日 ( 木 ) 実施 多分岐のプログラム 前回は多段階の 2 分岐を組み合わせて 3 種類以上の場合分けを実現したが, 式の値の評価によって, 一度に多種類の場合分けを行う多分岐の利用によって見通しのよいプログラムを作成できる場合がある ( 流れ図は右図 ) 式の評価 : 値 1 : 値 2 : 値 n : 該当値無し 処理 1 処理 2 処理 n 既定の処理 switch
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 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 information新・明解C言語 ポインタ完全攻略
2 1-1 1-1 /* 1-1 */ 1 int n = 100; int *p = &n; printf(" n %d\n", n); /* n int */ printf("*&n %d\n", *&n); /* *&n int */ printf(" p %p\n", p); /* p int * */ printf("&*p %p\n", &*p); /* &*p int * */ printf("sizeof(n)
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 informationDKA ( 1) 1 n i=1 α i c n 1 = 0 ( 1) 2 n i 1 <i 2 α i1 α i2 c n 2 = 0 ( 1) 3 n i 1 <i 2 <i 3 α i1 α i2 α i3 c n 3 = 0. ( 1) n 1 n i 1 <i 2 < <i
149 11 DKA IEEE754 11.1 DKA n p(x) = a n x n + a n 1 x n 1 + + a 0 (11.1) p(x) = 0 (11.2) p n (x) q n (x) = x n + c n 1 x n 1 + + c 1 x + c 0 q n (x) = 0 (11.3) c i = a i a n (i = 0, 1,..., n 1) (11.3)
More informationprogram7app.ppt
プログラム理論と言語第 7 回 ポインタと配列, 高階関数, まとめ 有村博紀 吉岡真治 公開スライド PDF( 情報知識ネットワーク研 HP/ 授業 ) http://www-ikn.ist.hokudai.ac.jp/~arim/pub/proriron/ 本スライドは,2015 北海道大学吉岡真治 プログラム理論と言語, に基づいて, 現著者の承諾のもとに, 改訂者 ( 有村 ) が加筆修正しています.
More information1.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)
More information1 CUI CUI CUI 1.1 cout cin 1.1.1 redirect.cpp #i n c l u d e <s t r i n g > 3 using namespace std ; 5 6 i n t main ( void ) 7 { 8 s t r i n g s ; 10 c
C/C++ 007 6 11 1 CUI 1.1....................................... 1................................ 3 1.3 argc argv................................. 5.1.............................................. 5...............................................
More informationsyspro-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
More information1 発病のとき
A A 1944 19 60 A 1 A 20 40 2 A 4 A A 23 6 A A 13 10 100 2 2 360 A 19 2 5 A A A A A TS TS A A A 194823 6 A A 23 A 361 A 3 2 4 2 16 9 A 7 18 A A 16 4 16 3 362 A A 6 A 6 4 A A 363 A 1 A A 1 A A 364 A 1 A
More informationDVIOUT
2009 年度情報科学 & 情報科学演習レポート 9 学生用 学籍番号 : 氏名 : 下記の注意事項を守り 次ページ以降の問いに答え レポートを完成させなさい 提出期限 : 2009 年 6 月 30 日 ( 火 ) 13:00 まで提出場所 : 理学部棟正面玄関内に設置のレポートボックス 注意事項 : (1) このページを印刷し 必要事項を記入の上 ( 学籍番号欄と氏名欄は 2 箇所あるので忘れずに記入すること
More informationA common.h include #include <stdio.h> #include <time.h> #define MAXN int A[MAXN], n; double start,end; void inputdata(
2 065762A 19 7 13 1 2 2.1 common.h include #include #include #define MAXN 1000000 int A[MAXN], n; double start,end; void inputdata(void) int i; // printf(" "); scanf("%d",&n); // printf("
More information: CR (0x0d) LF (0x0a) line separator CR Mac LF UNIX CR+LF MS-DOS WINDOWS Japan Advanced Institute of Science and Technology
I117 8 1 School of Information Science, Japan Advanced Institute of Science and Technology : CR (0x0d) LF (0x0a) line separator CR Mac LF UNIX CR+LF MS-DOS WINDOWS Japan Advanced Institute of Science and
More information& & a a * * ptr p int a ; int *a ; int a ; int a int *a
int a = 123; a 123 :100 a 123 int *ptr = & a; a ptr ptr a 100 a 123 200 *ptr 200 a & & a a * * ptr p --------------------------------------------------------------------------------------------- int a
More information1 ( ) 2 2.1 Level-1 2.1.1 ################# #myls # ################ #!/bin/sh # if [ $# -eq 0 ] ; then pw=. elif [ $# -eq 1 ] ; then pw $1 else echo
1 Shallscript gnuplot J04055: :5 6 ( ) :5 16 ( ) :5 13 ( ) 1 1 ( ) 2 2.1 Level-1 2.1.1 ################# #myls # ################ #!/bin/sh # if [ $# -eq 0 ] ; then pw=. elif [ $# -eq 1 ] ; then pw $1
More informationcomment.dvi
( ) (sample1.c) (sample1.c) 2 2 Nearest Neighbor 1 (2D-class1.dat) 2 (2D-class2.dat) (2D-test.dat) 3 Nearest Neighbor Nearest Neighbor ( 1) 2 1: NN 1 (sample1.c) /* -----------------------------------------------------------------
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 informationuntitled
20 7 1 22 7 1 1 2 3 7 8 9 10 11 13 14 15 17 18 19 21 22 - 1 - - 2 - - 3 - - 4 - 50 200 50 200-5 - 50 200 50 200 50 200 - 6 - - 7 - () - 8 - (XY) - 9 - 112-10 - - 11 - - 12 - - 13 - - 14 - - 15 - - 16 -
More informationuntitled
19 1 19 19 3 8 1 19 1 61 2 479 1965 64 1237 148 1272 58 183 X 1 X 2 12 2 15 A B 5 18 B 29 X 1 12 10 31 A 1 58 Y B 14 1 25 3 31 1 5 5 15 Y B 1 232 Y B 1 4235 14 11 8 5350 2409 X 1 15 10 10 B Y Y 2 X 1 X
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 informationuntitled
ET2008 CQ DSP Blackfin CPU Blackfin 2 E!Kit-BF533 \ \ 3 4 5 CPU 1 PinNo. E!Kit-BF533 BLANCA CQBB100B PinNo. E!Kit-BF533 BLANCA CQBB100B 1 GND GND GND 61 GND GND GND 2 CPU_SOUT CPU_SOUT TXD2 62 CPU_SIN
More information(K&R 2.9) ~, &,, >>, << 2. (K&R 5.7) 3. (K&R 5.9) 4. (K&R 5.10) (argc argv atoi(), atof() ) 5. (K&R 7.5) (K&R 7.6) - FILE, stdin, stdout, std
3 3 1. 1 (K&R.9) ~, &,, >>,
More informationエラー処理・分割コンパイル・コマンドライン引数
L10(2017-12-05 Tue) : Time-stamp: 2017-12-17 Sun 11:59 JST hig. recv/send http://hig3.net ( ) L10 (2017) 1 / 21 IP I swallow.math.ryukoku.ac.jp:13 = 133.83.83.6:13 = : IP ( = ) (well-known ports), :. :,.
More informationXACC講習会
www.xcalablemp.org 1 4, int array[max]; #pragma xmp nodes p(*) #pragma xmp template t(0:max-1) #pragma xmp distribute t(block) onto p #pragma xmp align array[i] with t(i) int array[max]; main(int argc,
More information/ SCHEDULE /06/07(Tue) / Basic of Programming /06/09(Thu) / Fundamental structures /06/14(Tue) / Memory Management /06/1
I117 II I117 PROGRAMMING PRACTICE II 2 MEMORY MANAGEMENT 2 Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara yasu@jaist.ac.jp / SCHEDULE 1. 2011/06/07(Tue) / Basic of Programming
More informationex12.dvi
1 0. C, char., char, 0,. C, ("),., char str[]="abc" ; str abc.,, str 4. str 3. char str[10]="abc" ;, str 10, str 3., char s[]="abc", t[10] ;, t = s. ASCII, 0x00 0x7F, char., "abc" 3, 1. 1 8 256, 2., 2
More informationAutoTuned-RB
ABCLib Working Notes No.10 AutoTuned-RB Version 1.00 AutoTuned-RB AutoTuned-RB RB_DGEMM RB_DGEMM ( TransA, TransB, M, N, K, a, A, lda, B, ldb, b, C, ldc ) L3BLAS DGEMM (C a Trans(A) Trans(B) b C) (1) TransA:
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 informationXcalableMP入門
XcalableMP 1 HPC-Phys@, 2018 8 22 XcalableMP XMP XMP Lattice QCD!2 XMP MPI MPI!3 XMP 1/2 PCXMP MPI Fortran CCoarray C++ MPIMPI XMP OpenMP http://xcalablemp.org!4 XMP 2/2 SPMD (Single Program Multiple Data)
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() () () 200,000 160,000 120,000 80,000 40,000 3.3 144,688 43,867 3.1 162,624 52,254 170,934 171,246 172,183 3 2.8 2.6 57,805 61,108 65,035 3.5 3 2.5 2 1.5 1 0.5 0 0 2 7 12 17 22 10.1 12.7 17 22.3 73.4
More information273? C
TSG Theoretical Science Group 273? C 2-1.................................. 2 -1. Windows Mac Mac UNIX CUI bash >_ Finder TSG No.273? 2 3 pwd ls cd ( ) change directory 3 TSG No.273? cd hoge cd hoge cd....../
More informationt 2 2 t 2 t F ( ) p- 2 2 F 2 G F ( ) 2 2 F 2 G F ( ) 2 2 2
1 2 2 0 1 2 2 2 2 2 2 2 2.1 2 2 F={f ij }, G {g ij } t f ij t g ij = 1 f ij < t g ij = 0 t p- p S 0 S p = S 0 /S t p 2 t 1 t 2 2 t 2 t 2 2 3 3 1 2 F ( ) p- 2 2 F 2 G 3 2 2 F ( ) 2 2 F 2 G 3 3 2 F ( ) 2
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 informationMicrosoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
More informationRX501NC_LTE Mobile Router取説.indb
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 2 3 4 5 6 7 8 19 20 21 22 1 1 23 1 24 25 1 1 26 A 1 B C 27 D 1 E F 28 1 29 1 A A 30 31 2 A B C D E F 32 G 2 H A B C D 33 E 2 F 34 A B C D 2 E 35 2 A B C D 36
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 informationMicrosoft PowerPoint - kougi2.ppt
C プログラミング演習 第 2 回 Microsoft Visual Studio.NET を使ってみよう 説明 例題 1. プログラム実行の体験 コンピュータを役に立つ道具として実感する 次ページのプログラムを使って, Microsoft Visual Studio.NETでの C++ ソースファイル編集, ビルド, テスト実行の一連の過程を体験する 例題 1 のプログラムの機能 計算の繰り返し
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第7章 有限要素法のプログラミング
April 3, 2019 1 / 34 7.1 ( ) 2 Poisson 2 / 34 7.2 femfp.c [1] main( ) input( ) assem( ) ecm( ) f( ) solve( ) gs { solve( ) output( ) 3 / 34 7.3 fopen() #include FILE *fopen(char *fname, char
More informationMicrosoft PowerPoint - kougi6.ppt
C プログラミング演習 第 6 回ファイル処理と配列 1 ファイル処理 2 ファイル読み込み ファイル プログラム ファイルの中身は変わらない 3 ファイル書き出し ファイル プログラム ファイルの中身が変わる ファイルは伸び縮みすることがある 4 例題 1. テキストファイル形式の ファイルからのデータ読み込み 次のような名簿ファイル ( テキストファイル形式 ) を読み込んで,1 列目の氏名と,3
More informationslide6.pptx
ソフトウェア工学入門 第 6 回コマンド作成 2 ファイルシステム 今後のスケジュール 5/28. コマンド作成 2 ( 本日 ) 6/4. ファイルシステム プロセス ハードウェア 6/11. 第 2 回個別試験 grep プログラム 1 次のプログラムを作成し grep.c という名前で保存しなさい #include #include #include
More information02: 変数と標準入出力
C プログラミング入門 基幹 7 ( 水 5) 1 12: コマンドライン引数 Linux にログインし 以下の講義ページを開いておくこと http://www-it.sci.waseda.ac.jp/teachers/w48369 2/CPR1/ 2017-07-05 まとめ : ポインタを使った処理 2 内容呼び出し元の変数を書き換える文字列を渡す 配列を渡すファイルポインタ複数の値を返す大きな領域を確保する
More information‚æ2›ñ C„¾„ê‡Ìš|
I 8 10 10 I ( 6 ) 10 10 1 / 23 1 C ( ) getchar(), gets(), scanf() ( ) putchar(), puts(), printf() 1 getchar(), putchar() 1 I ( 6 ) 10 10 2 / 23 1 (getchar 1 1) 1 #include 2 void main(void){ 3 int
More information44 6 MPI 4 : #LIB=-lmpich -lm 5 : LIB=-lmpi -lm 7 : mpi1: mpi1.c 8 : $(CC) -o mpi1 mpi1.c $(LIB) 9 : 10 : clean: 11 : -$(DEL) mpi1 make mpi1 1 % mpiru
43 6 MPI MPI(Message Passing Interface) MPI 1CPU/1 PC Cluster MPICH[5] 6.1 MPI MPI MPI 1 : #include 2 : #include 3 : #include 4 : 5 : #include "mpi.h" 7 : int main(int argc,
More informationslide5.pptx
ソフトウェア工学入門 第 5 回コマンド作成 1 head コマンド作成 1 早速ですが 次のプログラムを head.c という名前で作成してください #include #include static void do_head(file *f, long nlines); int main(int argc, char *argv[]) { if (argc!=
More information4 2018 5 1 1 1 1.1.............................. 1 1.1.1....................... 1 1.1.2.................... 1 1.2...................... 1 1.2.1........................... 1 1.2.2............................
More informationKrylov (b) x k+1 := x k + α k p k (c) r k+1 := r k α k Ap k ( := b Ax k+1 ) (d) β k := r k r k 2 2 (e) : r k 2 / r 0 2 < ε R (f) p k+1 :=
127 10 Krylov Krylov (Conjugate-Gradient (CG ), Krylov ) MPIBNCpack 10.1 CG (Conjugate-Gradient CG ) A R n n a 11 a 12 a 1n a 21 a 22 a 2n A T = =... a n1 a n2 a nn n a 11 a 21 a n1 a 12 a 22 a n2 = A...
More informationyacc.dvi
2017 c 8 Yacc Mini-C C/C++, yacc, Mini-C, run,, Mini-C 81 Yacc Yacc, 1, 2 ( ), while ::= "while" "(" ")" while yacc 1: st while : lex KW WHILE lex LPAREN expression lex RPAREN statement 2: 3: $$ = new
More information