• Loading...

Problem 2: Alphabets

Given a string, convert the small alphabets of the string to capital alphabets and vice-versa.


Input :

First line of input is number of testcases T.
Then T testcases follow. Each testcase consists of a string of length L.


Output :

For each testcase, output the required string in a new line.


Constraints :

T<15
L<30
Input string consists of letters A-Z and a-z only.


Sample Input :

3
a
A
aA

Sample Output :

A
a
Aa

Score :

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.

discussions


There is no discussion yet. Feel free to ask an question you might have regarding this problem


post a question

Loading...

Trial 1
Trial 2
Trial 3
Trial 4
Submissions
Multipurpose
1000 pt
You are not logged in
0 / 170

Datatype
1000 pt
You are not logged in
0 / 308

No Bitwise
1000 pt
You are not logged in
0 / 78

Cuboid
1000 pt
You are not logged in
0 / 166

Evaluate the function
1000 pt
You are not logged in
0 / 94

Largest in the set
1000 pt
You are not logged in
0 / 69

2 to N
1000 pt
You are not logged in
0 / 144