Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Your little brother, Alice, is very fond of playing with integers. One day, Alice was given a list of N integers by his school teacher. Now, your brother wants to play a game with you. Alice will give you an integer, S. You have to find if it is possible to find two values from the list (at distinct positions) whose sum is equal to S. Now you are feeling very tired. So you decided to write a code, so that it can give you the answer very quickly. 1) Can you write an 0 (n²) Solution to solve the problem? 2) Come up with an O(n) or (plogn) solution

Your little brother, Alice, is very fond of playing with integers. One day, Alice was given a list of N integers by his school teacher. Now, your brother wants to play a game with you. Alice will give you an integer, S. You have to find if it is possible to find two values from the list (at distinct positions) whose sum is equal to S. Now you are feeling very tired. So you decided to write a code, so that it can give you the answer very quickly. 1) Can you write an 0 (n²) Solution to solve the problem? 2) Come up with an O(n) or (plogn) solution

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

try to solve using python 

Your little brother, Alice, is very fond of playing with integers. One day, Alice was given a list of N integers by his school teacher. Now, your brother wants to play a game with you. Alice will give you an integer, S. You have to find if it is possible to find two values from the list (at distinct positions) whose sum is equal to S. Now you are feeling very tired. So you decided to write a code, so that it can give you the answer very quickly. 1) Can you write an 0 (n²) Solution to solve the problem? 2) Come up with an O(n) or 0 (nlogn) solution. Input The first line contains two integers N and S ( 1 <= N <= 10% 1 <= S <= 10), denoting the length of the list, and the target Sum. In the next line, there will be N integers a, a, ........... ay (1 ≤ a ≤ 10%) separated by space. Output Print two integers: the positions of the values [1 based indexing]. If there are several solutions, you may print any of them. If there are no solutions, print "IMPOSSIBLE". Sample Input 1 4 10 37 15 Sample Input 2 6 18 9 10 1 5 9 8 Sample Input 3 4 7 2 4 6 8 Sample Input 4 3 12 6 12 Sample Output 1 1 2 Sample Output 2 15 [2 6 is also a valid answer] [print only one output] Sample Output 3. IMPOSSIBLE Sample Output 4. IMPOSSIBLE
Transcribed Image Text:Your little brother, Alice, is very fond of playing with integers. One day, Alice was given a list of N integers by his school teacher. Now, your brother wants to play a game with you. Alice will give you an integer, S. You have to find if it is possible to find two values from the list (at distinct positions) whose sum is equal to S. Now you are feeling very tired. So you decided to write a code, so that it can give you the answer very quickly. 1) Can you write an 0 (n²) Solution to solve the problem? 2) Come up with an O(n) or 0 (nlogn) solution. Input The first line contains two integers N and S ( 1 <= N <= 10% 1 <= S <= 10), denoting the length of the list, and the target Sum. In the next line, there will be N integers a, a, ........... ay (1 ≤ a ≤ 10%) separated by space. Output Print two integers: the positions of the values [1 based indexing]. If there are several solutions, you may print any of them. If there are no solutions, print "IMPOSSIBLE". Sample Input 1 4 10 37 15 Sample Input 2 6 18 9 10 1 5 9 8 Sample Input 3 4 7 2 4 6 8 Sample Input 4 3 12 6 12 Sample Output 1 1 2 Sample Output 2 15 [2 6 is also a valid answer] [print only one output] Sample Output 3. IMPOSSIBLE Sample Output 4. IMPOSSIBLE
Expert Solution
steps

Step by step

Solved in 9 steps with 9 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS