Bhavik Dhandhalya BhavikDhandhalya

## pytorch-theme.json
{
    "workbench.colorTheme": "Default Light+",
    "workbench.colorCustomizations": {
        "editor.background": "#f1f1f1",
    },
    "editor.tokenColorCustomizations": {
        "variables": "#000000",
        "keywords": "#0086a4",
        "comments": "#c1c1c1",
        "functions": "#980000",

## competitive.go
package main

import (
    "bufio"
    . "fmt"
    "os"
    "math"
)

var (

## Dockerfile
FROM python

RUN mkdir src
WORKDIR /src/
COPY test.py .

## test.py
f = open("foo/config.json", "r")
print(f.read())

## pod.yaml
apiVersion: v1
kind: Pod
metadata:
  name: mypod
spec:
  containers:
  - name: mypod
    image: test/map:1.0
    command: ["python", "/src/test.py"]
    imagePullPolicy: Never

## Black_Shapes.cpp
int n;
int m;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

int Solution::black(vector<string> &A) {
    n = A.size();
    if (n == 0) return 0;
    m = A[0].length();
    vector < vector < bool > > visited(n, vector < bool > (m, false));

## BST_inorder_preorder_postorder_iterative.cpp
/*
Sample Input
10
5 4 8 1 6 10 3 7 2 9

Sample Output
PreOrder Recursive :
5 4 1 3 2 8 6 7 10 9
PreOrder iterative :
5 4 1 3 2 8 6 7 10 9

## TarjanSCC.cpp
/*
Below code is function which returns number of strongly connected components.

https://www.youtube.com/watch?v=TyWtx7q2D7Y
https://www.tutorialspoint.com/Tarjan-s-Algorithm-for-Strongly-Connected-Components
*/

int id;
int ans;

## left_view_BST.cpp
/*
Problems:
https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1
*/

/*
SAMPLE INPUT
1
8
5 4 7 1 2 8 9 10

## pollard_brent.py
"""
Bhavik Dhandhalya
BITS Pilani, ME Computer Science batch 2020
"""
from fractions import gcd
from random import randint
import time

def f(x, c, n):
    return (x ** 2 + c) % n
	{
	"workbench.colorTheme": "Default Light+",
	"workbench.colorCustomizations": {
	"editor.background": "#f1f1f1",
	},
	"editor.tokenColorCustomizations": {
	"variables": "#000000",
	"keywords": "#0086a4",
	"comments": "#c1c1c1",
	"functions": "#980000",
	apiVersion: v1
	kind: Pod
	metadata:
	name: mypod
	spec:
	containers:
	- name: mypod
	image: test/map:1.0
	command: ["python", "/src/test.py"]
	imagePullPolicy: Never
	int n;
	int m;
	int dx[4] = {-1, 0, 1, 0};
	int dy[4] = {0, 1, 0, -1};

	int Solution::black(vector<string> &A) {
	n = A.size();
	if (n == 0) return 0;
	m = A[0].length();
	vector < vector < bool > > visited(n, vector < bool > (m, false));
	/*
	Sample Input
	10
	5 4 8 1 6 10 3 7 2 9

	Sample Output
	PreOrder Recursive :
	5 4 1 3 2 8 6 7 10 9
	PreOrder iterative :
	5 4 1 3 2 8 6 7 10 9
	/*
	Below code is function which returns number of strongly connected components.

	https://www.youtube.com/watch?v=TyWtx7q2D7Y
	https://www.tutorialspoint.com/Tarjan-s-Algorithm-for-Strongly-Connected-Components
	*/

	int id;
	int ans;
	/*
	Problems:
	https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1
	*/

	/*
	SAMPLE INPUT
	1
	8
	5 4 7 1 2 8 9 10
	"""
	Bhavik Dhandhalya
	BITS Pilani, ME Computer Science batch 2020
	"""
	from fractions import gcd
	from random import randint
	import time

	def f(x, c, n):
	return (x ** 2 + c) % n