Introfor

def swap_case(s): output = '' for char in s: if char.islower(): output += char.upper() continue output += char.lower() return output if __name__ == '__main__': s = input() result = swap_case(s) print(result) eASY

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 #!/bin/python3 import math import os import random import re import sys # Complete the sockMerchant function below. def sockMerchant(n, ar): res = 0 for i in set(ar): res += ar.count(i) // 2 return res if __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') n = int(input()) ar = list(map(int, input().rstrip..

12345678910def solution(): min = sum(list(map(int, input().split()))) man = sum(list(map(int, input().split()))) if min > man: return min elif min