home

=Mistakes= =To do= =Algorithms=
 * if(ret != -1) return ret;
 * if(isVisit[blah] == caseN) return ret;
 * 쿼터니언 이해
 * 아호코라식
 * Manacher's Algorithm
 * @Index Tree with Ranged addition query
 * Hall's marriage theorem - Perfect matching이 되는 조건에 대한 이해가 필요
 * Bit Operations
 * Bridge finding
 * Harmonic number - SRM 400 hard, with minimizing float error
 * @Basic Geometry Library

=TopCoder=
 * @SRM 408
 * @SRM 412
 * @SRM 413
 * @SRM 414
 * @SRM 415
 * SRM 487
 * SRM 530
 * @TopCoder Open 2013 Round 1A

=CodeForces=
 * CodeForces Beta Round 37
 * CodeForces Beta Round 36
 * CodeForces Beta Round 30
 * CodeForces School Team Contest 2

=OIs=
 * JOI 2009_2010

=ACM-ICPC=

Asia

 * @Dhaka 2012
 * Jakarta 2012

Europe

 * Southeastern 2010

=PS Log=