Open
Conversation
Collaborator
|
You have to submit the code in a file |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
#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++;
}
}
}
#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 .
}