JH1 - Size Contest!!!Reloaded!!
After seeing the popularity of the question size contest, Aradhya thought of adding its new version.
The problem statement is really simple. You are given 'n' and and then next n lines contain 'n' numbers.You have to calculate p and q.
'p' is the sum of numbers at even places ,but we add them only if they are positive.
'q' is the sum of numbers at odd places,but we add them only when they are negative.
Then you need to find the absolute value of p and q.
If p is greater than q or equal to q,then print "Some Mirrors Lie!". ( without quotes )
If q is greater than p, then print "Every Girl Lies!" ( without quotes )
Input
First line contains a integer t=number of test cases.
Then each test case contains a number n. and next line conatin 'n' numbers separated by a space.
1<=n<=100
and the numbers are less than 10^18
Output
A single line for each test case as described above.
Example
Input: 1
5
-1 2 -3 5 -4
Output:
Every Girl Lies!
Mind you--->The less your fingers work .The more you GAIN!!!
Note -- > Source Limit is made a little strict !!.. So chill out !!
hide comments
Mosa Osama:
2013-11-11 14:54:45
:| Last edit: 2012-09-24 23:27:36 |
|
Mostafa 36a2:
2013-11-11 14:54:45
TLE !!!!!!!!!
|
|
Ravi Kumar:
2013-11-11 14:54:45
difficult in python...i can reduce upto 330 bytes |
|
Bijoy Prakash:
2013-11-11 14:54:45
This seems so straightforward.
|
|
Priyank:
2013-11-11 14:54:45
my code is of 234 bytes...still showing "too long" for my code
|
|
J:
2013-11-11 14:54:45
my code is 245bytes..still not letting me submit as my solution is 'too long'
|
|
Aradhya:
2013-11-11 14:54:45
@numerix sir:: Sir now it is really a tough one :) Thanks sir :)
|
|
numerix:
2013-11-11 14:54:45
This problem shouldn't stay in challenge section. It is a really stupid problem. Just do what the description says and get your points. It should be moved to tutorial/partial section. If it stays here, at least the source limit should be stricter. 300 Bytes is ridiculous. According to the AC submissions 160 Bytes would be a good limit.
|
|
Meryovi:
2013-11-11 14:54:45
Doesn't seem possible in C# |
|
Aditya Pandey:
2013-11-11 14:54:45
@ loser plz check my soln. id: 7233381 m getting wa again and again :(
|
Added by: | Aradhya |
Date: | 2012-06-29 |
Time limit: | 1s |
Source limit: | 250B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own Problem |