SUMIT VOHRA saisumit

https://www.linkedin.com/in/sumit-vohra-224484a0/

saisumit / codejam

Created May 22, 2017 13:48


	#include <bits/stdc++.h>
	#define REP(i, a, b) for (int i = a; i <= b; i++)
	#define FOR(i, n) for (int i = 0; i < n; i++)
	#define foreach(it, ar) for ( typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++ )

	#define PI 3.1415926535897932385
	#define uint64 unsigned long long
	#define Int long long
	#define int64 long long

saisumit / comp_calc.cpp

Created April 26, 2017 22:08

saisumit / control_flow_graph.cpp

Created April 9, 2017 15:48

saisumit / Dynamic_huffman.cpp

Last active April 6, 2017 15:59



	/ Code For Dynamic Huffman /
	#include <bits/stdc++.h>
	#define Int long long
	#define REP(i, a, b) for (int i = a; i <= b; i++)
	#define FOR(i, n) for (int i = 0; i < n; i++)
	#define foreach(it, ar) for ( typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++ )

	#define PI 3.1415926535897932385

saisumit / project.cpp

Created April 2, 2017 12:36

	/*
	PROJECT FOR THE END-SEM
	COMPLEXITY ANALYSIS OF AN ALGORITHM BASEDON DIFFERENT TEST CASES
	1 ) BASIC IDEA : AN ALGORITHM WOULD BE TESTED ON VARIOUS TEST CASES BASED ON DIFFERENT INPUT SIZES

	*/

	#include <bits/stdc++.h>
	using namespace std ;
	map<int,string> m ;

saisumit / Poles_divide_and_conquer.cpp

Created March 28, 2017 09:57

	#include<bits/stdc++.h>
	#define ll long long
	using namespace std;
	vector<int> w;
	vector<ll int> h;
	ll int c[5010][5010];
	ll int dp[2][5010];
	void f(int g,int l1,int l2,int p1,int p2)
	{
	if(l1>l2)

saisumit / cow.cpp

Last active March 24, 2017 17:57

saisumit / trappsit.cpp

Created March 13, 2017 10:04

saisumit / sidharth.cpp

Created March 13, 2017 10:02

saisumit / tucker-tucker.cpp

Created March 13, 2017 10:00