Ice Cream Parlor
Problem Statement :
Two friends like to pool their money and go to the ice cream parlor. They always choose two distinct flavors and they spend all of their money. Given a list of prices for the flavors of ice cream, select the two that will cost all of the money they have. Example. The two flavors that cost and meet the criteria. Using -based indexing, they are at indices and . Function Description Complete the icecreamParlor function in the editor below. icecreamParlor has the following parameter(s): int m: the amount of money they have to spend int cost[n]: the cost of each flavor of ice cream Returns int[2]: the indices of the prices of the two flavors they buy, sorted ascending Input Format The first line contains an integer, , the number of trips to the ice cream parlor. The next sets of lines each describe a visit. Each trip is described as follows: The integer , the amount of money they have pooled. The integer , the number of flavors offered at the time. space-separated integers denoting the cost of each flavor: . Note: The index within the cost array represents the flavor of the ice cream purchased.
Solution :
Solution in C :
In C++ :
#include <vector> // headers {{{
#include <list>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <ctime>
using namespace std; // }}}
int main()
{
//time_t start, end;
//time(&start);
//ifstream cin("test.in");
//ofstream cout("test.out");
//fcout.precision(6);
//fcout.setf(ios::fixed,ios::floatfield);
int T;
cin >> T;
for (int i = 0; i < T; ++i) {
int C, L;
cin >> C >> L;
vector<int> v(L);
map<int, int> M;
for (int j = 0; j < L; ++j)
cin >> v[j];
for (int j = 0; j < L; ++j) {
int diff = C - v[j];
if (M.count(diff)) {
cout << 1 + M[diff] << " " << 1 + j << endl;
break;
}
M[v[j]] = j;
}
}
//time(&end);
//cout << difftime(end, start) << endl;
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int k = 0; k < n; k++){
int C = sc.nextInt();
int P = sc.nextInt();
int [] p = new int[P+1];
for(int i = 1; i <= P;i++)p[i] = sc.nextInt();
for(int i = 1; i <= P; i++){
for(int j = i+1; j <= P; j++){
if(p[i]+p[j] == C){
System.out.println(i + " " + j);
break;
}
}
}
}
sc.close();
}
}
In C :
#include<stdio.h>
int main()
{
int t,c,l,i,j,arr[20000];
for(scanf("%d",&t);t>0;t--)
{
scanf("%d%d",&c,&l);
for(i=0;i<l;i++)
scanf("%d",&arr[i]);
for(i=0;i<l-1;i++)
for(j=i+1;j<l;j++)
{
if(arr[i]+arr[j]==c)
printf("%d %d\n",i+1,j+1);
}
}
return 0;
}
In Python3 :
def main():
# Loop through for each test.
for _ in range(int(input())):
dollars = int(input())
numFlavors = int(input())
flavors = [int(i) for i in input().split()]
# Determine the correct indexes.
index1, index2 = -1, -1
for i in range(numFlavors):
for j in range(numFlavors):
if (i != j) and (flavors[i] + flavors[j] == dollars):
index1 = i + 1
index2 = j + 1
break
if index1 != -1 and index2 != -1:
break
# Print the answer.
print(str(index1) + " " + str(index2))
if __name__ == "__main__":
main()
View More Similar Problems
Binary Search Tree : Insertion
You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <
View Solution →Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →