Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with k-sum
Search options not deleted
user 219151
Given a set of numbers, a target sum, and some k, the problem of finding a subset of size k that has the target sum
2
votes
2
answers
401
views
2-sum problem in C++
I'm a beginner at C++; all my previous programming experience is mainly through PLCs in industrial maintenance.
I have to accept 10 integers and a target value, then print all the pairs that sum to th …
- 11.3k