Submission #4338338

---

Source Code Expand

#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return list(input())
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
mod = 1000000007

#A
"""
l = LI()
l.sort()
print(l[1])
"""

#B
s = S()
ans = [s[0]]
i = 1
k = s[0]
d = 1
while i < len(s):
    if s[i] == k:
        d += 1
    else:
        ans.append(d)
        k = s[i]
        d = 1
        ans.append(k)
    i += 1
ans.append(d)
for i in range(len(ans)-1):
    print(ans[i],end = "")
print(ans[-1])
#C
"""
n = II()
a = LI()
for i in range(n):
    while not a[i] % 2:
        a[i] //= 2
a = list(set(a))
print(len(a))
"""

#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission Info

Judge Result