icpc2019
| problems solved | 10 |
| algorithms learned | 0 |
Time Table
| week day | time range |
| saturday | 12 - 4 |
| sunday | 12 - 2 |
| monday | 12 - 2 |
| thueseday | 12 - 2 |
optimal total hours: 10h
TODO
- 16th Sharif, Problem C -> Finding divisions fastest way
- Least chosen sets that contains all members algorithm
- Primes, BitWiseSieve algorithm -> Learn how to use bits as storage; change and retrieve bits. may become handy :)
- Community detection algorithms e.g. infoMap
Problems
| phere online judge | https://www.spoj.com/problems/classical/ |
| UVa online judge | https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8 |
Contests
| running online constests | http://coj.uci.cu/contest/running.xhtml |
Formulas
| Pascal Triangle element | c = c * (line - i) / i |
| Big mod | (A*B*C) mod N == ((A mod N) * (B mod N) * (C mod N)) mod N |
| Primes | Fermat's Theorm |