From 08e26caf5b4978b3cb8484d3ddef4f9ea5da9f1e Mon Sep 17 00:00:00 2001
From: murtazattari <47269452+murtazattari@users.noreply.github.com>
Date: Wed, 29 Apr 2020 20:19:50 +0530
Subject: [PATCH 1/3] Create 17EGICS068 hash maps 2.cpp

---
 17EGICS068 hash maps 2.cpp | 56 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 17EGICS068 hash maps 2.cpp

diff --git a/17EGICS068 hash maps 2.cpp b/17EGICS068 hash maps 2.cpp
new file mode 100644
index 0000000..cb495fa
--- /dev/null
+++ b/17EGICS068 hash maps 2.cpp	
@@ -0,0 +1,56 @@
+#include<iostream>
+#include<set>
+#include<iterator>
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int tar,i,j,key,c=0; //used int variables
+	cout<<"enter size of the array required    ";
+	cin>>i; //taking size of the array
+	int *p = new int[i]; //dynamically allocating the array
+	cout<<"enter the array \n";
+	for(j=0;j<i;j++) //inputing the array
+	{ 
+	   cout<<"enter the "<<j+1<<"th element  ";
+		cin>>p[j];
+	}
+	cout<<"enter the targate value  ";
+	cin>>tar;
+	set<int> set1; //transferring the array to a set for unique elements
+	set<int>:: iterator itr; //iterator for keeping track of the set1 used
+	for(j=0;j<i;j++) //transferring the array elements to set1
+	{
+		set1.insert(p[j]);
+	}
+	for(j=0;j<i;j++) //checking if the element+1 in array is present in the set1 
+	{
+		key = tar-p[j];
+		if(set1.count(key)) //if found the element in set increasing the counter.
+		{
+			c++;
+		}
+	}
+	
+	cout<<"\n elements found are   ";
+	cout<<c/2; //printing the counter / output the value is divide by since it counts both ways .
+	cout<<"\nThe set1 is ";
+	for(itr = set1.begin();itr != set1.end();++itr)
+	{
+		cout<<"\t" <<*itr; //printing the set1 formed.
+	}	
+}
+
+
+
+
+
+/* Compilation results...
+--------
+- Errors: 0
+- Warnings: 0
+- Output Filename: C:\Users\murta\Desktop\cprog\17EGICS068_hash maps_2.exe
+- Output Size: 1.87123107910156 MiB
+- Compilation Time: 1.08s
+*/

From f12478e06a257f8373be8d7f5711f9f4bef3447f Mon Sep 17 00:00:00 2001
From: murtazattari <47269452+murtazattari@users.noreply.github.com>
Date: Wed, 29 Apr 2020 21:07:00 +0530
Subject: [PATCH 2/3] Update 17EGICS068 hash maps 2.cpp

---
 17EGICS068 hash maps 2.cpp | 22 +---------------------
 1 file changed, 1 insertion(+), 21 deletions(-)

diff --git a/17EGICS068 hash maps 2.cpp b/17EGICS068 hash maps 2.cpp
index cb495fa..ecc03bc 100644
--- a/17EGICS068 hash maps 2.cpp	
+++ b/17EGICS068 hash maps 2.cpp	
@@ -3,7 +3,6 @@
 #include<iterator>
 #include<bits/stdc++.h>
 using namespace std;
-
 int main()
 {
 	int tar,i,j,key,c=0; //used int variables
@@ -32,25 +31,6 @@ int main()
 			c++;
 		}
 	}
-	
 	cout<<"\n elements found are   ";
-	cout<<c/2; //printing the counter / output the value is divide by since it counts both ways .
-	cout<<"\nThe set1 is ";
-	for(itr = set1.begin();itr != set1.end();++itr)
-	{
-		cout<<"\t" <<*itr; //printing the set1 formed.
-	}	
+	cout<<c/2; //printing the counter / output the value is divide by since it counts both ways .	
 }
-
-
-
-
-
-/* Compilation results...
---------
-- Errors: 0
-- Warnings: 0
-- Output Filename: C:\Users\murta\Desktop\cprog\17EGICS068_hash maps_2.exe
-- Output Size: 1.87123107910156 MiB
-- Compilation Time: 1.08s
-*/

From 056117ceae14fde1b192ef4ba5f6bf84f87a2e73 Mon Sep 17 00:00:00 2001
From: murtazattari <47269452+murtazattari@users.noreply.github.com>
Date: Wed, 29 Apr 2020 21:08:17 +0530
Subject: [PATCH 3/3] Delete 17EGICS068 hash maps 2.cpp

---
 17EGICS068 hash maps 2.cpp | 36 ------------------------------------
 1 file changed, 36 deletions(-)
 delete mode 100644 17EGICS068 hash maps 2.cpp

diff --git a/17EGICS068 hash maps 2.cpp b/17EGICS068 hash maps 2.cpp
deleted file mode 100644
index ecc03bc..0000000
--- a/17EGICS068 hash maps 2.cpp	
+++ /dev/null
@@ -1,36 +0,0 @@
-#include<iostream>
-#include<set>
-#include<iterator>
-#include<bits/stdc++.h>
-using namespace std;
-int main()
-{
-	int tar,i,j,key,c=0; //used int variables
-	cout<<"enter size of the array required    ";
-	cin>>i; //taking size of the array
-	int *p = new int[i]; //dynamically allocating the array
-	cout<<"enter the array \n";
-	for(j=0;j<i;j++) //inputing the array
-	{ 
-	   cout<<"enter the "<<j+1<<"th element  ";
-		cin>>p[j];
-	}
-	cout<<"enter the targate value  ";
-	cin>>tar;
-	set<int> set1; //transferring the array to a set for unique elements
-	set<int>:: iterator itr; //iterator for keeping track of the set1 used
-	for(j=0;j<i;j++) //transferring the array elements to set1
-	{
-		set1.insert(p[j]);
-	}
-	for(j=0;j<i;j++) //checking if the element+1 in array is present in the set1 
-	{
-		key = tar-p[j];
-		if(set1.count(key)) //if found the element in set increasing the counter.
-		{
-			c++;
-		}
-	}
-	cout<<"\n elements found are   ";
-	cout<<c/2; //printing the counter / output the value is divide by since it counts both ways .	
-}