Submission #62764554

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from collections import deque
from collections import defaultdict
from itertools import combinations
from itertools import permutations
from heapq import heappush, heappop
from sortedcontainers import SortedSet
from bisect import bisect_left, bisect_right
import math
import sys
sys.setrecursionlimit(10 ** 9)
#0-9までの整数リスト
nunber_list = [n for n in range(0,10,1)]
def nibutan(l,v,left=0,right=0):
    right = len(l)-1
    while left <= right:
        mid = (left + right)//2
        if l[mid] == v: return True
        elif l[mid] < v: left = mid + 1
        else: right = mid -1
    return False
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from collections import deque
from collections import defaultdict
from itertools import combinations
from itertools import permutations
from heapq import heappush, heappop
from sortedcontainers import SortedSet
from bisect import bisect_left, bisect_right
import math
import sys
sys.setrecursionlimit(10 ** 9)
#0-9までの整数リスト
nunber_list = [n for n in range(0,10,1)]

def nibutan(l,v,left=0,right=0):
    right = len(l)-1
    while left <= right:
        mid = (left + right)//2
        if l[mid] == v: return True
        elif l[mid] < v: left = mid + 1
        else: right = mid -1
    return False

d = defaultdict(list) 
#n, t = map(int, input().split())
S = input()
#X = list(map(int, input().split()))
c = 0
for i in range(len(S)):
    if S[i] != "A":
        continue
    for k in range(i+1,len(S),1):
        if S[k] != "B":
            continue
        for t in range(k+1,len(S),1):
            if S[t] != "C":
                continue
            if t-k == k-i:
                c+=1
print(c)

Submission Info

Judge Result