problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p02812 | u089644470 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = list(input())\n\nA_index = [i for i, x in enumerate(s) if x == 'A']\nprint(A_index)\n\ncount = 0\nfor j in A_index :\n print(j)\n if j != n-2 :\n if s[j+1] == 'B' :\n if s[j+2] == 'C' :\n count += 1\n\nprint(count)", "n = int(input())\ns = list(input())\n\nA_index = [i for i, x in enumerate(s) if x == 'A']\nprint(A_index)\n\ncount = 0\nfor j in A_index :\n print(j)\n if j != n-1 :\n if s[j+1] == 'B' :\n if s[j+2] == 'C' :\n count += 1\n\nprint(count)", "n = int(input())\ns = list(input())\n\nA_index = [i for i, x in enumerate(s) if x == 'A']\n\ncount = 0\nfor j in A_index :\n if j != n-1 and s[j+1] == 'B' :\n if j != n-2 and s[j+2] == 'C' :\n count += 1\n\nprint(count)\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s061710726', 's679941800', 's441151502'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [239, 239, 218] |
p02812 | u091217940 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N=int(input())\nS=input()\nS.count('ABC')", "N=int(input())\nS=input()\nn=S.count('ABC')\nprint(n)"] | ['Wrong Answer', 'Accepted'] | ['s187471353', 's258939555'] | [9036.0, 9084.0] | [26.0, 29.0] | [39, 50] |
p02812 | u098510720 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\nans = 0\nfor i in range(n - 2):\n if s[i:i + 3] == "ABC":\n ++ans\nprint(ans)\n', 's = input()\nans = 0\nfor i in range(n - 2):\n if s[i:i + 3] == "ABC":\n ++ans\nprint(ans)', 'n = int(input())\ns = input()\nans = 0\nfor i in range(n - 2):\n if s[i : i + 3] == "ABC":\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s138222344', 's483477707', 's978186803'] | [3316.0, 2940.0, 2940.0] | [21.0, 17.0, 17.0] | [107, 89, 112] |
p02812 | u106778233 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N=int(input())\nS=input()\nans=0\nfor i in range(N-2):\n if S[i:i+3]=='abc' :\n ans+=1\nprint(ans)", "N=int(input())\nS=input()\nans=0\nfor i in range(N-2):\n if S[i:i+3]=='ABC' :\n ans+=1\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s600621626', 's110667983'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 102] |
p02812 | u109133010 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N=int(input())\ns=input()\ncnt=0\nfor i in range(0,N-3):\n if s[i]+s[i+1]+s[i+2]=="abc":\n cnt+=1\nprint(cnt)', 'N=int(input())\ns=input()\ncnt=0\nfor i in range(0,N-2):\n if s[i]+s[i+1]+s[i+2]=="ABC":\n cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s705227201', 's944517737'] | [2940.0, 2940.0] | [17.0, 17.0] | [107, 107] |
p02812 | u112364985 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['S=input()\nprint(S.count("ABC"))', 'n=int(input())\ns=input()\nprint(s.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s821062748', 's151524341'] | [2940.0, 8976.0] | [17.0, 27.0] | [31, 46] |
p02812 | u116767113 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\n\na = s.replace('ABC','1')\n\nb = n - len(a)\n\nprint(b/2)\n", "n = int(input())\ns = input()\n\na = s.count('ABC')\n\nprint(a)"] | ['Wrong Answer', 'Accepted'] | ['s983278130', 's740597480'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 58] |
p02812 | u121523434 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\n\nif "ABC" in s:\n print(s.count("ABC")\nelse:\n print(0)', 'n = int(input())\ns = str(input())\n\nif "ABC" in s:\n print(s.count("ABC"))\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s447677002', 's279612976'] | [2940.0, 3064.0] | [17.0, 17.0] | [84, 94] |
p02812 | u123745130 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['l=input()\ncnt=0\nfor i in range(len(l)-2):\n if l[i]+l[i+1]+l[i+2]=="ABC":\n cnt+=1\nprint(cnt)', ' n=int(input())\nl=input()\ncnt=0\nfor i in range(n-3):\n if l[i:i+3]=="ABC":\n cnt+=1\nprint(cnt)', 'n=int(input())\nl=input()\ncnt=0\nfor i in range(n-2):\n if l[i]+l[i+1]+l[i+2]=="ABC":\n cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s334995060', 's916891421', 's894027492'] | [8980.0, 2940.0, 9088.0] | [27.0, 17.0, 28.0] | [101, 96, 111] |
p02812 | u127499732 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=str(input())\nfor _ in range(n-1):\n s = s + str(input())\nn=s.count("ABC")\nprint(n)', 'n=int(input())\ns=str(input())\nprint(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s027386698', 's071618726'] | [2940.0, 2940.0] | [17.0, 17.0] | [99, 51] |
p02812 | u130900604 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=input()\nans=s.cpount("ABC")\nprint(ans)', 'n=int(input())\ns=input()\nans=0\nfor i,j,k in zip(s[0:],s[1:],s[2:]):\n if (i,j,k)==("A","B","C"):\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s620576670', 's257318173'] | [2940.0, 3060.0] | [17.0, 18.0] | [55, 118] |
p02812 | u131666536 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\n \nans = 0\nfor i in range(n-2):\n if s[i:i+2] == 'ABC':\n ans += 1\n \nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\nfor i in range(n):\n if s[i:i+2] == 'ABC':\n ans += 1\n\nprint(ans)", "n = int(input())\ns = input()\n \nans = 0\nfor i in range(n - 2):\n if s[i:i+3] == 'ABC':\n ans += 1\n\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s523717285', 's766538527', 's730916793'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [115, 111, 116] |
p02812 | u131881594 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=input()\ncnt=0\nfor i in range(n-3+1):\n if s[i:i+4]=="ABC": cnt+=1\nprint(cnt)', 'n=int(input())\ns=input()\ncnt=0\nfor i in range(n-3+1):\n if s[i:i+3]=="ABC": cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s353337056', 's775809274'] | [9020.0, 9164.0] | [27.0, 31.0] | [95, 95] |
p02812 | u133134242 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = list(input())\nans = 0\nfor i in range(n-2):\n if a[i]=='A' and a[i+1]=='B' and a[i+2]=='C':\n ans+=1\nprint(ans)", "n = int(input())\na = list(input())\nans = 0\nfor i in range(n-2):\n if a[i]=='A' and a[i+1]=='B' and a[i+2]=='C':\n ans+=1\nprint(ans)"] | ['Runtime Error', 'Accepted'] | ['s566578584', 's335739034'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 133] |
p02812 | u140602852 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = input()\nS = input("Enter String")\ncount = 0\nfor i in range(1, int(N)-1):\n if S[i-1]+S[i]+S[i+1] == "ABC":\n count += 1\nprint(count)', 'N = input()\nS = input()\ncount = 0\nif(int(N)>=3 and int(N)<=50):\n for i in range(1, int(N)-1):\n if S[i-1]+S[i]+S[i+1] == "ABC":\n count += 1\n print(count)'] | ['Wrong Answer', 'Accepted'] | ['s161032179', 's093661273'] | [3060.0, 2940.0] | [17.0, 18.0] | [144, 176] |
p02812 | u143903328 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['33\nABCCABCBABCCABACBCBBABCBCBCBCABCB', "N = int(input())\nS = input()\nans = 0\nfor i in range(N-2):\n if S[i:i+3] == 'ABC':\n ans += 1 \nprint(ans)\n\n"] | ['Runtime Error', 'Accepted'] | ['s586508324', 's832971044'] | [2940.0, 2940.0] | [18.0, 17.0] | [36, 113] |
p02812 | u148551245 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['s = input()\nans = s.count("ABC")\nprint(ans)', 'n = int(input())\ns = input()\nans = s.count("ABC")\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s192039811', 's747024067'] | [3060.0, 2940.0] | [19.0, 18.0] | [43, 60] |
p02812 | u152402277 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nword = list(input())\ncount = 0\nfor i in range(N-2):\n if word[i]=A and word[i+1]=B and word[i+2]=C:\n count += 1\n \nprint(count)', 'N = int(input())\nword = list(input())\ncount = 0\nfor i in range(N - 2):\n if word[i]=="A" and word[i+1]=="B" and word[i+2]=="C":\n count += 1\n\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s647178301', 's780650414'] | [2940.0, 3060.0] | [17.0, 17.0] | [149, 162] |
p02812 | u153259685 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=input()\ncount=0\nfor i in range(len(n)-2):\n if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n count+=1\nprint(count)', 'n=int(input())\ns=input()\ncount=0\nfor i in range(len(n)-3):\n if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n count+=1\nprint(count)', 'n=int(input())\ns=input()\ncount=0\nfor i in range(n-2):\n if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n count+=1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s635218321', 's825008851', 's087733324'] | [3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [132, 132, 127] |
p02812 | u161485415 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["s = input()\nprint(s.count('ABC'))", "input()\ns = input()\nprint(s.count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s108841751', 's831543533'] | [8944.0, 9000.0] | [30.0, 32.0] | [33, 41] |
p02812 | u162612857 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\n\ncount = 0\nfor i in range(n-2):\n if s[i:i+3] == 'abc':\n count += 1\nprint(count)\n", "n = int(input())\ns = input()\n\ncount = 0\nfor i in range(n-2):\n if s[i:i+3] == 'ABC':\n count += 1\nprint(count)\n"] | ['Wrong Answer', 'Accepted'] | ['s270859621', 's398074706'] | [9140.0, 9140.0] | [28.0, 30.0] | [119, 119] |
p02812 | u164029270 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['input()\nS = input()\nprint(S.count("abc"))', 'input()\nS = input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s965468053', 's906768008'] | [2940.0, 2940.0] | [17.0, 17.0] | [41, 41] |
p02812 | u166807268 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['int N = input()\nstr S = input()\n\nres = count("ABC")\nprint(res)\n', 'int N = input()\nint S = input()\nprint(S.count("ABC"))', 'N = input()\nS = input()\nprint(S.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s019635130', 's558166158', 's600269701'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [63, 53, 45] |
p02812 | u179376941 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\nwords = input()\n\ncount ≒ 0\nfor i in range(n - 2):\n if words[i] == 'A':\n if words[i + 1] == 'B':\n if words[i + 2] == 'C':\n count += 1\nprint(count)", "n = int(input())\nwords = input()\n\ncount = 0\nfor i in range(n - 2):\n if words[i] == 'A':\n if words[i + 1] == 'B':\n if words[i + 2] == 'C':\n count += 1\nprint(count)\n"] | ['Runtime Error', 'Accepted'] | ['s602268146', 's701898984'] | [8884.0, 9040.0] | [29.0, 30.0] | [180, 179] |
p02812 | u179539980 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n=input();s=input()\nprint(s.count('ABC')", "n=input();s=input()\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s130876384', 's519395285'] | [2940.0, 2940.0] | [17.0, 17.0] | [40, 41] |
p02812 | u181195295 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = input()\nS = input()\n\nn = str.count('ABC')\nprint(n)", "N = input()\nS = input()\n\nn = S.count('ABC')\nprint(n)"] | ['Runtime Error', 'Accepted'] | ['s687033688', 's778498776'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 52] |
p02812 | u181215519 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = str(input())\n\ndfs = df[S]\n\ndfs.str.contains("ABC")', 'N = int(input())\nS = str(input())\n\ncount = 0\nfor i in range(N-2):\n if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":\n count+=1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s106029860', 's963860057'] | [2940.0, 2940.0] | [17.0, 18.0] | [71, 144] |
p02812 | u182594853 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=str(input())\nans=0\nfor i in range(n):\n if s[i:i+3] =="abc":\n ans +=1\n else:\n ans +=0\nprint(ans)\n', 'n=int(input())\ns=str(input())\nans=0\nfor i in range(n):\n if s[i:i+3] =="ABC":\n ans +=1\n else:\n ans +=0\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s870304533', 's737781220'] | [3068.0, 2940.0] | [17.0, 17.0] | [133, 133] |
p02812 | u183200783 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\nS = input()\n\ncnt = 0\nfor i in range(N):\n print(S[i:i+3])\n if S[i:i+3] == 'ABC':\n cnt += 1\n\nprint(cnt)", "N = int(input())\nS = input()\n\ncnt = 0\nfor i in range(N):\n if S[i:i+3] == 'ABC':\n cnt += 1\n\nprint(cnt)\n"] | ['Wrong Answer', 'Accepted'] | ['s495110358', 's898508767'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 112] |
p02812 | u189806337 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\n\nk = 0\n\nfor i in range(n-2):\n\tif s[i]=A and s[i+1]=B and s[i+2]=C:\n\t\tk += 1\n \nprint(k)\n', 'n = int(input())\ns = input()\n\nk = 0\n\nfor i in range(n-2):\n\tif s[i] == A and s[i+1] == B and s[i+2] == C:\n\t\tk += 1\n \nprint(k)\n', 'n = int(input())\ns = input()\n\nk = 0\n\nfor i in i <= n-3:\n\tif s[i]=A and s[i+1]=B and s[i+2]=C:\n\t\tk += 1\n \nprint(k)', 'n = int(input())\ns = input()\n\nk = 0\n\nfor i in range(n-2):\n\tif s[i] == "A" and s[i+1] == "B" and s[i+2] == "C":\n\t\tk += 1\n \nprint(k)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s214111214', 's420356522', 's510213786', 's408724684'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [123, 132, 120, 138] |
p02812 | u198905553 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = input()\n\nans = 0\n\nfor i in range(N-1):\n print(i)\n if S[i:i+3] == "ABC":\n ans += 1\n \nprint(ans)', 'N = int(input())\nS = input()\n\nans = 0\n\nfor i in range(N-1):\n if S[i:i+3] == "ABC":\n ans += 1\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s698048678', 's464221074'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 110] |
p02812 | u201802797 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["i = int(input())\nj = input()\n \nprint(count('ABC'))", "i = int(input())\nj = input()\nprint(j.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s387714575', 's136733946'] | [2940.0, 2940.0] | [17.0, 18.0] | [53, 50] |
p02812 | u218393296 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n,s = map(str,input().split())\n\nprint(s.count('ABC'))", "n = input()\ns = input()\n \nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s596490850', 's115315605'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 47] |
p02812 | u221842690 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = input()\ns = str(input())\ns.count("ABC")', 'k,x = map(str, input().split())\nx.count("ABC")', 'n = str(input())\ns = str(input())\ns.count("ABC")\n', 'n = input()\ns = str(input())\ns.count("ABC")', 'n = int(input())\ns = str(input())\ncnt = 0\n# s.count("ABC")\nfor i in range(n):\n# print(s[i:i+3].find("ABC"))\n if s[i:i+3].find("ABC") ==0:\n cnt = cnt+1\nprint(cnt) '] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s260456709', 's552684151', 's621573640', 's630673232', 's666537255'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [43, 46, 49, 43, 169] |
p02812 | u222668979 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = list(str(input()))\nans=0\nfor i in range(len(s) - 3):\n if list[i] = 'A':\n if list[i + 1] = 'B':\n if list[i + 2] = 'C':\n ans+=1\nprint(ans)", "n = int(input())\ns = input()\nprint(s.count('ABC'))\n\nif n == 10:\n print(2)", "n = int(input())\ns = list(str(input()))\nans=0\nfor i in range(len(s) - 2):\n if s[i] == 'A':\n if s[i + 1] == 'B':\n if s[i + 2] == 'C':\n ans+=1\nprint(ans)"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s113708405', 's923796889', 's604388797'] | [2940.0, 9064.0, 3060.0] | [17.0, 26.0, 17.0] | [193, 76, 187] |
p02812 | u223555291 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["a=int(input())\nb=list(input())\nb.str.upper()\nc=0\nfor i in range(a):\n if b[i]=='A':\n if b[i]+b[i+1]+b[i+2]=='ABC':\n c+=1\n else:\n pass\nprint(c) \n", "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n \nprint(c) \n", "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-(i+1)>=2:\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n else:\n pass\nprint(c) \n", "a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]='A':\n else:\n pass\n if b[i+1]='B':\n else:\n pass\n if b[i+2]='C':\n c+=1\n else:\n pass\n \nprint(c)\n", "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-1-i>=2:\n \n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n \nprint(c) \n", 'a=int(input())\nb=list(input())\nc=0\nd=0\nfor i in range(a):\n if b[i]=="A":\n d+=1\n \n if d==1 and b[i+1]==\'B\':\n \n \n d+=1\n if d==2 and b[i+2]=\'C\':\n \n \n \n \n d=0\n c+=1\n else:\n d=0\n \n \nprint(c)\n', 'a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]=="A":\n if b[i+1]=="B":\n else:\n pass\n if b[i+2]=="C":\n c+=1\n else:\n pass\nprint(c)\n', 'a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]=="A":\n if b[i+1]=="B":\n else:\n pass\n if b[i+2]=="C":\n c+=1\n else:\n pass\n else:\n pass\nprint(c)\n', "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-(i+1)>=2:\n \n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n \nprint(c) \n", "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-(i+1)>=2:\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n else:\n pass\n else:\n pass\nprint(c) \n", 'a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]="A":\n if b[i+1]="B":\n else:\n pass\n if b[i+2]="C":\n c+=1\n else:\n pass\nelse:\n pass\nprint(c)\n', "a=int(input())\nb=list(input().str.upper())\nc=0\nfor i in range(a):\n if b[i]=='A':\n if b[i]+b[i+1]+b[i+2]=='ABC':\n c+=1\n else:\n pass\nprint(c) \n", 'a=int(input())\nb=list(input())\nc=0\nd\nfor i in range(a):\n if b[i]=="A":\n d+=1\n \n if d==1 and b[i+1]==\'B\':\n \n \n d+=1\n if d==2 and b[i+2]=\'C\':\n \n \n \n \n d=0\n c+=1\n else:\n d=0\n \n \nprint(c)\n', "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-i>=2:\n \n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n \nprint(c) \n", "a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]='A':\n if b[i+1]='B':\n else:\n pass\n if b[i+2]='C':\n c+=1\n else:\n pass\n else:\n pass\nprint(c)\n", "a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]=='A' and b[i+1]=='B' and b[i+2]=='c':\n c+=1\n \nprint(c) \n", "a=int(input())\nb=list(input())\nb.upper()\nc=0\nfor i in range(a):\n if b[i]=='A':\n if b[i]+b[i+1]+b[i+2]=='ABC':\n c+=1\n else:\n pass\nprint(c) \n", 'a=int(input())\nb=list(input())\nc=0\nfor i in range(a):\n if b[i]=="A":\n if b[i+1]=="B":\n else:\n pass\n if b[i+2]=="C":\n c+=1\n else:\n pass\n else:\n pass\nprint(c)\n', "n=int(input())\ns=list(input())\nd=0\nfor i in range(n):\n if n-(i+1)>=2:\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n d+=1\n else:\n pass\nprint(d) \n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s069202459', 's155753083', 's173539077', 's180475135', 's223386348', 's239978358', 's259617049', 's333581078', 's371230679', 's402314873', 's430402517', 's441311724', 's589774702', 's602883324', 's650172892', 's664696932', 's728299098', 's988876714', 's651731162'] | [2940.0, 3316.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 22.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [159, 127, 162, 197, 151, 282, 172, 197, 153, 183, 190, 157, 280, 149, 192, 127, 155, 197, 162] |
p02812 | u224353074 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = input()\n"""\n10\nZABCDBABCQ\n"""\n\nnum = 0\nfor i in range(len(S)-2):\n print(S[i:i+3])\n if S[i:i+3] == "ABC":\n num += 1\n\nprint(num)\n', 'N = int(input())\nS = input()\n"""\n10\nZABCDBABCQ\n"""\n\nnum = 0\nfor i in range(len(S)-2):\n if S[i:i+3] == "ABC":\n num += 1\n\nprint(num)'] | ['Wrong Answer', 'Accepted'] | ['s708878050', 's158000041'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 140] |
p02812 | u248791307 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['a=int(input())\nb=input()\nfor \nfor i in range(a-2):\n\tif b[i:i+1] == "A":\n\t\tif b[i+1:i+2] == "B":\n\t\t\tif b[i+2:i+3] == "C":\n\t\t\t\tsum+=1\n\t\t\tpass\n\t\tpass\n\tpass\nprint(sum)\n', 'a=input()\nb=input()\nfor \nfor i in range(a-2):\n\tif b[a:a] == "A":\n\t\tif b[a+1:a+1] == "B":\n\t\t\tif b[a+2:a+2] == "C":\n\t\t\t\tsum+=1\n\t\t\tpass\n\t\tpass\n\tpass\nprint(sum)', 'a=int(input())\nb=input()\nfor \nfor i in range(a-2):\n\tif b[i:i] == "A":\n\t\tif b[i+1:i+1] == "B":\n\t\t\tif b[i+2:i+2] == "C":\n\t\t\t\tsum+=1\n\t\t\tpass\n\t\tpass\n\tpass\nprint(sum)\n', 'a=int(input())\nb=input()\nfor \nfor i in range(a-2):\n\tif b[a:a] == "A":\n\t\tif b[a+1:a+1] == "B":\n\t\t\tif b[a+2:a+2] == "C":\n\t\t\t\tsum+=1\n\t\t\tpass\n\t\tpass\n\tpass\nprint(sum)\n', 'a=int(input())\nb=input()\nsum=0\nfor i in range(a-2):\n\tif b[i:i+1] == "A":\n\t\tif b[i+1:i+2] == "B":\n\t\t\tif b[i+2:i+3] == "C":\n\t\t\t\tsum+=1\n\t\t\tpass\n\t\tpass\n\tpass\nprint(sum)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s012373065', 's039906646', 's524086734', 's539822781', 's496629757'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [164, 156, 162, 162, 165] |
p02812 | u250100102 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["def main():\n n = input()\n inp = input()\n sum = 0\n order = 0 # searching {a:0 b:1 c:2}\n for c in inp:\n if ord(c) == ord('A') + order:\n if order == 2:\n sum += 1\n order = 0\n else:\n order += 1\n print(sum)", "n = input()\ninp = input()\n\nsum = 0\norder = 0\n\nfor c in inp:\n if ord(c) == ord('a'):\n order = 1\n elif ord(c) == ord('a') + order:\n order = (order + 1) % 3\n sum += max(0, order - 1)\n else:\n order = 0\nprint(sum)", "n = input()\ninp = input()\n\nsum = 0\norder = 0\n\nfor c in inp:\n if ord(c) == ord('A'):\n order = 1\n elif ord(c) == ord('A') + order:\n order += 1\n if order == 3:\n order = 0\n sum += 1\n else:\n order = 0\nprint(sum)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s144758986', 's945762903', 's197666411'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [240, 223, 231] |
p02812 | u251075661 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input)\ns = input()\n\nprint(len(s.split('ABC')) - 1)", "n = int(input())\ns = input()\n \nprint(len(s.split('ABC')) - 1)"] | ['Runtime Error', 'Accepted'] | ['s212793092', 's884051674'] | [2940.0, 3064.0] | [18.0, 18.0] | [58, 61] |
p02812 | u252828980 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\nss = "ABC"\ncnt = 0\nfor i in range(n-2):\n if s[i:i+3] == ss:\n print(s[i:i+3],i)\n cnt += 1\nprint(cnt)', 'n = int(input())\ns = input()\nss = "ABC"\ncnt = 0\nfor i in range(n-2):\n if s[i:i+3] == ss:\n #print(s[i:i+3])\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s986926289', 's993685470'] | [2940.0, 2940.0] | [18.0, 17.0] | [135, 134] |
p02812 | u265118937 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ntext = input(list() \npattern = list('ABC') \n\n\nfor i in range(n):\n match = True \n for j in range(len(pattern)):\n if text[i + j] != pattern[j]:\n match = False \n break\n if match: \n print(i)\n break", "n = int(input())\ntext = input(list() \npattern = list('ABC') \ncnt = 0\n\nfor i in range(n):\n match = True \n for j in range(len(pattern)):\n if text[i + j] != pattern[j]:\n match = False \n break\n if match: \n cnt += 1\n\nprint(cnt)", "n = int(input())\ns = input() \npattern = list('ABC') \ncnt = 0\n\nfor i in range(n):\n for j in range(3):\n if s[i + j] != pattern[j]:\n match = False\n break\n if match: \n cnt += 1\n\nprint(cnt)", "n = int(input())\ntext = input(list()) \npattern = list('ABC') \ncnt = 0\n\nfor i in range(n):\n match = True \n for j in range(len(pattern)):\n if text[i + j] != pattern[j]:\n match = False \n break\n if match: \n cnt += 1\n\nprint(cnt)", "n = int(input())\ns = input() \npattern = list('ABC') \ncnt = 0\n\nfor i in range(n):\n match = True \n for j in range(len(pattern)):\n if s[i + j] != pattern[j]:\n match = False \n if match: \n cnt += 1\n\nprint(cnt)", "n = int(input())\ns = input() \npattern = list('ABC') \ncnt = 0\n\nfor i in range(n-len(pattern)+1):\n if s[i] == pattern[0]:\n if s[i+1] == pattern[1]:\n if s[i+2] == pattern[2]:\n cnt += 1\n\nprint(cnt)\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s157300638', 's208742355', 's336880282', 's681266135', 's878265322', 's168397965'] | [2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [511, 516, 314, 517, 493, 244] |
p02812 | u278379520 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["s=input()\nprint(s.count('abc'))", "s=input()\nprint(s.count('ABC'))", "s=input()\nprint(s.count('ABC'))", "n=int(input())\ns=input()\nprint(s.count('ABC'))"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s227294618', 's533058878', 's653840867', 's381120992'] | [2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 20.0] | [31, 31, 31, 46] |
p02812 | u278792700 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["print(input().count('ABC'))", "input()\nprint(input().count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s423838943', 's383412661'] | [2940.0, 2940.0] | [17.0, 17.0] | [27, 35] |
p02812 | u283929013 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = input()\ncount = 0\nfor i in range(N - 3 + 1):\n if S[i:i+2] == "ABC":\n count += 1\nprint(count)', 'N = int(input())\nS = input()\ncount = 0\nfor i in range(0,N-2):\n if S[i:i+3] == "ABC": count += 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s372099047', 's881386310'] | [3068.0, 2940.0] | [18.0, 17.0] | [117, 111] |
p02812 | u294542073 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\n\nS = input()\n\nresult = 0\nfor i in range(N):\n 1文字目から\n if S[i:i+2] == 'ABC':\n result += 1\nprint(result)", "N = int(input())\n\nS = input()\n\nresult = 0\nfor i in range(N):\n \n if S[i:i+3] == 'ABC':\n result += 1\nprint(result)"] | ['Runtime Error', 'Accepted'] | ['s055346603', 's887794725'] | [2940.0, 2940.0] | [17.0, 17.0] | [169, 197] |
p02812 | u295294832 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N= int(input())\nM= input()\nprint(M.find("ABC")', 'N= int(input())\nM= input()\nprint(M.find("ABC"))', 'N= int(input())\nM= input()\nprint(M.count("ABC")) '] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s001206436', 's003646899', 's350202693'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [46, 47, 50] |
p02812 | u302818391 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = input()\ns = input()\nprint(s.count('ABC))", "n = input()\ns = input()\nprint(s.count('ABC'))\n"] | ['Runtime Error', 'Accepted'] | ['s173794070', 's538301788'] | [2940.0, 2940.0] | [18.0, 17.0] | [44, 46] |
p02812 | u305917597 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['length = int(input())\nstring = input()\ncount=0\n\nfor i in range(0,length):\n if ("A" == string[i]) and ("B" == string[i+1]) and ("C" == string[i+2]) and i>length-2:\n count+=1\n i+=3\n\nprint(count)', 'length = int(input())\nstring = input()\nprint(string.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s437766836', 's388993823'] | [3064.0, 2940.0] | [17.0, 17.0] | [209, 65] |
p02812 | u308914480 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N=int(input())\nS=input()\n \nprint(s.count('ABC'))", "n=int(input())\ns=input()\n \nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s305422357', 's136492917'] | [2940.0, 3060.0] | [17.0, 19.0] | [48, 48] |
p02812 | u309026918 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = input()\nprint(S.count())', "N = int(input())\nS = input()\nprint(S.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s990645986', 's884154790'] | [2940.0, 2940.0] | [17.0, 17.0] | [45, 50] |
p02812 | u309120194 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\nS = input()\n\nans = 0\nfor i in range(N-2):\n if S[i:i+2] == 'ABC': ans += 1\n \nprint(ans)", "N = int(input())\nS = input()\n\n\nans = 0\nfor i in range(N-2):\n if S[i:i+3] == 'ABC': ans += 1\n \nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s132336234', 's700843345'] | [9076.0, 9044.0] | [27.0, 30.0] | [107, 209] |
p02812 | u311176548 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n=input()\ns=input()\na=0\nfor i in range(0,n):\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n a=a+1\nprint(a)", "n=int(input())\ns=input()\na=0\nif n>2:\n for i in range(0,n):\n if i<n-2 and s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n a=a+1\nprint(a)"] | ['Runtime Error', 'Accepted'] | ['s720225716', 's466335158'] | [2940.0, 2940.0] | [17.0, 17.0] | [117, 149] |
p02812 | u314825579 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N=int(input())\nS=input()\n \nnabc=0\nfor i in range(0,N-2):\n if S[i:i+2]=='ABC':\n nabc+=1\n \nprint(nabc)", "N=int(input())\nS=input()\n\nslen=len(S)\nnabc=0\nfor i in range(0,slen-2):\n if S[i:i+2]=='ABC':\n nabc+=1\n\nprint(nabc)", "N=int(input())\nS=input()\n \nslen=len(S)\nnabc=0\nfor i in range(0,slen-2):\n if S[i:i+3]=='ABC':\n nabc+=1\n \nprint(nabc)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s041528688', 's704865456', 's983218815'] | [8924.0, 8832.0, 8900.0] | [27.0, 31.0, 26.0] | [104, 117, 119] |
p02812 | u319589470 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\ncnt=0\nfor i in range(n-2):\n if s[i] == "a" && s[i+1] == "b" && s[i+2] == "c":\n cnt+=1\nprint(cnt)', 'n = int(input())\ns = input()\ncnt=0\nfor i in range(n-2):\n if s[i] == "A" and s[i+1] == "B" and s[i+2] == "C":\n cnt+=1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s057374338', 's749794411'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 131] |
p02812 | u333700164 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N=int(input())\nS=[str(input()) for i in range N]\nprint(S.count("ABC"))', 'N=int(input())\nS=[input() for i in range (N)]\nS.count("ABC")', 'N=int(input())\nS=str(input())\nprint(S.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s556250230', 's664097980', 's627809646'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [70, 60, 51] |
p02812 | u335281728 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\nflag = 0\nfor i in range(n-1):\n if i == n-3:\n break\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n flag =+ 1\nprint(flag)", "n = int(input())\ns = input()\nflag = 0\nfor i in range(n):\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n flag =+ 1\nprint(flag)", "n = int(input())\ns = input()\nflag = 0\nfor i in range(n-1):\n if i == n-3:\n break\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n flag =+ 1\nprint(flag)", "n = int(input())\ns = input()\nflag = 0\nfor i in range(n-1):\n if i == n-2:\n break\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n flag += 1\nprint(flag)"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s064658460', 's097968148', 's738946749', 's542214277'] | [3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [203, 170, 219, 203] |
p02812 | u357230322 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n=int(input())\ns=list(input())\ncnt=0\nfor i in range(n-2):\n if s[i]="A" and s[i+1]="B" and s[i+2]="C":\n cnt += 1\nprint(cnt)', 'n=int(input())\ns=list(input())\ncnt=0\nfor i in range(n-2):\n if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n cnt += 1\nprint(cnt)\n'] | ['Runtime Error', 'Accepted'] | ['s400245189', 's923250320'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 130] |
p02812 | u362771726 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = input()\nS = input()\n# N = 10\n# S = 'ZABCDBABCQ'\n\nans = 0\n\nfor i in range(N - 2):\n if S[i:i+3] == 'ABC':\n ans += 1\nprint(ans)\n", "N = int(input())\nS = input()\n# N = 10\n# S = 'ZABCDBABCQ'\n\nans = 0\n\nfor i in range(N - 2):\n if S[i:i+3] == 'ABC':\n ans += 1\n\nprint(ans)\n"] | ['Runtime Error', 'Accepted'] | ['s601711453', 's537499522'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 144] |
p02812 | u363892646 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['s = str(input())\nprint(s.count("ABC"))', 'n = int(input())\ns = str(input())\nprint(s.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s309635680', 's381446878'] | [2940.0, 2940.0] | [17.0, 17.0] | [38, 55] |
p02812 | u366784601 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = input()\ns = input()\ncount = 0\nfor i in range(1, int(n)-1):\n print(s[i-1] + s[i] + s[i+1])\n if s[i-1] + s[i] + s[i+1] == "ABC":\n count = count + 1\nprint(count)', 'n = input()\ns = input()\ncount = 0\nfor i in range(1, int(n)-1):\n if s[i-1] + s[i] + s[i+1] == "ABC":\n count = count + 1\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s176322373', 's734908749'] | [2940.0, 2940.0] | [17.0, 18.0] | [175, 141] |
p02812 | u371132735 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['#abc144_b\nS = input()\nprint(S.count("ABC"))', '#abc144_b\nN = int(input())\nS = input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s229209166', 's512421186'] | [2940.0, 2940.0] | [17.0, 17.0] | [43, 60] |
p02812 | u374815848 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["from sys import stdin\n\nlines = stdin.readlines()\n\nn = int(lines[0].rstrip())\ns = str(lines[1].rstrip())\n\ncounter = 0\nfor i in range(n-2):\nif s[i] == 'A':\n if s[i+1] == 'B':\n if [i+2] == 'C':\n counter += 1\nprint(counter)", "from sys import stdin\n\nlines = stdin.readlines()\n\nn = int(lines[0].rstrip())\ns = str(lines[1].rstrip())\n\ncounter = 0\nfor i in range(n-2):\n print(i)\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n counter += 1\nprint(counter)", "from sys import stdin\n\nlines = stdin.readlines()\n\nn = int(lines[0].rstrip())\ns = str(lines[1].rstrip())\n\ncounter = 0\nfor i in range(n-2):\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n counter += 1\nprint(counter)"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s282925463', 's574732604', 's450634317'] | [2940.0, 3188.0, 3064.0] | [17.0, 18.0, 17.0] | [240, 270, 257] |
p02812 | u382639013 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = str(input())\n\nimport math\nans = 0\n\nfor i in range(math.ceil(len(S)/3)):\n if S[i:i+3] == "ABC":\n ans += 1\n else:\n pass\nprint(ans)', 'N = int(input())\nS = str(input())\n\nimport math\nans = 0\n\nfor i in range(math.ceil(len(S)/3)):\n print(S[i:i+3])\n if S[i:i+3] == "ABC":\n ans += 1\n else:\n pass\nprint(ans)', 'N = int(input())\nS = str(input())\n\nans = 0\n\nfor i in range(len(S) - 2):\n #print(S[i:i+3])\n if S[i:i+3] == "ABC":\n ans += 1\n else:\n pass\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s129118319', 's679800357', 's047776587'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [169, 189, 169] |
p02812 | u390901183 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\ns = input()\n\ncount=0\nfor i in range(n-2):\n if s[i] = "A":\n if s[i+1] = "B":\n if s[i+2]="C":\n count += 1\nprint(count)', "n = int(input())\ns = input()\n\ncount = 0\nfor i in range(n - 2):\n # if s[i] == 'A':\n # if s[i + 1] == 'B':\n # if s[i + 2] == 'C':\n # count += 1\n if s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C':\n count += 1\n\nprint(count)\n"] | ['Runtime Error', 'Accepted'] | ['s696931029', 's827785735'] | [2940.0, 2940.0] | [17.0, 17.0] | [149, 271] |
p02812 | u393512980 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = input()\nprint(inpur().count("ABC"))', 'n = input()\nprint(input().count("ABC"))\n'] | ['Runtime Error', 'Accepted'] | ['s954977809', 's090617653'] | [2940.0, 2940.0] | [17.0, 17.0] | [39, 40] |
p02812 | u406405116 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input())\np = list(input())\nq = list(input())\n\nb = [s + 1 for s in range(n)]\nprint(b)\nfor i in p:\n print(i)', "n = input()\ns = input()\nprint(s.count('ABC') )\n "] | ['Runtime Error', 'Accepted'] | ['s495154996', 's326916294'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 49] |
p02812 | u411858517 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["S = input()\n\nres = 0\nfor i in range(len(S)-2):\n if S[i] == 'A' and S[i+1] == 'B' and S[i+2] == 'C':\n res += 1\n \nprint(res)\n", "S = intput()\n\nres = 0\nfor i in range(len(S)-2):\n if S[i] == 'A' and S[i+1] == 'B' and S[i+2] == 'C':\n res += 1\n \nprint(res)", "N = input()\nS = input()\n\nres = 0\nfor i in range(len(S)-2):\n if S[i] == 'A' and S[i+1] == 'B' and S[i+2] == 'C':\n res += 1\n \nprint(res)\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s620867502', 's708414034', 's076288568'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [130, 130, 142] |
p02812 | u412760429 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['x = input()\nprint(x.count("ABC"))', 'x = input()\nx = input()\nprint(x.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s375106377', 's879864701'] | [2940.0, 2940.0] | [17.0, 17.0] | [33, 45] |
p02812 | u435001241 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["[K, X] = [int(x) for x in input().split()]\nif K * 500 >= X:\n print('Yes')\nelse:\n print('No')", 'N = int(input())\nS = str(input())\nprint(S.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s489293587', 's752700259'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 55] |
p02812 | u435480265 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n,s = input().split()\nprint(s.count('ABC'))", "n = input()\ns = input()\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s383551502', 's957615890'] | [2940.0, 2940.0] | [17.0, 17.0] | [43, 45] |
p02812 | u436611990 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['S = input()\n\nprint(S.count("ABC"))', 'N = input()\nS = input()\n\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s196155894', 's103647617'] | [2940.0, 2940.0] | [17.0, 17.0] | [34, 46] |
p02812 | u438189153 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['s=list(input())\nnum=0\nif n<3:\n exit()\nfor i in range(n):\n if (s[i]=="A") and (s[i+1]=="B") and (s[i+2]=="C"):\n num+=1\nprint(num)\n', 'n=int(input())\ns=list(input())\nnum=0\nif n<3:\n exit()\nfor i in range(n-2):\n if (s[i]=="A") and (s[i+1]=="B") and (s[i+2]=="C"):\n num+=1\nprint(num)\n'] | ['Runtime Error', 'Accepted'] | ['s855480758', 's203420568'] | [9108.0, 9192.0] | [28.0, 27.0] | [142, 159] |
p02812 | u440478998 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input)\ns = input()\ns2 = s.replace("ABC","")\nprint(int((len(s)-len(s2))/3))', 'n = int(input())\ns = input()\ns2 = s.replace("ABC","")\nprint(int((len(s)-len(s2))/3))'] | ['Runtime Error', 'Accepted'] | ['s726336810', 's159038216'] | [8964.0, 9024.0] | [24.0, 27.0] | [82, 84] |
p02812 | u442877951 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input().split())\nS = str(input().split())\ni = 0\ncount = 0\nfor i in range(N-2):\n if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":\n count += 1\nprint(count)', 'N = map(int,input().split())\nS = str(input().split())\ni = 0\ncount = 0\nfor i in range(N-1):\n if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":\n count += 1\nprint(count)', 'N = int(input())\nS = str(input())\ni = 0\ncount = 0\nfor i in range(N-2):\n if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":\n count += 1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s345453423', 's706592327', 's590458493'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [168, 172, 152] |
p02812 | u447888524 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['a,b=input().split("\\n")\nprint(len(b.split("ABC"))-1)', 'a = input().split("\\n")[1]\nprint(len(a.split("ABC"))-1)', 'a = input().split("\\n")[1]\nprint(a.count("ABC"))', 'a = input().split("¥n")[1]\nprint(a.count("ABC"))', 'a,b=map(int, input().split("\\n"))\nprint(len(b.split("ABC"))-1)', 'a = input().split("¥n")[1]\nprint(len(a.split("ABC"))-1)', 'a = input()\na = input()\nprint(a.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s104989672', 's216798287', 's627816104', 's678851845', 's680518355', 's716917143', 's298437982'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [52, 55, 48, 49, 62, 56, 45] |
p02812 | u449352114 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["\nN= int(input())\n\nA= []\ns= input()\nA= list(s)\n\n\nprint(A)\n\nadd = 0\nfor i in range(0, N-1):\n if A[i]== 'A' and A[i+1]=='B' and A[i+2]=='C':\n add = add + 1\n\nprint(add)", "\nN= int(input())\ns= input()\n\nA= []\nA= list(s)\n\n#print(A)\n\nadd = 0\nfor i in range(0, N-2):\n if A[i]== 'A' and A[i+1]=='B' and A[i+2]=='C':\n add = add + 1\n\nprint(add)"] | ['Runtime Error', 'Accepted'] | ['s102741282', 's462605660'] | [9196.0, 9100.0] | [28.0, 23.0] | [224, 224] |
p02812 | u450147945 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\nS = [i for i in range(N)]\ncnt = 0\n\nfor i in range(0, N-2):\n if S[i]=='A' and S[i+1]=='B' and S[i+2]=='C':\n cnt+=1\n\nprint(cnt)", "N = int(input())\nS = input()\nS = [i for i in S]\ncnt = 0\n\nfor i in range(0, N-2):\n if S[i]=='A' and S[i+1]=='B' and S[i+2]=='C':\n cnt+=1\n\nprint(cnt)"] | ['Wrong Answer', 'Accepted'] | ['s454863624', 's917987165'] | [2940.0, 3060.0] | [18.0, 17.0] | [146, 157] |
p02812 | u461833298 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\nS = str(input())\n\nS.count('ABC')", "N = int(input())\nS = str(input())\n\nprint(S.count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s025918251', 's931735201'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 56] |
p02812 | u464626513 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['input = input()\nresult = 0\nfor i in range(len(input) - 2):\n serach = input[i:i+3]\n if serach == "ABC":\n result += 1\nconsole.log(result)', 'input = input()\nresult = 0\nfor i in range(len(input) - 2):\n serach = input[i:i+3]\n if serach == "ABC":\n result += 1\nprint(result)', 'num = input()\ninput = input()\nresult = 0\nfor i in range(len(input) - 2):\n serach = input[i:i+3]\n if serach == "ABC":\n result += 1\nprint(result)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s237312036', 's809340303', 's526016767'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [148, 142, 156] |
p02812 | u469574680 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['#ABC144 B\nN=int(input())\nS=input()\n#print(N)\nresult=0\n\nfor i in range(N-1):\n if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":\n print(i)\n result+=1\n else:\n print("after"+str(i))\n p=1\n\nprint(result)', '#ABC144 B\nN=int(input())\nS=input()\n#print(N)\nresult=0\n\nfor i in range(N-2):\n if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":\n #print(i)\n result+=1\n else:\n #print("after"+str(i))\n p=1\n\nprint(result)'] | ['Runtime Error', 'Accepted'] | ['s537727199', 's802300936'] | [3060.0, 2940.0] | [19.0, 17.0] | [227, 229] |
p02812 | u472197237 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["def main():\n N, S = open(0).read().split('\\n')\n print(S.count('ABC'))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n N = input()\n S = input()\n print(S.count('ABC'))\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s444212089', 's706225816'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 110] |
p02812 | u472696272 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\n\ncount = 0\nflag = 0\nfor ch in s:\n if ch=='A' and flag==0:\n flag = 1\n else:\n flag = 0\n if ch=='B' and flag==1:\n flag = 2\n else:\n flag = 0\n if ch=='C' and flag==2\n \tflag = 3\n else: flag = 0\n if flag==3:\n count += 1\n flag = 0\n\nprint(count)", "n = int(input())\ns = list(input())\ncount = 0\nfor i in range(n-2):\n if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':\n count += 1\nprint(count)"] | ['Runtime Error', 'Accepted'] | ['s617816174', 's529241118'] | [2940.0, 2940.0] | [17.0, 18.0] | [291, 141] |
p02812 | u473113960 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = input()\nw = input()\nw.count('ABC')", "input()\nw = input()\nprint(w.count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s065076167', 's112644869'] | [9092.0, 9112.0] | [26.0, 30.0] | [38, 41] |
p02812 | u486251525 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['S = input()\nprint(S.count("ABC"))', 'N = int(input())\nS = input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s684704935', 's408168780'] | [2940.0, 2940.0] | [17.0, 17.0] | [33, 50] |
p02812 | u497952650 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N=input()\nprint(input().count("ABC")', 'print(input().count("ABC"))', 'N=input()\nprint(input().count("ABC"))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s071014036', 's446888623', 's281173511'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [36, 27, 37] |
p02812 | u500990280 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N = int(input())\nS = input()\nfor i in range(N):\n if S[i]+S[i+1]+S[i+2] == 'ABC':\n a += 1\n if i == N - 3:\n break\nprint(a)\n", "N = int(input())\nS = str(input())\nfor i in range(N):\n if S[i]+S[i+1]+S[i+2] == 'ABC':\n a += 1\n if i == N - 3:\n break\nprint(a)", "N = int(input())\nS = input()\na = 0\nfor i in range(N):\n if S[i]+S[i+1]+S[i+2] == 'ABC':\n a += 1\n if i == N - 3:\n break\nprint(a)\n\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s248812138', 's623917739', 's339969739'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [141, 145, 148] |
p02812 | u506858457 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["N=int(input())\nS=input()\nans=0\nfor in range(N-1):\n if S[i:i+3]=='ABC':\n ans+=1\nprint(ans)", "N=int(input())\nS=input()\nans=0\nfor i in range(N-1):\n if S[i:i+3]=='ABC':\n ans+=1\nprint(ans)"] | ['Runtime Error', 'Accepted'] | ['s234408675', 's624143976'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 95] |
p02812 | u508061226 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = int(input());\ns = input();\n\nans = 0;\n\nfor i in range(len(s)):\n 3_str = s[i:i+2];\n ans += int(3_str == "ABC");\n\nprint(ans);', 'n = int(input());\ns = input();\n\nans = 0;\n\nfor i in range(n):\n three = s[i:i+3];\n ans += int(three == "ABC");\n\nprint(ans);'] | ['Runtime Error', 'Accepted'] | ['s696943609', 's215983411'] | [2940.0, 2940.0] | [17.0, 18.0] | [128, 123] |
p02812 | u528266730 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['n = input()\ns = input()\nprint(s.count("ABC")', 'n = input()\ns = input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s285737259', 's947379107'] | [2940.0, 2940.0] | [17.0, 17.0] | [44, 45] |
p02812 | u529500825 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["a = int(input())\nb = input()\nc = list(b)\nfor i in range(a - 2):\n j = 0\n if c[i] == 'A' and c[i + 1] == 'B' and c[i + 2] == 'C':\n j = j + 1\nprint(j)", "a = int(input())\nb = input()\nc = list(b)\nfor i in range(a - 2):\n j = 0\n if c[i] == 'A' and c[i + 1] == 'B' and c[i + 2] == 'C':\n j += 1\nprint(j)", "a = int(input())\nb = input()\nc = list(b)\nj = 0\nfor i in range(a - 2):\n if c[i] == 'A' and c[i + 1] == 'B' and c[i + 2] == 'C':\n j += 1\nprint(j)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s215441140', 's695970911', 's583981055'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [161, 158, 154] |
p02812 | u547748135 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = input()\ns = input()\ns.count('ABC')", "n = input()\ns = input()\nprint(s.count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s360129369', 's403052138'] | [2940.0, 2940.0] | [17.0, 17.0] | [38, 45] |
p02812 | u548093253 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n = int(input())\ns = input()\nprint(s.count('abc'))", "n = int(input())\ns = input()\nprint(s.count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s666051160', 's291983667'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 50] |
p02812 | u552201227 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\ns = input()\na=0\nfor i in range (1,N-2):\n if s[i:i+2]=="ABC":\n a +=1\nprint(a)\n', 'N = int(input())\ns = input()\na=0\nfor i in range N-2:\n if s[i:i+2]=="ABC":\n a +=1\nprint(a)', 'N = int(input())\ns = input()\na=0\nfor i in range (0,N-2):\n if s[i:i+3]=="ABC":\n a +=1\nprint(a)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s551795008', 's651047259', 's393145653'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 20.0] | [98, 93, 97] |
p02812 | u554452996 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['num = int(input())\na= input()\nwords = a.split()\nss = 0\n\nfor i in range(num):\n if "A" = words[i]:\n for q in range(i,num):\n if "B" = words[q]:\n for g in range(q,num):\n if "C" = words[g]:\n ss += 1\n \n ', 'num = int(input())\ns=list(input())\nss = 0\n\nfor i in range(num):\n if "A" == s[i]:\n if i > num - 3:\n break\n if "B" == s[i + 1]:\n if "C" == s[i + 2]:\n ss += 1\nprint(ss)\n'] | ['Runtime Error', 'Accepted'] | ['s669828529', 's047356392'] | [2940.0, 2940.0] | [17.0, 17.0] | [243, 190] |
p02812 | u556751939 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["str_len = int(input())\nstring_sample = input()\nsample = 'ABC'\n\ncounter = 0\nfor i in range(str_len - 2):\n print(i)\n if string_sample[i:i+3] == sample:\n counter += 1\n \nprint(counter)", "str_len = int(input())\nstring_sample = input()\nsample = 'ABC'\n\ncounter = 0\nfor i in range(str_len - 2):\n if string_sample[i:i+3] == sample:\n counter += 1\n \nprint(counter)"] | ['Wrong Answer', 'Accepted'] | ['s809712625', 's396884000'] | [2940.0, 2940.0] | [17.0, 17.0] | [188, 177] |
p02812 | u558129042 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nwords = input()\nans = 0\nfor i in range(N-4):\n if words[i] == "A":\n if words[i+1] == "B":\n if words[i+2] == "C":\n ans += 1\nprint(ans)', 'N = int(input())\nwords = input()\nans = 0\nfor i in range(N-2):\n if words[i] == "A":\n if words[i+1] == "B":\n if words[i+2] == "C":\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s382293279', 's898465319'] | [2940.0, 3064.0] | [19.0, 17.0] | [185, 185] |
p02812 | u561570330 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ["n,s=input().split()\n\nprint(s.count('ABC'))", "n=input()\ns=input()\n\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s952045083', 's079512720'] | [2940.0, 2940.0] | [17.0, 17.0] | [42, 42] |
p02812 | u562550538 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['N = int(input())\nS = input()\nprint(S.count("ABC")\n', 'N = int(input())\nS = input()\nprint(S.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s271375674', 's946660587'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 50] |
p02812 | u566297428 | 2,000 | 1,048,576 | We have a string S of length N consisting of uppercase English letters. How many times does `ABC` occur in S as contiguous subsequences (see Sample Inputs and Outputs)? | ['input()\n\nS = input()\n\nprint(sorted(S).count("ABC"))', 'N = int(input())\nS = input()\n\nc = S.count("ABC")\nprint(c)\n'] | ['Wrong Answer', 'Accepted'] | ['s613972985', 's576202748'] | [2940.0, 8860.0] | [17.0, 27.0] | [51, 58] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.