Problem 2: Alphabets
Given a string, convert the small alphabets of the string to capital alphabets and vice-versa.
First line of input is number of testcases T.
Then T testcases follow. Each testcase consists of a string of length L.
For each testcase, output the required string in a new line.
Input string consists of letters A-Z and a-z only.
Sample Input :
3 a A aA
Sample Output :
A a Aa
C : Total number of non-whitespace characters
L : Number of loops (for, do, while)
I : Number of if, else, ternary(?), goto, switch
T = 10000/(C + 500*L + 300*I)
Submit your solution
You need to be logged in to submit a solution.
There is no discussion yet. Feel free to ask an question you might have regarding this problem
post a question