PIHU1 - Love Story 1
Rancho is in love with Pihu. So on the Valentine’s Day they decided to spend time together at Assi Ghat, but Rancho, as we all know is very busy with his work, so he failed. It was now Pihu’s turn to go mad with anger. But there’s something which you can do.
Rancho tells Pihu that he is a novice programmer and is generally busy in solving problems at spoj. So Pihu decides to check his algorithmic skills. She puts forward an array of N integers. She gives him a number P and asks if he can find three (strictly three) integers Ai Aj Ak ( i ≠ j ≠ k ) in the array, whose sum is equal to number P, i.e.
Ai + Aj + Ak =P.
Now, sooner Rancho answers her query in YES or NO, sooner he gets a kiss.
The first line of input consists of an integer T, number of test cases.
The second line of input consists of an integer N, denoting the size of array.
The third line consists of N integers A1, A2 A3 ……………. AN , separated with space .
The fourth line consists of number P.
3<= N <= 1000
1<= Ai <= 10^9 where 1<= i <=N
1<= P <= 3*10^9
If you find three numbers Ai ,Aj ,Ak , ( i ≠ j ≠ k ) in the array such that Ai + Aj + Ak =P, print “YES” else print “NO” ( quotes for clarification only).
1 2 3
After helping Rancho, would you like to help Pihu? . Try PIHU2
good problem think cool
simple two pointer technique...
unsigned long long + O(nlogn + n^2logn) = AC :D :D
sort + TwoPointers Accepted....
think simple....use long long .....int gives wa
Kindly check the input cases. Is there any value which is out of bound?
O(nlogn+n^2logn) works :)
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32-GCC ASM64 MAWK BC C-CLANG CPP14-CLANG CPP14 COBOL COFFEE D-DMD D-CLANG DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET|
|Resource:||My own problem|