Problem
You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you would like to buy two items that add up to the entire value of the credit. The solution you provide will consist of the two integers indicating the positions of the items in your list (smaller number first).
Input
The first line of input gives the number of cases, N. N test cases follow. For each test case there will be:
- One line containing the value C, the amount of credit you have at the store.
- One line containing the value I, the number of items in the store.
- One line containing a space separated list of I integers. Each integer P indicates the price of an item in the store.
- Each test case will have exactly one solution.
Output
For each test case, output one line containing “Case #x: ” followed by the indices of the two items whose price adds up to the store credit. The lower index should be output first.
Limits
5 ≤ C ≤ 1000
1 ≤ P ≤ 1000
Small dataset
N = 10
3 ≤ I ≤ 100
Large dataset
N = 50
3 ≤ I ≤ 2000
Sample
| Input | Output |
3 |
Case #1: 2 3 |
C++ Solution:
/*
Author : Sreejith Sreekantan
Description : https://code.google.com/codejam/contest/351101/dashboard#s=p0
*/
#include
#include
#include
#include
using namespace std;
int main(int argc, char const *argv[])
{
int numOfTestInstances;
cin >> numOfTestInstances;
std::vector itemWeight;
for (int testInstanceNum = 0; testInstanceNum < numOfTestInstances; ++testInstanceNum)
{
int limit;
cin >> limit;
int numOfItems;
cin >> numOfItems;
itemWeight.clear();
itemWeight.reserve(numOfItems);
for (int itemNum = 0; itemNum < numOfItems; ++itemNum)
{
cin >> itemWeight[itemNum];
}
cout << "Case #" << testInstanceNum + 1 << ": ";
for (int i = 0; i < numOfItems; ++i)
{
for (int j = i + 1; j < numOfItems; ++j)
{
if (itemWeight[i] > limit)
{
break;
}
if (itemWeight[j] > limit)
{
continue;
}
if (itemWeight[i] + itemWeight[j] == limit)
{
if (i < j)
{
cout << i + 1 << " " << j + 1 << endl;
}
else
{
cout << j + 1 << " " << i + 1 << endl;
}
}
}
}
}
return 0;
}
Python Solution:
#! /usr/bin/python numOfInstances = int(raw_input()) for x in xrange(1,numOfInstances+1): limit = int(raw_input()) numOfItems = int(raw_input()) d = dict() items = [int(x) for x in raw_input().split()] for y in xrange(1,numOfItems+1): if items[y-1] not in d: d[items[y-1]] = set() d[items[y-1]].add(y) print d for x in d.keys(): if x <= limit: index = d[x].pop() if (limit-x) in d and len(d[limit-x])>0: index2=d[limit-x].pop() d[limit-x].add(index2) print min(index, index2), max(index, index2) d[x].add(index)
b 
385 = 2640.
WikiSree 