lomnom

Noi notes

Boilerplate

Template

#include <iostream>
#define num long int

using namespace std;

int main(){

Hints & solutions

Wormholes

Hint 1

When defining a DP function, think about all the possible ways to get to where you are from ONE step before.

Also assume that if your cases are correct, all your dp results are correct.

2 Solutions for Subgraphs

Smart loop

Uses the vector visited.

Special optimization:

With the vector visited,
for (int i = 0; i<nodes; i++){
if (!visited[i]){do bfs and increment the counter by 1}

This avoids iterating through the whole visited vector every time. It only does so once.

Hints

Subgraphs

Hint #1

Use DFS for this. Approach is the same as with BFS (refer to session 7 slides), except that you use DFS.

Dijkstra

Details

Hint #0

Dijkstra

#include <iostream>
#include <queue>
#include <vector>
#include <limits.h>

using namespace std;

typedef long long int ll;

Steps taken to get cms up and running

Cms was installed onto a raspberry pi running 64x raspbian through docker. This document details the process. It assumes you are working from the terminal.

Before everything

sudo apt-get update && sudo apt-get upgrade to have up-to-date apt info

Get CMS source

Note that we install through the docker route to avoid the suffering that comes with manually resolving dependencies.

Install git thru apt with sudo apt-get install git.

Hints

Segment tree

Hint #1

This questions wants you to implement a conventional segment tree. You can use the nyrcs template

Hint #2

It wants you to find the minimum instead of the sum. How do you do that?

	'The peaks of Mt. CodeMore are carpeted with an impenetrable armour of snow.'
	"""Below that snow lies sparkly logic."""

	#
	#-##
	##-#.
	@print ###
	@ ( ##-###.
	lambda ###=# ##
	a ## #=

	> v
	1 #
	2 vtv#<
	3 # # t
	4 v<v< >#vtv
	5 t t # #
	6 v<v<
	7 t t
	8
	SXY vvvv vvvv

	// ==UserScript==
	// @name NYJC download
	// @namespace https://tampermonkey.net/
	// @version 2025-03-02
	// @description Adds the download button to lectures on the NYJCportal. https://gist.github.com/lomnom/a0c51d25a65198eba13333d6395e9bb1
	// @author lomnom on github
	// @match portal.nyjc.edu.sg/*
	// @icon data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==
	// @grant none
	// ==/UserScript==