Skip to main content

· 5 min read
Josh Cena

This is the fifth activity of Computerization algorithm team. Because the December USACO contest is almost there, we had some targeted practicing, starting with Bronze problems. Because members already have decent understanding, we chose a tough one. Bronze division problems only require mastery of loops, so a brute-force enumaration will always work, with no requirement of algorithms or data structures.

· 4 min read

This is the first activity of Computerization algorithm team. We discussed a problem from Shanghai NOI regional selection, which leverages state compression dynamic programming. The mathematics is beyond our capacity to be rigorously proven.

· 3 min read
Josh Cena

This is the first activity of Computerization algorithm team. We introduced the method to find the nnth term of the Fibonacci sequence, which mainly uses matrix exponentiation.

· 8 min read
Josh Cena

This article is migrated from the first section of the file in the new member practice commit repo.

You can either add a file via Graphical-User-Interface(GUI)-powered GitHub Desktop or command line. You may begin with GUI, but you will someday get into command lines since they offer better control over your repo. Furthermore, Visual Studio Code users can try out the built-in source control.

We find it necessary to tell you what you are actually doing each step instead of having you follow the written instructions mechanically. This especially helps since things hardly go as beautifully as the tutorial expects. This section assumes no prior knowledge of any git operations.

· One min read
Josh Cena

Computerization welcome all new members of class 2020!

At Computerization, you can:

  • Join in the development of the new platform Enspire;
  • Research on artificial intelligence (e.g. neural networks, machine learning);
  • Take part in algorithm contests (e.g. LeetCode weekly contest);
  • Learn front-end / back-end technology and web designing, experience web development in the real world;
  • ...

We hope that all new members can learn with joy, self-improve, and meet peers with the same interest.