← Back to List

22016번: 巻物 (Scroll) ↗

Solutions

Python 3
160 B | 160 chars
n, k = map(int, input().split())
s = input()

ans = s[:k-1]
for i in range(k-1, n):
  ans += s[i].lower() if s[i].upper() == s[i] else s[i].upper()

print(ans)