Competitive Programming

Lecture 1

  1. Become a better programmer/problem solver

    1. Lots of practice of applying algorithmic ideas
    2. Working on interesting problems which have been tested
    3. Practice thinking about time complexity
  2. October is NAQ

  3. Regional (ECNA) is November @ Purdue

  4. March: (NAC)

How to fast IO:

BufferedReader.readline().split()
BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
out.close();
void main(){
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> nCities;
  count << (int) answer << "\n";
  return 0;
}

Time complexities You can do about 10^9 (billion) operations a second, not including syscalls and compiling.