Submission #6923430

Source Code Expand

s = input()
n = len(s)
cnt = 1
L = []
for i in range(n-1):
  if s[i] == s[i+1]:
    cnt += 1
  else:
    L += [s[i]]
    L += [str(cnt)]
    cnt = 1
if s[n-2] == s[n-1]:
  a = int(L[-1])+1
  L[-1] = str(a)
else:
  L += [s[n-1]]
  L += ["1"]
 
print(''.join(L))

Submission Info

Submission Time
Task B - 高橋くんと文字列圧縮
User jammq123
Language Python (3.4.3)
Score 0
Code Size 298 Byte
Status RE
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 13
WA × 17
RE × 3
Set Name Test Cases
Sample subtask0_1.txt, subtask0_2.txt, subtask0_3.txt
All 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt
Case Name Status Exec Time Memory
0.txt AC 18 ms 3064 KB
1.txt AC 18 ms 3064 KB
10.txt WA 17 ms 3060 KB
11.txt WA 17 ms 3064 KB
12.txt WA 17 ms 3064 KB
13.txt WA 17 ms 3064 KB
14.txt WA 17 ms 3060 KB
15.txt WA 17 ms 3064 KB
16.txt WA 17 ms 3060 KB
17.txt WA 17 ms 3064 KB
18.txt WA 17 ms 3064 KB
19.txt WA 17 ms 3060 KB
2.txt AC 18 ms 3064 KB
20.txt WA 17 ms 3064 KB
21.txt WA 17 ms 3064 KB
22.txt WA 17 ms 3064 KB
23.txt RE 18 ms 3064 KB
24.txt WA 17 ms 3060 KB
25.txt WA 17 ms 3064 KB
26.txt RE 17 ms 3064 KB
27.txt RE 18 ms 3060 KB
28.txt WA 17 ms 3064 KB
29.txt WA 17 ms 3064 KB
3.txt AC 18 ms 3060 KB
4.txt AC 18 ms 3064 KB
5.txt AC 18 ms 3064 KB
6.txt AC 18 ms 3060 KB
7.txt AC 18 ms 3060 KB
8.txt AC 18 ms 3064 KB
9.txt AC 18 ms 3064 KB
subtask0_1.txt AC 17 ms 3064 KB
subtask0_2.txt AC 17 ms 3060 KB
subtask0_3.txt AC 17 ms 3064 KB