Submission #72574735

---

Source Code Expand

import sys,bisect
from heapq import heappop, heappush
from collections import deque, Counter, defaultdict
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

N = ii()
S = list(input())
ans = 0
for i in range(N):
    for j in range(i+1, N):
        for k in range(j+1,N):
            if S[i]=="E" and S[j]=="G" and S[k]=="F":ans+=1
print(ans)

Submission Info

Judge Result