added cycle detection

Author: kothariji

Data Structures and Algorithms/Graph/007. Cycle Detection In Graph Using DFS.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX  100005
+using namespace std;
+
+vector <int> v1[MAX];
+bool visisted[MAX];
+bool cycle = false;
+
+bool DFS(int i, int parent)
+{
+	if(visisted[i] == false)
+	{
+		visisted[i] = true;
+		for(int j = 0; j<v1[i].size(); j++)
+			if(v1[i][j] != parent)
+				DFS(v1[i][j], i);
+	}
+	else
+	{
+		cycle = true;
+	}
+}
+
+int main()
+{
+	int v, e, x, y;
+	cout<<"Enter the number of vertex: ";
+	cin>>v;
+	cout<<"Enter the number of edges: ";
+	cin>>e;
+
+	for(int i = 0; i<e; i++)
+	{
+		cout<<"Enter both the vertex of the edge "<<i+1<<": ";
+		cin>>x>>y;
+		v1[x].push_back(y);
+		v1[y].push_back(x);
+	}
+
+	DFS(1, 0);
+
+	if(cycle)
+		cout<<"cycle exists in graph";
+	else
+		cout<<"cycle does not exists in graph";
+
+}

Data Structures and Algorithms/Graph/007. Cycle Detection In Graph Using DFS.exe

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX  2005
+using namespace std;
+
+
+
+int main()
+{
+	int n , k,h;
+	cin>>n>>k;
+	lli wid = 0;
+	while(n--)
+	{
+		cin>>h;
+		wid += (h > k) ? 2 : 1;
+	}
+	cout<<wid;
+}

Data Structures and Algorithms/Graph/007. Cycle Detection In Graph Using DFS.o

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX  2005
+using namespace std;
+
+
+
+int main()
+{
+	int n,A = 0,D= 0;
+	string s;
+	cin>>n>>s;
+	for(auto c: s)
+		if(c == 'A') A++;
+		else D++;
+	if(A > D)
+		cout<<"Anton";
+	else if(D > A)
+		cout<<"Danik";
+	else 
+		cout<<"Friendship";
+
+}

training-sheet/A/001. Vanya and Fence.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX  2005
+using namespace std;
+
+
+
+int main()
+{
+	int a, b;
+	cin>>a>>b;
+	int yrs = 0;
+	while(a <= b)
+		a = a*3, b = b*2, yrs++;
+	cout<<yrs;
+
+}

training-sheet/A/002. Anton and Danik.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX  2005
+using namespace std;
+
+
+
+int main()
+{
+	int n,x,y,z, count = 0;
+	cin>>n;
+	while(n--)
+	{
+		cin>>x>>y>>z;
+		if((x+y+z) > 1) count++;
+	}
+	cout<<count;
+
+}