I recently tried using the fastolympiccoding package on sublime. But had to go through different blogs, videos to understand how to set it up. So, here I am trying to compile a short step-by-step guide to set it up for anyone who faces similar difficulty. I will attach links to blogs/repos which I referred.

1) Install mingw (You can YouTube search this, there are tons of videos on it).

2) Install Sublime Text.

3) Install "package control" in Sublime.

i) Go to Tools > Command palette (Windows shortcut: ctrl + shift + p).
ii) Search for "install package control" and install it.

4) Setting up fastolympiccoding in sublime:

i) Installation. Go to: Preferences -> Package Control -> Install Package -> CppFastOlympicCoding.
ii) Change compilation flag from C++11 to C++17 version:
    a) Tools → FastOlympicCoding → settings.
    b) Change -std=gnu++11 to -std=gnu++17.

5) Setup FastOlympicCodingHook in sublime (In layman terms, this parses the test cases of the problem open in chrome automatically to a file).

i) Install Python3.
ii) Install the "Competitive Companion" chrome extension.
iii) Add 12345 in the list of ports of competitive-companion browser extension.
iv) Clone the (https://github.com/DrSwad/FastOlympicCodingHook) github repository inside Sublime Text Packages folder. (Preferences -> Browse Packages) and rename the cloned folder to "FastOlympicCodingHook".
V) Additional step for Windows users: Add the following line in the FastOlympicCoding settings file (Tools → 
   FastOlympicCoding → settings): "tests_file_suffix": "__tests" on the right pane.

5 a) Using FastOlympicCodingHook:

i) Navigate to the file that you'll solve the problem in. Then right click anywhere in the file.
   You should find an option named Listen to Competitive Companion. Click on it.
ii) In the browser, navigate to the problem page and click on the competitive-companion extension's green plus icon.
The problem test cases and correct answers would be parsed now and stored in a file named your "filename__tests".
iii) You might not immediately see the change in test cases inside sublime text. But if you run your code using FastOlympicCoding plugin (ctrl+B), then it'll you show those updated test cases and run your code against them.

6) Setup AutomateOlympicCoding in sublime

i) Install bs4 via pip.
ii) Install pywinauto via pip.
iii) From the repository (https://github.com/epsilon573/AutomateOlympicCoding):
    a) Place the build file in Packages->user folder (access via preferences->browse packages).
    b) Place the automate.py & contest.py files in the same folder as your main cpp solution file.

6 a) Using AutomateOlympicCoding:

i) Parsing single problem:
     a) In Sublime, build using "automate" build system (Ctrl + Shift + B) -> This will create a test file with the same name as the solution file.
     b) Now just run the solution using FastOlympicCoding (ctrl + alt + B).

ii) Parsing a complete contest:
     a) Create a "template.cpp" file (must be in the same directory as automate and contest.py) -> This file will be copied to all solution files when parsing the contest.
     b) Open any cpp file in the same directory (preferably template.cpp).
     c) Open the contest page on Chrome (only works on chrome).
     d) Open sublime text and build using "automate-contest" build system (Ctrl + Shift + B). -> This plugin will create a directory with the contest ID and it will contain cpp files for all problems with template copied into them and corresponding test files will be parsed with them.
     e) Just open them and start solving.
     f) Now just run your solution using FastOlympicCoding.

I haven't covered everything this extension does. But that being said, this does setup the basics.

Links I referred: link link link link link

My opinion: Extensions and marcos don't help much until one practices enough.

Hello community. I have been practicing problems on CF for quite some time now. My greatest shortcoming is solving problems having only "Math" tag and having some form of raw mathematical thinking skill as requirement. I struggle even with 800-900 rated problems of this type. For clarification, here are few problems where I struggled:

https://codeforces.me/problemset/problem/1283/B

https://codeforces.me/contest/1363/problem/A

https://codeforces.me/problemset/problem/1437/A

Also, I would like to point out that I don't face much difficulty with problems where I have to use Math algorithms like GCD, sieve etc.

So, how do I recover from this discomfort? Would simply solving the Math tagged problems in increasing rating be sufficient? Or are there other resources?

Also, just curious whether Math problems are difficult in general for non-math background people.

Hello. I have been doing CP actively for approximately 3 months now. I know theory of some algorithms and paradigms like DFS, Binary search, bitmasks, DP, greedy, math algos etc. But I am not good at solving problems using them.

Also, my implementation/ad-hoc skills are decent but I take up a lot of time to solve them. I mostly wreck up my contests because of lack of better implementation skills or over-complicating the problem. In addition, I have a bad a temperament towards contests — I can't think over the entire contest time — I tend to give up within 45 mins if I don't come up with solution of A. Or even if I get AC in A, I tend to give up before contest time if ideas don't strike after prolonged thinking.

So, I thought of doing regular VCs alongside practicing problems in my optimal rating range (900 — 1500 as of now). For that, I will start with virtual contests everyday (exempting contest days) and upsolve till D2 A, B, C and D3 A, B, C, D (further if solves >= 2000).

My default VCs would be in order of recent contests in which I haven't participated. So, do suggest good contests you have in mind and improvements over this strategy. Also suggest some pre-contest routine if you have any.

I will keep updating this blog everyday with VC status. All I got to do this lock-down is CP, so I wish to come out with stronger skills (maybe not just rating) post this lock-down period.