LearnToCP
Sign in
Navigation
HomeRoadmapAbout UsProblems
Theory
Basics
Data types and IOC++ syntaxModuloVectorsMatricesTime Complexity
Sorting
SortingCounting sort
Optimization Techniques I
Two PointersSum of numbers 1 to nPrefix sumBinary Search
Binary Numbers
Binary NumbersNumbers in codeBitwise Operations
Math
Binary Exponentiation
#100%#FREE

LearnToCP

// Learn To Competitively Program

Map

Roadmap

A topic graph that tracks your progress node by node.

Solve

Problems

A curated, difficulty-tagged practice set to grind.

Accepted
Solution.cppCopy
1#include <bits/stdc++.h>
2using namespace std;
3 
4int main() {
5 int n, k;
6 cin >> n >> k;
7 
8 vector<int> a(n);
9 for (int& x : a) cin >> x;
10 
11 unordered_set<int> seen;
12 for (int x : a) {
13 if (seen.count(k - x)) {
14 cout << "Accepted\n";
15 return 0;
16 }
17 seen.insert(x);
18 }
19 cout << "Keep going\n";
20}