cpp2.dvi
|
|
- いとは けいれい
- 5 years ago
- Views:
Transcription
1 2018 c 2 C++ (2) STL, C++ 21 string 22 STL string C, \0, (, ), (, ), /,,,, C++,,, string string,,,,,, <string> include,,, int, << >> >>,,,, getline(, string ), [List 21] 2: #include <string> 3: 4: int main(void) 5: { 6: std::string message = "Enter strings"; 7: std::cout << message << ": "; 8: std::string s; 9: std::cin >> s; 10: std::cout << "word 1 = " << s << std::endl; 2 1
2 11: std::cin >> s; 12: std::cout << "word 2 = " << s << std::endl; 13: getline(std::cin,s); 14: std::cout << "line = " << " " << s << " " << std::endl; 15: getline(std::cin,s); 16: std::cout << "line = " << " " << s << " " << std::endl; 17: return 0; 18: } Enter strings: This is a pen, word1 = This word2 = is line = a pen 1 That is a book, line = That is a book, + += s+=a s a == <, <=, >, >= [List 22] 2: #include <string> 3: 4: int main(void) 5: { 6: std::string a = "C"; 7: std::string b = " "; 8: std::string c = "programming"; 9: 10: std::string x = a + b + c; // x = "C programming" 11: std::string y = a + "++" + b + c; // y = "C++ programming" 12: std::string z = a; // z = "C" 13: z += b; // z = "C " 14: z += c; // z = "C programming" 15: 16: std::cout << "x = " << x << std::endl; 17: std::cout << "y = " << y << std::endl; 18: std::cout << "z = " << z << std::endl; 2 2
3 19: 20: if (x==y) std::cout << "x==y\n"; 21: else if (x<y) std::cout << "x<y\n"; // 22: else std::cout << "x>y\n"; 23: 24: if (x==z) std::cout << "x==z\n"; // 25: else if (x<z) std::cout << "x<z\n"; 26: else std::cout << "x>z\n"; 27: 28: return 0; 29: }, x = C programming y = C++ programming z = C programming x<y x==z,, string s, 1 slength() s ( ) 2 s[i] s i ( s[0]) s = "woman" s[3]= e, s "women" 3 ssubstr(i,k) s i k s = "fukada kyoko", ssubstr(4,6) "da kyo" 2 k, i s = "fukada kyoko", ssubstr(7) "kyoko" 4 sfind(t) s t, snpos ( ), s = "to be or not to be", sfind("be")==3, sfind("and")==snpos 5 sreplace(i,k,t) s i k, t t k, s t, s = "I live in Osaka", sreplace(2,7,"love") s "I love Osaka" s "often" "usually", sreplace(sfind("often"),5,"usually") (s "often" ) 6 sinsert(i,t) s i t 21, Entry Entry, string name, string phone, 1 ("079-xxx-xxxx" "xxx-xxxx" ) 2, [List 23] 2 3
4 [List 23] 2: #include <string> 3: 4: class Entry { 5: public: 6: std::string name; 7: std::string phone; 8: Entry(const std::string& nm="", const std::string& ph="") { 9: name = nm; 10: phone = ph; 11: } 12: }; 13: 14: std::ostream& operator<<(std::ostream& os, const Entry& e) { 15: os << ename << ": " << ephone; 16: return os; 17: } 18: 19: int main(void) 20: { 21: Entry e[10]; 22: 23: int n = 0; 24: e[n++] = Entry("Kwansei Gakuin University (PR)", " "); 25: e[n++] = Entry("Kwansei Gakuin University (KSC)", " "); 26: e[n++] = Entry("Kobe University", " "); 27: e[n++] = Entry("Sanda Woodytown SATY", " "); 28: e[n++] = Entry("Sanda Hotel", " "); 29: 30: for (int i=0; i<n; i++) { 31: // : // "079-xxx-xxxx" "xxx-xxxx" 33: // : } 35: 36: std::cout << std::endl; 37: std::cout << " : "; 38: std::string s; 39: std::cin >> s; 40: // : // name s 42: // : 44: return 0; 45: } 2 4
5 std::, using namespace std;, 22 STL STL Standard Template Library, C++,,, (container; ),,, int, string,,, STL,,,, 221 vector vector <vector> include T vector, vector<t>, 10, int a[10], vector, vector<int> a(10);, i a[i], size() ( ) [List 24] 2: #include <vector> 3: 4: int main(void) { 5: std::vector<int> a(5); 6: std::cout << "asize = " << asize() << std::endl; 7: // asize = 5 8: for (int i=0; i<asize(); i++) a[i] = i; 9: for (int i=0; i<asize(); i++) std::cout << a[i] << " "; 10: std::cout << std::endl; 11: // : 2 5
6 13: std::vector<int> b(3); 14: b[0] = 7; b[1] = 5; b[2] = 3; 15: 16: std::vector<int> c(10); 17: for (int i=0; i<csize(); i++) c[i] = i*i; 18: 19: a = b; 20: std::cout << "asize = " << asize() << std::endl; 21: // asize = 3 22: for (int i=0; i<asize(); i++) std::cout << a[i] << " "; 23: std::cout << std::endl; 24: // : 26: a = c; 27: std::cout << "asize = " << asize() << std::endl; 28: // asize = 10 29: for (int i=0; i<asize(); i++) std::cout << a[i] << " "; 30: std::cout << std::endl; 31: // : 33: aresize(30); 34: // asize = 30 35: std::cout << "asize = " << asize() << std::endl; 36: for (int i=0; i<asize(); i++) std::cout << a[i] << " "; 37: std::cout << std::endl; 38: // : 40: return 0; 41: } 5: <> (template) vector<int> int, vector 1 stack,, stack, ( ) 19: vector, ( ) 26: vector,,, 1), 2), 3),, vector,,, reserve(int s), s, capacity() a[i] i, 2 6
7 ,, resize(int newsize) vector, vector<t>, T, ( ) 1 void push back(t d) d 2 T& back() 3 void pop back() [List 25] 2: #include <vector> 3: 4: main(void) { 5: 6: std::vector<int> s; 7: spush back(5); 8: spush back(7); 9: spush back(9); 10: spush back(11); // s = ( ) 11: 12: std::cout << "size = " << ssize() << std::endl; // size = 4 13: for (int i=0; i<ssize(); i++) { 14: std::cout << s[i] << " "; 15: } 16: std::cout << std::endl; 17: 18: std::cout << sback() << std::endl; // 11 19: spop back(); // s = (5 7 9) 20: std::cout << sback() << std::endl; // 9 21: spop back(); // s = (5 7) 22: 23: std::cout << "size = " << ssize() << std::endl; // size = 2 24: for (int i=0; i<ssize(); i++) { 25: std::cout << s[i] << " "; 26: } 27: std::cout << std::endl; 28: 29: return 0; 30: } push back(t) 1,,, g++ vector vector push back(t), 2 (push back() capacity() ) 2 7
8 vector, vector vector, vector<vector<int> > 2 >, (>>) [List 23], vector<entry> push back 222 deque deque vector <deque> T deque std::deque<t>, deque,std::deque<int> d; 1 push front(t d) T d, a[0], a[0], a[1], a[2], a[1], a[2], a[3], 2 T& front() ( vector<t> ) 3 pop front() push back() pop front(), (queue) push front(t) pop front() vector<t>, n O(n) ( ), std::deque<t> O(1) ( ), (a[i]) vector<t> ( ) 223 list list [] 1 <list> include 2 T std::list<t> list,std::list<int> a; iterator ( ), std::list<t> iterator, std::list<t>::iterator, std::list<t> iterator, std::list<int>::iterator p; 2 8
9 , [List 26] 2: #include <list> 3: 4: int main(void) 5: { 6: std::list<int> li; 7: 8: lipush back(3); // li = (3) 9: lipush back(7); // li = (3 7) 10: lipush front(2); // li = (2 3 7) 11: lipush front(5); // li = ( ) 12: 13: // 14: std::list<int>::iterator p; 15: for (p=libegin(); p!=liend(); p++) { 16: std::cout << *p << " "; 17: } 18: std::cout << std::endl; // : 20: // 21: std::list<int>::reverse iterator r; 22: for (r=lirbegin(); r!=lirend(); r++) { 23: std::cout << *r << " "; 24: } 25: std::cout << std::endl; // : 27: return 0; 28: } x T, p, q, r std::list<t> iterator 1 push back(x), push front(x) vector deque 2 insert(p,x) p x 1 pop back(x), pop front(x) vector deque 2 erase(p) p 3 erase(p,q) p q 4 clear() 1 front() 2 back() 3 begin() iterator 4 end() iterator () 2 9
10 5 rbegin() reverse iterator ( iterator) 6 rend() reverse iterator begin() end() front() back() rend() rbegin() iterator p iterator 1 *p p, m (*p)m p->m 2 p++ p 3 p-- p 4 std::list<t> li, p iterator, for (p=libegin(); p!=liend(); p++) { *p = } reverse iterator reverse terator iterator iterator r reverse terator 1 *r r 2 r++ r ( ) 3 r-- r ( ) 4 std::list<t> li, for (r=lirbegin(); r!=lirend(); r++) { *r = } r-- 23, Record, [ (id), (name), (score)], (operator<<), Seiseki data Record Seiseki operator<< 3 insert, lookup, erase worst, 1 insert(int id, const std::string& nm, int s): [ id, nm, s] 2 lookup(int id): id, std::cout ( not found ) 3 erase worst(): Record,, insert, lookup, 1,,, iterator p p++, p, p++, iterator (vector), 2 10
11 37 p, iterator const iterator,, const,, iterator const iterator [List 27] [List 27] 2: #include <string> 3: #include <list> 4: 5: // 1 6: class Record { 7: public: 8: int id; // 9: std::string name; // 10: int score; // 11: Record() {} 12: Record(int i, const std::string& nm, int s) { 13: id = i; 14: name = nm; 15: score = s; 16: } 17: }; 18: 19: std::ostream& operator<<(std::ostream& os, const Record& r) 20: { 21: os << "[" << rid << "] " << rname << " : " << rscore; 22: return os; 23: } 24: 25: // ( ) 26: class Seiseki { 27: public: 28: std::list<record> data; 29: void insert(int, const std::string&, int); 30: void lookup(int) const; 31: void erase worst(); 32: }; 33: 34: std::ostream& operator<<(std::ostream& os, const Seiseki& s) 35: { 36: os << "*** ***\n"; 37: for (std::list<record>::const iterator p = sdatabegin(); 38: p!= sdataend(); p++) { 39: os << *p << "\n"; 40: } 41: return os; 42: } 2 11
12 43: 44: void Seiseki::insert(int id, const std::string& nm, int s) 45: { 46: // : // 48: // : } 50: 51: void Seiseki::lookup(int id) const 52: { 53: // : // 55: // : } 57: 58: void Seiseki::erase worst() 59: { 60: // : // 62: // : } 64: 65: int main(void) 66: { 67: Seiseki s; 68: 69: // 70: sinsert(7001,"aaaa",89); 71: sinsert(7123,"bbbb",70); 72: sinsert(7013,"cccc",55); 73: sinsert(7200,"dddd",99); 74: sinsert(7087,"eeee",83); 75: 76: // 77: std::cout << s; 78: 79: // id (0 ) 80: int id; 81: std::cout << "> "; 82: std::cin >> id; 83: while (id!=0) { 84: slookup(id); 85: std::cout << "> "; 86: std::cin >> id; 87: } 88: 89: // 90: serase worst(); 91: 2 12
13 92: // 93: std::cout << s; 94: 95: return 0; 96: } 224 map map ( ),,, ( ), a[0], a[1],, a["ishiura"], a["akina"],, (red-black tree), n O(logn), 1 <map> include 2 ( ) K, T map std::map<k,t> string int map, std::map<std::string,int> 3 map m, k, m[k] string [List 28] 2: #include <map> 3: #include <string> 4: 5: int main(void) 6: { 7: std::map<std::string,int> semester; 8: semester["logic circuits"] = 1; 9: semester["compiler"] = 5; 10: semester["formal language and automata"] = 3; 11: 12: std::cout << semester["logic circuits"] << "\n"; 13: std::cout << semester["compiler"] << "\n"; 14: std::cout << semester["network"] << "\n"; 15: 16: return 0; 17: }
14 map list, map iterator, begin(), end(),, map, (pair), iterator first, second [List 29] 1: std::map<std::string,int>::iterator p; 2: for (p=semesterbegin(); p!=semesterend(); p++) { 3: std::cout << p->first << ": " << p->second << std::endl; 4: }, [List 28] [List 29] stringmap, "network", [],, find(k) ( K ) find(k key) key map, iterator, end() p iterator, erase(p) p semester, [List 210] 1: std::string s; 2: std::cout << ">"; 3: std::cin >> s; 4: if ((p=semesterfind(s))==semesterend()) { 5: std::cout << s << " not found" << std::endl; 6: } 7: else { 8: std::cout << "deleting " << p->first << std::endl; 9: semestererase(p); 10: } [List 23] map map<std::string,std::string>, 23 STL,,,,,,, 2 14
15 STL,,, STL, C++, 231 STL iterator vector v,, i for (i=0; i<vsize(); i++){v[i] = }, list iterator, p v iterator,, for (p=vbegin(); p!=vend(); p++){*p = } iterator STL (,, iterator ( ) ) vector deque list map begin, end O(1) O(1) O(1) O(1) rbegin, rend O(1) O(1) O(1) O(1) front, back O(1) O(1) O(1) push back, pop back O(1) O(1) O(1) push front, pop front O(1) O(1) [] O(1) O(1) O(log n) insert O(n) O(n) O(1) O(log n) erase O(n) O(n) O(1) O(log n) size O(1) O(1) O(1) O(1) ==,!=, < O(n) O(n) O(n) O(n) 232 find find (, map, find ) p1, p2 iterator, d, find(p1,p2,d), p1 p2 d, iterator,, p2 2 15
16 [List 211] 2: #include <list> 3: #include <algorithm> 4: 5: typedef std::list<int> int list; 6: typedef int list::iterator int list iter; 7: 8: int main(void) 9: { 10: // li = ( ) 11: int list li; 12: lipush back(3); 13: lipush back(5); 14: lipush back(2); 15: lipush back(3); 16: lipush back(2); 17: lipush back(3); 18: 19: std::cout << ">"; 20: int i; 21: std::cin >> i; 22: 23: // i 24: int list iter p = find(libegin(), liend(), i); 25: if (p==liend()) { 26: // 27: std::cout << "not found\n"; 28: } 29: else { 30: // 31: std::cout << *p << " found\n"; 32: 33: // 34: p = find(++p, liend(), i); 35: if (p==liend()) { 36: std::cout << "not found\n"; 37: } 38: else { 39: std::cout << *p << " found again\n"; 40: } 41: } 42: 43: return 0; 44: } 25 [List 211], list vector 2 16
17 [List 211] 233 sort sort [] ( vector, deque) list,, sort p1, p2 iterator,, sort(p1,p2), p1 p2 sort quick sort, 1 O(nlogn), O(n 2 ) 2 stable sort stable sort O(nlognlogn), O(nlogn) [List 212] 2: #include <vector> 3: #include <algorithm> 4: 5: int main(void) 6: { 7: // a = ( ) 8: std::vector<int> a; 9: apush back(12); 10: apush back(25); 11: apush back(1); 12: apush back(9); 13: apush back(30); 14: apush back(4); 15: 16: // 17: sort(abegin(), aend()); 18: 19: // 20: for (int i=0; i<asize(); i++) { 21: std::cout << a[i] << " "; 22: } 23: std::cout << std::endl; 24: 25: return 0; 26: } sort 2 17
18 ,, 3 [List 212], sort(abegin(), aend(), std::greater<int>()); sort 3 22 Phonebook, [List 213] 1: class by name { // 2: public: 3: bool operator()(const Entry& e1, const Entry& e2) const { 4: return e1name < e2name; 5: } 6: }; 7: 8: class by phone { // 9: public: 10: bool operator()(const Entry& e1, const Entry& e2) const { 11: return e1phone < e2phone; 12: } 13: }; 14: 15: 16: int main(void) 17: { 18: sort(ebegin(),eend(), by name()); // 19: sort(ebegin(),eend(), by phone()); // 20: } vector Phonebook, STL,, STL, 2 18
19 : auto C++11, auto, std::vector<int> a; apush back(3); apush back(5); apush back(7); for (std::vector<int>::iterator p=abegin(); p!=aend(); p++) { } std::cout << *p << std::endl; for (auto p=abegin(); p!=aend(); p++) { } std::cout << *p << std::endl;, a for (auto&& e : a) { } std::cout << e << std::endl; for (const auto& e : a) { } std::cout << e << std::endl;, auto, auto&, const auto&, auto&& g++ C++11 C++14, -std (g++ ) g++ -std=c++11 autocpp g++ -std=c++14 autocpp Nagisa ISHIURA 2 19
(STL) STL 1 (deta structure) (algorithm) (deta structure) 2 STL STL (Standard Template Library) 2.1 STL STL ( ) vector<int> x; for(int i = 0; i < 10;
(STL) STL 1 (deta structure) (algorithm) (deta structure) 2 STL STL (Standard Template Library) 2.1 STL STL ( ) vector x; for(int i = 0; i < 10; ++i) x.push_back(i); vector STL x.push_back(i) STL
More informationcpp1.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
More informationcpp4.dvi
2017 c 4 C++ (4) C++, 41, 42, 1, 43,, 44 45, 41 (inheritance),, C++,, 100, 50, PCMCIA,,,,,,,,, 42 1 421 ( ), car 1 [List 41] 1: class car { 2: private: 3: std::string m model; // 4: std::string m maker;
More information1.3 ( ) ( ) C
1 1.1 (Data Base) (Container) C++ Java 1.2 1 1.3 ( ) ( ) 1. 2. 3. C++ 2 2.1 2.2 2.3 2 C Fortran C++ Java 3 3.1 (Vector) 1. 2. ( ) 3.2 3 3.3 C++ C++ STL C++ (Template) vector vector< > ; int arrayint vector
More informationexec.dvi
2018 c 6, Mini-C C++ 6211 611, 61, print,,, (run ),,, (int ), 7, x, x "a" 3 "b" 4 "x" 10 (, ), x STL map 1 + 2, 1 2,, x = ;, 1, 2 x { 1 ; 2 ; ; m, if ( ) { 1 else { 2, 1,, 2 0, 1, 3 0, 2,,, main 6 1 ,,
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 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 informationCondition DAQ condition condition 2 3 XML key value
Condition DAQ condition 2009 6 10 2009 7 2 2009 7 3 2010 8 3 1 2 2 condition 2 3 XML key value 3 4 4 4.1............................. 5 4.2...................... 5 5 6 6 Makefile 7 7 9 7.1 Condition.h.............................
More informationvoid hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=
II 14 2018 7 26 : : proen@mm.ics.saitama-u.ac.jp 14,, 8 2 12:00 1 O(1) n O(n) O(log n) O(1) 32 : 1G int 4 250 M 2.5 int 21 2 0 100 0 100 #include #define HASHSIZE 100 /* */ #define NOTFOUND 0
More information2017_08_ICN研究会_印刷用
class Producer : noncopyable public: run() m_face.setinterestfilter("/example/testapp", bind(&producer::oninterest, this, _1, _2), RegisterPrefixSuccessCallback(), bind(&producer::onregisterfailed, this,
More information6-1
6-1 (data type) 6-2 6-3 ML, Haskell, Scala Lisp, Prolog (setq x 123) (+ x 456) (setq x "abc") (+ x 456) ; 6-4 ( ) subtype INDEX is INTEGER range -10..10; type DAY is (MON, TUE, WED, THU, FRI, SAT, SUN);
More information- - http://168iroha.net 018 10 14 i 1 1 1.1.................................................... 1 1.................................................... 7.1................................................
More informationQt (Generic Containers) Java STL <QtAlgorithms> STL (Generic Algorithms) QList<T>, QLinkedList<T>, QVector<T>, QStack<T>, QQueue<T> QMap<Key,
1 5 5.1 Qt (Generic Containers) Java STL STL (Generic Algorithms) QList, QLinkedList, QVector, QStack, QQueue QMap, QMultiMap. QHash, QMultiHash
More informationprogrammingII2019-v01
II 2019 2Q A 6/11 6/18 6/25 7/2 7/9 7/16 7/23 B 6/12 6/19 6/24 7/3 7/10 7/17 7/24 x = 0 dv(t) dt = g Z t2 t 1 dv(t) dt dt = Z t2 t 1 gdt g v(t 2 ) = v(t 1 ) + g(t 2 t 1 ) v v(t) x g(t 2 t 1 ) t 1 t 2
More information,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
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 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 informationdesign_pattern.key
#include void init(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] = i; void mul10(int* ary, int size) for (int i = 0; i < size; ++i) ary[i] *= 10; void dispary(int* ary, int size)
More informationprogram.dvi
2001.06.19 1 programming semi ver.1.0 2001.06.19 1 GA SA 2 A 2.1 valuename = value value name = valuename # ; Fig. 1 #-----GA parameter popsize = 200 mutation rate = 0.01 crossover rate = 1.0 generation
More 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解きながら学ぶ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 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 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 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 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橡ボーダーライン.PDF
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 To be or not to be 32 33 34 35 36 37 38 ( ) 39 40 41 42 43 44 45 46 47 48 ( ) 49 50 51 52
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 information@okuraofvegetabl
@okuraofvegetabl 3 I 5 1?................................. 5 2........................... 6 3,.................................. 6 4................................. 11 II 15 1 Bellman-Ford( )....................
More information1 C STL(1) C C C libc C C C++ STL(Standard Template Library ) libc libc C++ C STL libc STL iostream Algorithm libc STL string vector l
C/C++ 2007 6 18 1 C STL(1) 2 1.1............................................... 2 1.2 stdio................................................ 3 1.3.......................................... 10 2 11 2.1 sizeof......................................
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 informationParametric 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
More information新版 明解C++入門編
第 1 章画面 出力 入力 C++ C++ C++ C++ C++ C++ C++ C++ #include using C++ C++ C++ main C++ C++ C++ int double char C++ C++ C++ string C++ C++ C++ 21 1-1 C++ 歴史 C++ C++ 歴史 CC with classes Fig.1-1 C C++ Simula 67
More informationGreen with White Lines
各種コンテナの実装と性能 Qt #4 勉強会福岡 @ kikairoya About Twitter: @kikairoya 宮崎県都城市から来ました 本職 : 精密機械設計 組込機器開発 C++ とか出来ます Qt わかりません Abstruct STL コンテナと Qt コンテナの比較 データ構造 パフォーマンス 安全性 インタフェース おまけで Boost コンテナも STL Containers
More information連載講座 : 高生産並列言語を使いこなす (5) 分子動力学シミュレーション 田浦健次朗 東京大学大学院情報理工学系研究科, 情報基盤センター 目次 1 問題の定義 17 2 逐次プログラム 分子 ( 粒子 ) セル 系の状態 ステップ 18
連載講座 : 高生産並列言語を使いこなす (5) 分子動力学シミュレーション 田浦健次朗 東京大学大学院情報理工学系研究科, 情報基盤センター 目次 1 問題の定義 17 2 逐次プログラム 17 2.1 分子 ( 粒子 ) 17 2.2 セル 17 2.3 系の状態 18 2.4 1ステップ 18 2.5 力の計算 19 2.6 速度と位置の更新 20 2.7 セル間の分子の移動 21 3 OpenMP
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新版明解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 informationuntitled
C++2 1. publicprivate 2. 3. 4. 5. Intelligent Electronic Systems Group protected Carmainmy_car.car_number ca_number //Car class Car int car_number; // void showgas( ); // double gas; // void shownumber(
More information基礎プログラミング2015
応用プログラミング 第 5 回 テキスト入力処理 2017 年 10 月 18 日 ( 水 ) 第 7 章 テキスト入力処理 1 文字ずつの処理 (P.58) char 型などに入力する cin >> x や fin >> x はホワイトスペースが読み飛ばされる仕様 ホワイトスペース : スペース ( 空白 ), Tab( タブ ), 改行 // sample.cpp char ch; while(cin
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 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 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 information2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )
1,a) 2 4 WC C WC C Grading Student programs for visualizing progress in classroom Naito Hiroshi 1,a) Saito Takashi 2 Abstract: To grade student programs in Computer-Aided Assessment system, we propose
More information2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN
PenFlowchart 1,a) 2,b) 3,c) 2015 3 4 2015 5 12, 2015 9 5 PEN & PenFlowchart PEN Evaluation of the Effectiveness of Programming Education with Flowcharts Using PenFlowchart Wataru Nakanishi 1,a) Takeo Tatsumi
More information4 5 6 CHAPTER 1 1 1-1 n % i n = 3 m = 10 k = {1, 3, 5 Yes 1, 1, 3, 5 10 n = 3 m = 9 k = {1, 3, 5 No 9 8 1-1 #include const int MAX_N = 50; int main() { int n, m, k[max_n]; // scanf("%d %d", &n,
More informationPowerPoint Presentation
For experiment coordinators CREST, JST Go IWAI 2004/09/05 Introduction to CLDAQ for experiment coordinators 2 2004/09/05 Introduction to CLDAQ for experiment coordinators 3 2004/09/05 Introduction to CLDAQ
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 informationtkk0408nari
SQLStatement Class Sql Database SQL Structured Query Language( ) ISO JIS http://www.techscore.com/tech/sql/02_02.html Database sql Perl Java SQL ( ) create table tu_data ( id integer not null, -- id aid
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(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 informationtext_08.dvi
C 8 12 6 6 8 Java (3) 1 8.1 8 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 8.2 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
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 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: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 informationC 言語経験者のための C++ 入門
C 言語経験者のための C++ 入門 金森由博 kanamori@cs.tsukuba.ac.jp 2013/4/19 第 1.2 版 2011/7/19 第 1 版 この資料は下記 URL から入手できます http://kanamori.cs.tsukuba.ac.jp/index-ja.html#for_students 1 内容 C++ を学び始めに引っかかりそうなところを概説 この資料の目標は
More informationBoo Boo 2 Boo 2.NET Framework SDK 2 Subversion 2 2 Java 4 NAnt 5 Boo 5 5 Boo if 11 for 11 range 12 break continue 13 pass
Boo Boo 2 Boo 2.NET Framework SDK 2 Subversion 2 2 Java 4 NAnt 5 Boo 5 5 Boo 6 6 7 9 10 11 if 11 for 11 range 12 break continue 13 pass 13 13 14 15 15 23 23 24 24 24 25 import 26 27-1- Boo Boo Python CLI.NET
More informationスライド 1
今 此処にある C++ ~ テンプレートと STL~ テンプレートの解説 コンテナ イテレータ アルゴリズム アジェンダ テンプレートとは 型を外部から変更可能にした構文 通常の構文 int max(int a, int b){ return a > b? a : b; テンプレートを使った構文 template T max(t a, T b){ return a > b?
More informationGP05取説.indb
E -G V P 05D L V E -G P 05D W Ni-MH + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + 1 + 2 + 3 + 4 + 5 + 6 1 2 3 4 5 6 + + + 1 + + + + + + + + + + + + + + + + + + 1 A B C + D + E
More informationohp11.dvi
19 11 ( ) 2019.4.20 1 / ( ) n O(n 2 ) O(n 2 ) ( ) 1 d n 1 n logn O(nlogn) n ( n logn C ) 2 ( ) ( merge) 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge 3 ( ) (2) int *ivec_new(int size) { int *a
More informationr11.dvi
19 11 ( ) 2019.4.20 1 / 1.1 ( n n O(n 2 O(n 2 ) ( 1 d n 1 n logn O(nlogn n ( n logn C 1.2 ( ( merge 2 1 1 3 1 4 5 4 2 3 7 9 7 1 2 3 4 5 7 9 1: 2 ivec merge int *ivec_new(int size) { int *a = (int*)malloc((size+1)
More informationLIFO(last in first out, ) 1 FIFO(first in first out, ) 2 2 PUSH POP : 1
2007 7 17 2 1 1.1 LIFO(last in first out, ) 1 FIFO(first in first out, ) 2 2 PUSH POP 2 2 5 5 5 1: 1 2 データの追加 データの取り出し 5 2 5 2 5 2: 1.2 [1] pp.199 217 2 (binary tree) 2 2.1 (three: ) ( ) 秋田高専 校長 準学士課程学生
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 information*.....J.....S.q..2013B_....
1 1 2 2 3 3 4 4 5 6 5 7 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
More information北米アジャイル界デビュー fkinoからは 何も聞いてませんでした これまでに書いたもの Web 2.0 ビギナーズバイブル エンジニアマインド vol.5 開発の現場 vol.011 Dave 達人 Thomasも云ってたよ http://jp.rubyist.net/rubykaigi2007/?c=plugin;plugin=attach_download;p=program0610;file_name=the_island_of_ruby_j.pdf
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 informationhaskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
More informationC++0x
C++0x 言語の未来を語る 高橋晶 ( アキラ ) Blog: Faith and Brave C++ で遊ぼう Agenda What s C++0x Angle Bracket Initializer List auto decltype Delegating Constructor Extending sizeof Raw String Literal Defaulted and Deleted
More information# 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
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 informationVE-SV03DL VE-SV03DW Ni-MH Ni-MH Ni-MH 1 2 3 1 2 Ni-MH 3 4 5 I H 3 IH IH IH IH 2 0 4 6 6 1 2 3 # 6 6 4 I H I H I H I H I H I H I H NTT Ni-MH Ni-MH Ni-MH Ω 0570-087-087
More informationVE-GP32DL_DW_ZA
VE-GP32DL VE-GP32DW 1 2 3 4 5 6 1 2 3 4 1 1 2 3 2 3 1 1 2 2 2006 Copyrights VisionInc. @. _ & $ % + = ^ @. _ & $ % + = ^ D11 D12 D21
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 informationVDM-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
More informationPython C/C++ IPMU IRAF
Python C/C++ IPMU 2010 11 24IRAF Python Swig Numpy array Image Python 2.6.6 swig 1.3.40 numpy 1.5.0 pyfits 2.3 pyds9 1.1 svn co hjp://svn.scipy.org/svn/numpy/tags/1.5.0/doc/swig swig/numpy.i /usr/local/share/swig/1.3.40/python
More informationALG ppt
2012614 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 2 2 3 29 20 32 14 24 30 48 7 19 21 31 4 N O(log N) 29 O(N) 20 32 14 24 30 48 7 19 21 31 5
More informationPFQX2227_ZA
V E -G P 05D B Ni-MH 1 2 3 4 5 6 1 2 3 4 5 6 A B C D E F 1 2 A B C 1 2 3 2 0 7 9 4 6 6 4 7 9 1 2 3 # 6 6 2 D11 D12 D21 D22 19 # # # # Ni-MH Ω Ω
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 informationIntroduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for embedded systems that use microcontrollers (MCUs)
More informationC , C++ C C++ C++ C cpprefjp - C++ 1 C CUI 2.1 donothing.cpp 1
C++ 2018 7 1, 2018 11 4 http://nalab.mind.meiji.ac.jp/~mk/labo/text/nantoka-c++/ 1 C++ C C++ C++ C cpprefjp - C++ 1 C++17 2 2 CUI 2.1 donothing.cpp 1 /* 2 * donothing.cpp 3 */ 4 5 int main() 6 7 return
More informationQuick Sort 計算機アルゴリズム特論 :2017 年度 只木進一
Quick Sort 計算機アルゴリズム特論 :2017 年度 只木進一 2 基本的考え方 リスト ( あるいは配列 )SS の中の ある要素 xx(pivot) を選択 xx より小さい要素からなる部分リスト SS 1 xx より大きい要素からなる部分リスト SS 2 xx は SS 1 または SS 2 に含まれる 長さが 1 になるまで繰り返す pivot xx の選び方として 中央の要素を選択すると効率が良い
More informationTopLink å SampleClient.java... 5 Ò readallsample() querysample() cachesample() Ç..
lê~åäé= qçéiáåâ= NMÖENMKNKPF Volume2 Creation Date: Mar 04, 2005 Last Update: Aug 22, 2005 Version 1.0 ...3... 3 TopLink å...4 1... 4... 4 SampleClient.java... 5 Ò... 8... 9... 10 readallsample()... 11
More information05_fuke.indd
1971 1982 1985 Abstract The first liberalisation of circuit use (1971) and the second liberalisation (1982) liberalised the use of telecommunications circuits for data communications to respond the development
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 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 information取扱説明書_KX-PW100CL
See pages 236 238 for English Guide. KX-PW100CL Ni-MH KX-PW100CL-W KX-FKN100-W 1 2 NTT NTT 1 4 3 4 5 6
More informationclass IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value =
Part2-1-3 Java (*) (*).class Java public static final 1 class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value
More information4-3- 基 C++ に関する知識 オープンソースシステムのソースを解読する上で C++ の知識は必須であるといえる 本カリキュラムでは まずオブジェクト指向に関する Ⅰ. 概要理解を深め クラスの扱い方について学習し STL を使用してアルゴリズムとデータ構造を実装する方法を学習する Ⅱ. 対象専
4-3- 基 C++ に関する知識 1 4-3- 基 C++ に関する知識 オープンソースシステムのソースを解読する上で C++ の知識は必須であるといえる 本カリキュラムでは まずオブジェクト指向に関する Ⅰ. 概要理解を深め クラスの扱い方について学習し STL を使用してアルゴリズムとデータ構造を実装する方法を学習する Ⅱ. 対象専門分野職種共通 Ⅲ. 受講対象者 本カリキュラムの 4-2-
More informationRX600 & RX200シリーズ アプリケーションノート RX用仮想EEPROM
R01AN0724JU0170 Rev.1.70 MCU EEPROM RX MCU 1 RX MCU EEPROM VEE VEE API MCU MCU API RX621 RX62N RX62T RX62G RX630 RX631 RX63N RX63T RX210 R01AN0724JU0170 Rev.1.70 Page 1 of 33 1.... 3 1.1... 3 1.2... 3
More information3.1 stdio.h iostream List.2 using namespace std C printf ( ) %d %f %s %d C++ cout cout List.2 Hello World! cout << float a = 1.2f; int b = 3; cout <<
C++ C C++ 1 C++ C++ C C++ C C++? C C++ C *.c *.cpp C cpp VC C++ 2 C++ C++ C++ [1], C++,,1999 [2],,,2001 [3], ( )( ),,2001 [4] B.W. /D.M.,, C,,1989 C Web [5], http://kumei.ne.jp/c_lang/ 3 Hello World Hello
More informationpptx
iphone 2010 8 18 C xkozima@myu.ac.jp 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>
More informationプログラミング方法論 II 第 14,15 回 ( 担当 : 鈴木伸夫 ) 問題 17. x 座標と y 座標をメンバに持つ構造体 Point を作成せよ 但し座標 は double 型とする typedef struct{ (a) x; (b) y; } Point; 問題 18. 問題 17 の
プログラミング方法論 II 第 14,15 回 ( 担当 : 鈴木伸夫 ) 問題 17. x 座標と y 座標をメンバに持つ構造体 Point を作成せよ 但し座標 は double 型とする typedef struct{ (a) x; (b) y; Point; 問題 18. 問題 17 の Point を用いて 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 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取説_KX-PW101CL_PW102CW
See pages 270 and 271 for English Guide. KX-PW101CL KX-PW102CW Ni-Cd F1 F1 F2 F4 F1 F2 F4 F1 F2 F4 2 1 2 Ni-Cd Ni-Cd NTT NTT F1 F1 F1 F1 F1 F1 F1 F1 F4 F4 F4 F1 F4 F1
More information2 ColorSpace DepthSpace CameraSpace Kinect V2 Kinect V2 BOdyIndex 3. NtKinect Kinect V2 C++ NtKinect [4] NtKinect = Kinect SDK + + STL(C++) + OpenCV +
NtKinect: C++ Class Library for Kinect V2 1,a) Kinect for Windows V2 C++ NtKinect NtKinect DLL Kinect V2 Kinect V2, C++, DLL, Unity NtKinect: C++ Class Library for Kinect V2 Nitta Yoshihisa 1,a) Abstract:
More information2
L C -24K 9 L C -22K 9 2 3 4 5 6 7 8 9 10 11 12 11 03 AM 04 05 0 PM 1 06 1 PM 07 00 00 08 2 PM 00 4 PM 011 011 021 041 061 081 051 071 1 2 4 6 8 5 7 00 00 00 00 00 00 00 00 30 00 09 00 15 10 3 PM 45 00
More informationclass IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value =
Part2-1-3 Java (*) (*).class Java public static final 1 class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value
More information