I and trying to find a good book to read (on programming). Which book do you recommend?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
43:18:05
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
43:18:05
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 21.11.2024 22:16:55 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Algorithm Design Manual by Skiena..
Ok, thanks!
Thomas H. Cormen — Introduction to algorithms
Competitive Programming
Thanks! I already got that one, but I think it requires some advanced knowlegde (to me) , so I and finding a simpler and more detailed book. Thanks again!
It was 3 years ago, probably you have already read or skimmed that book) Do you recommend it for novice?
exactly books of Cormen
Introduction To Algorithms With A Creative Approach
Udi Manber
PDF version?
Yes>>
www.gbv.de/dms/ilmenau/toc/025198858.PDFI think you must read Introduction to Algorithms
I think this book is pretty easy to read:
Algorithms: Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
Official copy is available at home page of Umesh Vazirani at berkeley.edu:
0: Prologue
1: Algorithms with numbers
2: Divide-and-conquer algorithms
3: Decompositions of graphs
4: Paths in graphs
5: Greedy algorithms
6: Dynamic programming
7: Linear programming and reductions
8: NP-complete problems
9: Coping with NP-completeness
10: Quantum algorithms
For beginners it's easy to read introduction to algorithms since it's not too formal style (chaps 0-6).
For experienced coders, it still could be interesting introduction to theoretical computer science (chaps 8-10).
For example Julius Evola: Revolt Against the Modern World.
Oh, on programming...
Made my day.
Book I enjoyed the most was "Winnie The Pooh" :3
I am curious zscoder, what book did you choose?
taking into account that once he reached 2908 rating, I suppose that he managed to read all these books.
Or none of them.
zscoder which books you used ?
Your ratings are too high and you may ask tourist