Competitive Programming
Lecture 1
Become a better programmer/problem solver
- Lots of practice of applying algorithmic ideas
- Working on interesting problems which have been tested
- Practice thinking about time complexity
October is NAQ
Regional (ECNA) is November @ Purdue
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.