COM's Project

Hal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the top several comprise almost 80% of the problems seen at the IOI. Here they are:

• Dynamic Programming
• Greedy
• Complete Search
• Flood Fill
• Shortest Path
• Recursive Search Techniques
• Minimum Spanning Tree
• Knapsack
• Computational Geometry
• Network Flow
• Eulerian Path
• Two-Dimensional Convex Hull
• BigNums
• Heuristic Search
• Approximate Search
• Ad Hoc Problems

김용혁 교수님께서 알려주신 USACO
첫문제 통과!
문제풀이보다
봇 돌려본데 의의를 둬봤음

invalid-file

저희 ACM팀( 장지용(03), 최홍준(07), 김형석(07) ) 스프링노트 주소입니다.

http://temjin4.springnote.com/

딱히 ACM스프링노트 주소만 골라내는 법을 몰라서 제 계정 스프링노트 주소로 적어둡니다.