STRHH - Half of the half
Given a sequence of 2*k characters, please print every second character from the first half of the sequence. Start printing with the first character.
Input
In the first line of input you are given the positive integer t (1<=t<=100) - the number of test cases. In the each of the next t lines, you are given a sequence of 2*k (1<=k<=100) characters.
Output
For each of the test cases please please print every second character from the first half of a given sequence (the first character should appear).
Example
Input: 4 your progress is noticeable Output: y po i ntc
hide comments
|
stexro:
2015-11-29 04:46:39
Nice Queston Last edit: 2015-11-29 04:47:07 |
|
whitehood15:
2015-11-22 14:13:21
works when i compile it on my linux box but get SEGMENTATION ERROR when i submit |
|
sanyameep:
2015-11-14 12:20:05
SEGMENTATION ERROR?
|
|
pranshuchester:
2015-11-04 18:49:24
What can be the possible errors if my code is not accepted by SPOJ but is working for every case in my compiler?
|
|
biradargourish:
2015-10-25 09:28:01
my code is working fine on ideone.com but, SPOJ gives a segmentation error. Should i stop using an array to solve this problem |
|
bhargav431997:
2015-10-25 08:03:59
15462138 :- what is problem in this?? exactly O(n) complexity |
|
rudraraj_123:
2015-10-21 17:03:12
have anybody done this program in java |
|
erzhanzakirov:
2015-10-21 10:27:29
WTF? |
|
gayu_p7:
2015-10-19 06:49:38
my program is not giving any runtime error .But it is showing wrong answer.I have clicked on it and both the testcases are accepted.But hiddedn data is showing error .What dies that mean?Plz someone hlp me out. |
|
wseymour:
2015-10-19 02:55:11
Has anyone been able to successfully complete this one in C? |
Added by: | kuszi |
Date: | 2012-09-01 |
Time limit: | 1s-1.289s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |