Computer Science Canada

Ccc 2013

Author:  Panphobia [ Mon Jan 21, 2013 4:10 pm ]
Post subject:  Ccc 2013

So my school is participating in the CCC 2013, and I am familiar with most of the topics covered like graph searching, searching, sorting, recursion, string manipulation, but am not familiar with these, optimization, simulation, geometry, enumeration (i.e. counting), dynamic programming), what are these? and how would I learn them?

Author:  azneye [ Tue Jan 22, 2013 4:42 pm ]
Post subject:  Re: Ccc 2013

For programming contest type problems one good place to learn is the USACO training pages: http://www.usaco.org/index.php?page=training.
You can also try to solve past CCC problems at http://wcipeg.com/main.

Out of curiosity, do you happen to go to a public high school in Ontario?

Author:  Panphobia [ Tue Jan 22, 2013 5:33 pm ]
Post subject:  RE:Ccc 2013

Yes I am in a high school in Ontario yes, and I know the USACO stuff, and I have done most of the CCC problems, I am not looking for problems, I just want concepts Razz

Author:  crossley7 [ Tue Jan 22, 2013 8:23 pm ]
Post subject:  RE:Ccc 2013

optimization, simulation, geometry, enumeration (i.e. counting), dynamic programming

Simulation problems tend to be ad-hoc so just find the details and basically write code that will do what is required. Find dwite problems that you can practice with.

Optimization can apply to almost anything. Many algorithms can apply to this. google and contests are your friend here.

Geometry requires a good foundation in math.

Dynamic programming is the concept where you break a larger problem into smaller ones and combine those to solve the large one. The backpack problem is the classic for this type of problem.

Not sure what is meant by counting since that could be many things. I hope that helps you. If you can do the problems then you likely will have picked up the concepts without realizing it.


: