nothing much

Author: akshit24

catalan.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+#include <cstdio>
+
+using namespace std;
+int a[10];
+int main()
+{
+	a[0] = 1; a[1] = 1;a[2] = 2;
+	int n;
+	cin >>n;
+	int ans = 0;
+	for (int i = 0 ; i < n ; i++ ){
+		ans+=a[i]*a[n-i-1]
+	}
+
+	return 0;
+}

coinchangedp.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <cstdio>
+#include <vector>
+#include <climits>
+#include <cstring>
+
+using namespace std;
+int C[101];	
+
+int noofcoins(int P,vector <int>& v)
+{
+	memset(C,INT_MAX,sizeof(C));
+	C[0]=0;
+	int n=v.size();
+	for(int i=1;i<=P;i++)
+	{
+		int mn=INT_MAX;
+		for(int j=0;j<n;j++){
+			if(v[j]<=i && C[i-v[j]] < mn)
+			{
+				mn=C[i-v[j]];
+				C[i]=mn;
+			}
+		}
+		C[i]+=1;
+	}	
+	return C[P];
+	
+}
+int main()
+{
+ 	vector <int > v;
+	v.push_back(1);
+	v.push_back(3);
+	v.push_back(5);
+	int ans = noofcoins(11,v);
+	cout << ans<<endl;
+	return 0;
+}

dijkstra.cpp

@@ -0,0 +1,56 @@
+#include <iostream>
+#include <cstdio>
+#include <vector>
+#include <queue>
+#include <cstring>
+#include <functional>
+
+using namespace std;
+
+typedef pair <int, int> pii;
+typedef vector <pii> vpii;
+typedef vector <vpii> vvpii;
+
+
+int main()
+{
+	vvpii graph;
+	graph.resize(7);
+
+	/*Sample Graph*/
+
+	graph[1].push_back(pii(10,2)); graph[1].push_back(pii(5,4));
+	graph[2].push_back(pii(1,3)); graph[2].push_back(pii(2,4));
+	graph[3].push_back(pii(4,5));
+	graph[4].push_back(pii(3,2)); graph[4].push_back(pii(9,3)); graph[4].push_back(pii(2,5));
+	graph[5].push_back(pii(7,1)); graph[5].push_back(pii(3,6));
+
+	/*Sample Graph ends*/
+
+	int d[6]; int src; int parent[6];
+	memset(d,1000000,sizeof(d));
+	cin>>src;
+	d[src] = 0;parent[src] = NULL;
+	priority_queue <pii,vpii,greater<pii> > Q;
+	Q.push(pii(0,1));
+	while(!Q.empty()){
+		pii tmp = Q.top();
+		Q.pop();
+		int w = tmp.first; int v = tmp.second;
+		for(int i = 0 ; i < graph[v].size(); i++){
+			int w2 = graph[v][i].first; int v2 = graph[v][i].second;
+			if(d[v2] > d[v] + w2){
+				d[v2] = d[v]+w2;
+				parent[v2] = v ;
+				Q.push(pii(d[v2],v2));
+			}
+		}
+
+	}
+	/*for(int i = 1 ; i <= 5 ; i++)
+		cout<<"d["<<i<<"] = "<<d[i]<<endl;
+	for(int i = 1 ; i <= 5 ; i++)
+		cout<<"parent["<<i<<"] = "<<parent[i]<<endl;
+	*/
+	return 0;
+}

kruskal.cpp

@@ -0,0 +1,71 @@
+#include <iostream>
+#include <cstdio>
+#include <vector>
+#include <map>
+#include <queue>
+#include <algorithm>
+
+using namespace std;
+
+typedef pair <int,int> pii;
+typedef vector <pii> vpii;
+
+vpii graph[100];
+int id[100];
+int sz[100];
+void init(int n){
+	for(int i = 0 ; i < n ; i++)
+	{
+		id[i] = i;
+		sz[i] = 1;
+	}
+}
+
+int find(int p){
+	while(p!=id[p]){
+		p = id[p];
+	}
+	return p;
+}
+
+bool conncted(int p , int q){
+	return (find(p) == find(q));
+}
+
+void join(int p , int q){
+	int proot = find(p);
+	int qroot = find(q);
+	id[proot] = qroot;
+}
+
+struct Edge{
+	int weight;
+	int either;
+	int other;
+};
+struct comparator{
+	bool operator()(const Edge &a, const Edge &b){
+		return (a.weight > b.weight);
+	}
+};
+int main(){
+	priority_queue<Edge,vector<Edge>,comparator> Q;
+	//sample graph
+	Edge edge[8];
+	graph[0].push_back(pii(26,2));graph[0].push_back(pii(38,4));graph[0].push_back(pii(58,6));graph[0].push_back(pii(16,7));
+	graph[1].push_back(pii(36,2));graph[1].push_back(pii(29,3));graph[1].push_back(pii(32,5));graph[1].push_back(pii(19,7));
+	graph[2].push_back(pii(26,0));graph[2].push_back(pii(36,1));graph[2].push_back(pii(17,3));graph[2].push_back(pii(40,6));graph[2].push_back(pii(34,7));
+	graph[3].push_back(pii(29,1));graph[3].push_back(pii(17,2));graph[3].push_back(pii(52,6));
+	graph[4].push_back(pii(38,0));graph[4].push_back(pii(35,5));graph[4].push_back(pii(93,6));graph[4].push_back(pii(37,7));
+	graph[5].push_back(pii(32,1));graph[5].push_back(pii(35,4));graph[5].push_back(pii(28,7));
+	graph[6].push_back(pii(58,0));graph[6].push_back(pii(40,2));graph[6].push_back(pii(52,3));graph[6].push_back(pii(93,4));
+	graph[7].push_back(pii(16,0));graph[7].push_back(pii(19,1));graph[7].push_back(pii(34,2));graph[7].push_back(pii(37,4));graph[7].push_back(pii(28,5));
+	
+	//sample graph ends
+	edge[0].either = 0; edge[0].other = 2; edge[0].weight = 26; edge[0].either = 0; edge[0].other = 4; edge[0].weight = 38;
+	edge[0].either = 0; edge[0].other = 6; edge[0].weight = 58; edge[0].either = 0; edge[0].other = 7; edge[0].weight = 16;
+
+
+	Q.push()	
+	return 0;
+}

lcs.cpp

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<cstdio>
+#include<string>
+#include<cstring>
+
+using namespace std;
+
+int LCS[512][512];
+int findlcs(string s1,string s2)
+{
+	int m=s1.size();
+	int n=s2.size();
+	for (int i = 0 ; i <= m ; i++){
+		for (int j = 0 ; j <= n ; j++){
+			if (i == 0 || j == 0)
+				LCS[i][j] = 0;
+			else if(s1[i-1] == s2[j-1])
+				LCS[i][j] = 1 + LCS[i-1][j-1];
+			else
+				LCS[i][j] = max(LCS[i-1][j] , LCS[i][j-1]);
+		}
+	}
+	return LCS[m][n];
+}
+int main()
+{
+	string s1="AGCAT";
+	string s2="GAC";
+	int ans=findlcs(s1,s2);
+	cout << ans <<endl;
+	return 0;
+
+}

linklist.java

@@ -0,0 +1,22 @@
+import java.util.*;
+
+class Node{
+	int data;
+	Node next=null;
+};
+class linklist{
+	public static void main (string[] Args){
+		Node node1=new Node();
+		Node node2=new Node();
+		Node node3=new Node();
+		node1.data=1;
+		node2.data=2;
+		node3.data=3;
+		node1.next=node2;
+		node2.next=node3;
+		node3.next=null;
+		while (Node.next !=null){
+			System.out.println(Node.data);
+		}
+	}
+}

lis.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <cstdio>
+
+using namespace std;
+int lis[101];
+int arr[101];
+
+int findLIS (int *arr, int n){
+	int mx = 0;
+	for (int i = 0 ; i < n ; i++){
+		lis[i] = 1;
+	}
+	for (int i = 1 ; i < n ; i++){
+		for (int j = 0 ; j < i ; j++){
+			if (arr[j] < arr[i] && lis[i] < lis[j]+1)
+				lis[i] = lis[j] + 1;
+		}
+	}
+	for (int i = 0 ; i < n ; i++){
+		if(mx < lis[i])
+			mx = lis[i];
+	}
+	return mx;
+}
+
+int main()
+{
+	int arr[] = {29,22,25,33};
+	int ans = findLIS(arr,4);
+	cout<<"LIS = "<<ans<<endl;
+	return 0;
+}

matrixexp.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <cstdio>
+#include <vector>
+using namespace std;
+
+typedef vector <vector <int> > mat;
+mat mul(mat a , mat b){
+	mat c;
+	c.resize(2,vector<int>(2,0));
+	for (int i = 0 ; i < 2 ; i++){
+		for(int j = 0 ; j < 2 ; j++){
+			c[i][j] = 0;
+			for(int k = 0 ; k < 2 ; k++){
+				c[i][j] +=( a[i][k]*b[k][j]);
+			}
+		}
+	}
+	return c;
+}
+mat power(mat a , int k){
+	if(k == 1)
+		return a;
+	if(!(k%2))
+		return (mul(power(a,k/2) , power(a,k/2)));
+	if(k%2)
+		return (mul(power(a,k/2) , power(a,(k/2)+1)));
+}
+
+int main(){
+	mat M;
+	M.resize(2 , vector <int>(2,0) );
+	M[0][0] = 1; M[0][1] = 1;
+	M[1][0] = 1; M[1][1] = 0;
+	M = power(M,4);
+	int ans  = M[0][1];
+	cout<<"fib = "<<ans<<endl;
+	
+	return 0;
+}

maxsubsequence.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+#include <cstdio>
+#include <vector>
+
+using namespace std;
+int S[101];
+int main()
+{
+	S[0]=0;
+	int a[]={-2,-3,4,-1,-2,1,5,-3};
+	S[1]=a[0];
+	return 0;
+
+}

quickfind.cpp

@@ -0,0 +1,32 @@
+// Quick- Find 
+//Eager Approach
+
+include <iostream>
+
+using namespace std;
+int id[101];
+
+void init(int n){
+	for (int i = 0 ; i < n ; i++){
+		id[i] = i;
+	}
+}
+
+bool isconnected (int p , int q){
+	return (id[p] == id[q]);
+}
+
+void union (int p , int q){
+	int pid = id[p];
+	int qid = id[q];
+	for(int i = 0 i < n ; i++){
+		if(id[i] == pid)
+			id[i] = qid;
+	}
+}
+int main()
+{
+	init(10);
+	
+	return 0;
+}