PL - Palindrome Lover
Asad is a 10 years old boy. He loves to learn new logic from computer science. Palindrome is an interesting topic to him. So, He starts practicing to finding palindrome in his everyday life.
A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. such as – madam, 0001000 etc.
He faces a problem and asks for your help. You are a great programmer in our country.Now, you have given a string S . You have to do a permutation of string S through many times (can be 0 times) such that you will get a palindromic string P . You have to check whether it is possible to form a palindrome after any permutation or not.
Input
Every line of the input contains a single string S.
Constraints:
- S will consist only of lowercase English letters (i.e. characters 'a' through 'z').
- 1 ≤ |S| ≤ 105
Output
For each test case, print a single line. Print 1, if it is possible to find at least one valid permutation P of string S which is a palindrome. Otherwise print -1.
Example
Input: abc abab Output: -1 1
Note:
In, Case 2: ‘baab’ is a valid permutations of string ‘abab’ which is also a palindrome. So output will be 1.
hide comments
asad:
2018-06-24 01:30:31
There is technical problem in the output file .Let me correct.Sorry ! |
|
asad:
2018-06-23 22:52:48
thanks
|
|
wisfaq:
2018-06-23 22:28:11
Consult the tutorial for problem setters: https://www.spoj.com/tutorials/PS/ |
|
asad:
2018-06-23 22:17:07
I failed to find the enabled the problem. can you suggest me? |
|
wisfaq:
2018-06-23 21:58:22
Please enable the problem |
Added by: | asad_IT |
Date: | 2018-06-23 |
Time limit: | 0.5s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | String |