9787302294900 - acm国际大学生程序设计竞赛:知识与入门 (1 resultados)
- Tapa blanda
Librería: liu xing, Nanjing, JS, Chinaliu xing
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 54,33
Envío por EUR 15,42Se envía de China a Estados Unidos de AmericaCantidad disponible: 1 disponibles
paperback. Condición: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: December 2012 Pages: 202 Language: English Publisher: Tsinghua University Press acm International Collegiate Programming Contest (acm-icpc) is internationally recognized as the h…ighest level. the largest and most affected computer professional competitions. The global number of participants reached more than 20 million. ACM International Collegiate Programming Contest: Knowledge and entry of 16 years of coaching experience and accumulated cost of writing a series of books. comprehensive. in-depth and systematic ACM-ICPC to show to the reader. The series include ACM International Collegiate Programming Contest: Knowledge and entry ACM International Collegiate Programming Contest: Algorithm and Implementation. ACM International Collegiate Programming Contest: topics interpretation. ACM International Collegiate Programming Design Competition : game and thinking 4. ACM International Collegiate Programming Contest: knowledge and Getting Started ACM-ICPC knowledge and its classification. advanced and role of online evaluation system; acm International Collegiate Programming Contest: Algorithm and Implementation describes acm the icpc algorithm classification. and index; ACM International Collegiate Programming Contest: Title and Interpretation with classic examples and exam for all types of algorithms and problem-solving ideas; ACM International Collegiate Programming Competition: competition and thinking. the Shanghai Jiaotong University ACM-ICPC training and competition. including training Notes on the stadium situation. the aspect of the season. the champion of the road. eventful years. ACM International Collegiate Programming Contest: knowledge and Getting Started applies to undergraduate and graduate students to participate in the ACM International Collegiate Programming Contest. also very instructive value of high school students to participate in the youth Olympiad in Informatics. Meanwhile. as programming. data structures. algorithms and other related courses to expand and enhance the series is also a rare teaching supplementary reading materials. Contents: Chapter 1 entry of the first part of the Introduction and advanced 1.1 acm-icpc contest 1.2 Getting Started 1.3 team division of labor and cooperation training 1.4 1.5 preparing for the Division Series 1.6 Preparing for Finals Chapter 2 Advanced 2.1 2.2 how to improve the code how to improve the ability to read the questions ability to of 2.3 bugs debug2.4 from a title to the second part of the knowledge of the proposition with Chapter 3 of the strategy for solving mathematical basis 3.1 function growth and complexity of classification 3.1.1 progressive symbol 3.1.2-order calculation 3.1.3 complexity Category 3.2 3.2.2 expectation and variance of probability theory 3.2.1 event with probability 3.3 algebra matrix 3.3.1 3.3.2 determinant 3.3.3 for solving linear equations polynomial 3.3.4 3.3.5 plural 3.3.6 the group 3.4 combinatorics 3.4.1 arrangement and combination of 3.4.2 pigeonhole principle 3.4.3 inclusion-exclusion principle 3.4.4 special counting sequence the 3.4.5 plya counting theorem 3.5 Game Theory 3.5.1 game tree 3.5.2 sg function 3.5.3 nim game with nim and 3.6 Number Theory 3.6.1 divisible 3.6.2 indeterminate equation 3.6.3 congruence equation and Euler's theorem 3.6.4 primitive root. discrete data on the number and two congruence equation 3.6.5 of Chapter 4 of the continued fraction 4.1 linear structure linked list in Table 4.1.1 4.1.2 4.1.3 queue stack 4.1.4 block chain 4.2 Collection 4.2.1 4.3.1 simple hash table 4.2.2 and check Set 4.3 Sort sorting algorithm insertion sort 4.3.1.1 4.3 .1.2 bubble sort 4.3.2 efficient sorting algorithm 4.3.2.1 merge sort algorithm 4.3.2.2 quick sort algorithm 4.3.2.3 linear sorting algorithm 4.4 tree 4.4.1 heap 4.4.1.1 binary heap 4.4.1.2 left side tree 4.4. the definition of the basic terminology o.
