Antti H S Laaksonen
|
b09ad74243
|
Small improvements
|
2017-04-22 15:19:48 +03:00 |
|
Antti H S Laaksonen
|
480f58d386
|
Small improvements
|
2017-04-22 15:13:42 +03:00 |
|
Antti H S Laaksonen
|
f03fbd49a3
|
Fix 'is time'
|
2017-04-22 12:34:44 +03:00 |
|
Antti H S Laaksonen
|
b874622647
|
Small improvements
|
2017-04-22 12:31:35 +03:00 |
|
Antti H S Laaksonen
|
334cf16de7
|
Add reference to Mo's algorithm
|
2017-04-22 12:00:43 +03:00 |
|
Antti H S Laaksonen
|
e8608fa76f
|
Small improvements
|
2017-04-22 11:57:37 +03:00 |
|
Antti H S Laaksonen
|
02465b379b
|
Mention special binary indexed trees
|
2017-04-21 23:27:15 +03:00 |
|
Antti H S Laaksonen
|
35d6a58004
|
Small improvements
|
2017-04-21 23:19:29 +03:00 |
|
Antti H S Laaksonen
|
60d09f8199
|
Small improvements
|
2017-04-21 22:18:22 +03:00 |
|
Antti H S Laaksonen
|
73e8b52379
|
Fix except -> expect
|
2017-04-21 09:42:07 +03:00 |
|
Antti H S Laaksonen
|
1f7ac8efba
|
Change result -> outcome
|
2017-04-21 09:30:15 +03:00 |
|
Antti H S Laaksonen
|
d59e5c0e80
|
Show full Prüfer code example
|
2017-04-20 23:26:44 +03:00 |
|
Antti H S Laaksonen
|
41a2e0c721
|
Improve language
|
2017-04-20 23:20:52 +03:00 |
|
Antti H S Laaksonen
|
705a2e921b
|
Improve grammar
|
2017-04-20 22:58:12 +03:00 |
|
Antti H S Laaksonen
|
7e9f75ebd8
|
Improve grammar
|
2017-04-20 22:54:08 +03:00 |
|
Antti H S Laaksonen
|
24407fb106
|
Fix grammar
|
2017-04-19 21:31:36 +03:00 |
|
Antti H S Laaksonen
|
9ca906ee77
|
Change circuit -> path
|
2017-04-19 21:16:50 +03:00 |
|
Antti H S Laaksonen
|
ee7ede62d5
|
Use 0-based array indexing
|
2017-04-19 21:12:31 +03:00 |
|
Antti H S Laaksonen
|
a456fedeff
|
Fix grammar
|
2017-04-19 21:08:54 +03:00 |
|
Antti H S Laaksonen
|
0527dbd60d
|
Fix grammar
|
2017-04-19 21:03:04 +03:00 |
|
Antti H S Laaksonen
|
b9061d2a76
|
Add a note about make_tuple
|
2017-04-19 20:53:58 +03:00 |
|
Antti H S Laaksonen
|
b2be3a3b5c
|
Fix grammar and indices
|
2017-04-19 20:44:51 +03:00 |
|
Antti H S Laaksonen
|
2fd8cf26cc
|
New PDF
|
2017-04-18 21:49:02 +03:00 |
|
Antti H S Laaksonen
|
8916cbfdcd
|
Mention Faulhaber's formula
|
2017-04-18 21:39:31 +03:00 |
|
Antti H S Laaksonen
|
149611e057
|
References to COCI and USACO
|
2017-04-18 21:34:34 +03:00 |
|
Antti H S Laaksonen
|
d9eb74f39f
|
More info about C++ binary search functions
|
2017-04-18 21:25:46 +03:00 |
|
Antti H S Laaksonen
|
180fe097e8
|
Add references to the tiling formula
|
2017-04-18 20:31:08 +03:00 |
|
Antti H S Laaksonen
|
a8e456ce15
|
Fix indices and grammar
|
2017-04-18 20:22:56 +03:00 |
|
Antti H S Laaksonen
|
f551b3b422
|
Small fixes
|
2017-04-18 20:15:43 +03:00 |
|
Antti H S Laaksonen
|
8dcb525de9
|
Show data structure names in bold
|
2017-04-18 20:12:07 +03:00 |
|
Antti H S Laaksonen
|
e256200528
|
Small fixes
|
2017-04-18 20:08:21 +03:00 |
|
Antti H S Laaksonen
|
b4e89f13ec
|
New PDF
|
2017-04-17 20:42:18 +03:00 |
|
Antti H S Laaksonen
|
778dfb02dd
|
self-made -> home-made
|
2017-04-17 20:36:07 +03:00 |
|
Antti H S Laaksonen
|
636f7c4795
|
More about segment tree origin
|
2017-04-17 20:22:56 +03:00 |
|
Antti H S Laaksonen
|
4ab2897545
|
Add Z-algorithm implementation [closes #20]
|
2017-04-17 18:26:00 +03:00 |
|
Antti H S Laaksonen
|
b9a237181b
|
Use 0-indexing also in strings [closes #27]
|
2017-04-17 18:20:20 +03:00 |
|
Antti H S Laaksonen
|
35d53d39d4
|
Use 0-indexing with C++ arrays
|
2017-04-17 17:59:27 +03:00 |
|
Antti H S Laaksonen
|
11564fd4d3
|
Better names for variables [closes #18]
|
2017-04-17 15:27:43 +03:00 |
|
Antti H S Laaksonen
|
baee83266a
|
Use a constant for infinite values
|
2017-04-17 14:38:33 +03:00 |
|
Antti H S Laaksonen
|
77488f2f3e
|
New PDF
|
2017-04-17 14:01:44 +03:00 |
|
Antti H S Laaksonen
|
31ff123f33
|
Improvements for graph algorithms
|
2017-04-17 13:58:04 +03:00 |
pllk
|
086d0e61cd
|
Merge pull request #38 from Linkus000/master
Change arrays indicating visitiveness of nodes to bool[] from int[] in dfs,bfs
|
2017-04-17 12:41:34 +03:00 |
|
Antti H S Laaksonen
|
8028fddfa6
|
Small fixes
|
2017-04-17 12:18:29 +03:00 |
|
Antti H S Laaksonen
|
55b55d1fc1
|
Reference to polynomial algorithms for knight's tour [closes #35]
|
2017-04-17 11:39:41 +03:00 |
|
Antti H S Laaksonen
|
e010fb27e8
|
Better definition for function f [closes #31]
|
2017-04-17 11:23:40 +03:00 |
|
Antti H S Laaksonen
|
c1ac1df7dc
|
Provide a shorter syntax for creating tuples [closes #28]
|
2017-04-17 11:05:33 +03:00 |
|
Antti H S Laaksonen
|
e5c50e115e
|
Mention the name 'sparse table' [closes #29]
|
2017-04-17 10:53:02 +03:00 |
|
Antti H S Laaksonen
|
8c564bd46b
|
New PDF
|
2017-04-03 01:23:59 +03:00 |
|
Antti H S Laaksonen
|
cd973087f9
|
Change month
|
2017-04-03 01:22:44 +03:00 |
|
Antti H S Laaksonen
|
4ca89383d0
|
New PDF
|
2017-04-03 01:22:14 +03:00 |