Cod sursa(job #2394249)
Utilizator | Data | 1 aprilie 2019 14:24:07 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector < int > V;
int N;
int main()
{
cin>>N;
for (int i=1; i<=N; i++)
{
int x;
cin>>x;
V.push_back(x);
}
for (int i=0; i<V.size(); i++)
cout<<V[i]<<" ";
cout<<"\n";
int k;
cin>>k;
cout<<(find(V.begin(),V.end(),k)!=V.end())<<"\n";
}