Skip to content

Conversation

@murtazattari
Copy link
Contributor

@murtazattari murtazattari commented Apr 29, 2020

#include
#include
#include
#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 set1; //transferring the array to a set for unique elements
set:: 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.
}	

}
#include
#include
#include
#include<bits/stdc++.h>
using namespace std;

int main()
{
int 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];
}
set set1; //transferring the array to a set for unique elements
set:: 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 = p[j]+1;
if(set1.count(key)) //if found the element in set increasing the counter.
{
c++;
}
}
cout<<"\n elements found are ";
cout<<c; //printing the counter / output the value is divide by since it counts both ways .
}

@murtazattari murtazattari changed the title Create 17EGICS068 hash maps 2.cpp Create 17EGICS068 hash maps 2 Apr 29, 2020
@murtazattari murtazattari reopened this Apr 29, 2020
@murtazattari murtazattari changed the title Create 17EGICS068 hash maps 2 updated 17EGICS068 hash maps 2 Apr 29, 2020
@rhythmbhiwani
Copy link
Collaborator

You have to submit the code in a file

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants