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 | u569479281 | 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 = s.count('ABC')\nprint(ans)", "n = int(input())\ns = input()\nans = s.count('ABC')\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s007822372', 's203118743'] | [2940.0, 2940.0] | [17.0, 19.0] | [71, 60] |
p02812 | u571395477 | 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)? | ["import sys\n\ndef main():\n N = int(input().split())\n S = input()\n\n cnt = 0\n for i in range(N):\n s = str(S[i]) + str(S[i+1]) + str(S[i+2])\n if s=='ABC':\n cnt += 1\n\n print(cnt)\nmain()", "import sys\n\ndef main():\n N = int(input().split())\n S = input()\n\n cnt = 0\n for i in range(N-2):\n s = str(S[i:i+2])\n if s=='ABC':\n cnt += 1\n\n print(cnt)\nmain()", "import sys\n\ndef main():\n N = int(input())\n S = input()\n\n cnt = 0\n for i in range(N-2):\n s = str(S[i:i+2])\n if s=='ABC':\n cnt += 1\n\n print(cnt)\nmain()", "import sys\n\ndef main():\n N = int(input().split())\n S = input()\n\n cnt = 0\n for i in range(N-2):\n s = str(S[i]) + str(S[i+1]) + str(S[i+2])\n if s=='ABC':\n cnt += 1\n\n print(cnt)\nmain()", "import sys\n\ndef main():\n N = int(input())\n S = input()\n\n cnt = 0\n for i in range(N-2):\n s = str(S[i:i+3])\n if s=='ABC':\n cnt += 1\n\n print(cnt)\nmain()"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s486464427', 's491235685', 's780428403', 's855311635', 's394682401'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [219, 197, 189, 221, 189] |
p02812 | u572012241 | 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()\ncnt = 0\n for i in range(n):\n if i == n-2 or i== n-1 :\n continue\n if s[i]== "A" and s[i+1] == "B" and s[i+2] == "C" :\n cnt+=1\n print(cnt)', 'n = int(input())\ns = input()\ncnt = 0\n for i in range(n):\n if i == n-2 or i== n-1 :\n continue\n if s[i]== "A" and s[i+1] == "B" and s[i+2] == "C" :\n cnt+=1\n print(cnt)', 'n = int(input())\ns = input()\ncnt = 0\nfor i in range(n):\n if i == n-2 or i== n-1 :\n continue\n if s[i]== "A" and s[i+1] == "B" and s[i+2] == "C" :\n cnt+=1\nprint(cnt)\n '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s347814842', 's385355566', 's746690599'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [190, 207, 188] |
p02812 | u577914737 | 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 = input()\nprint(a.count('ABC'))", "a = int(input())\nb = input()\nprint(a.count('ABC'))\n", "a = int(input())\nb = input()\nprint(b.count('ABC'))\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s075389655', 's106628382', 's056856361'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [33, 51, 51] |
p02812 | u589578850 | 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())\nletters = input()\ncnt = 0\nfor i in range(n):\n if letters[i:i+3]=="abc":\n cnt += 1\n\nprint(cnt)', 'n = int(input())\nletters = input()\ncnt = 0\nfor i in range(n):\n if letters[i:i+3]=="ABC":\n cnt += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s896821066', 's512549976'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 120] |
p02812 | u592035627 | 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'] | ['s870686307', 's541829968'] | [2940.0, 3064.0] | [17.0, 17.0] | [50, 50] |
p02812 | u594862874 | 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())\nn = int(input())\nprint(s.count('ABC')) if len(s)==n", "s, n = input().split()\nprint(s.count('ABC'))", "s = str(input())\nn = int(input())\ns.upper()\nprint(s.count('ABC')) if len(s)==n", 'N = int(input())\nS = str(input())\nprint(S.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s128130287', 's602880836', 's844174893', 's962041822'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [68, 44, 78, 55] |
p02812 | u596297663 | 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-3)\n\tif s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n\t\tcount = count + 1\nprint(count)', 'n=int(input())\ns=input()\n \ncount = 0\nfor i in range(n-3+1):\n#\tprint(s[i],s[i+1],s[i+2])\n\tif s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n\t\tcount = count + 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s532921934', 's706899057'] | [2940.0, 2940.0] | [17.0, 17.0] | [135, 167] |
p02812 | u601575292 | 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\nans = 0\nprint(S)\nfor i in S:\n\tif S[cnt] == "A":\n\t\tif S[cnt:cnt+3] == "ABC":\n\t\t\tans += 1\n\tcnt += 1\n\tif N - 3 == cnt:\n\t\tbreak\n\nprint(ans)', 'N = int(input())\nS = input()\n\ncnt = 0\nans = 0\nprint(S)\nfor i in S:\n\tif S[cnt] == "A":\n\t\tif S[cnt:cnt+3] == "ABC":\n\t\t\tans += 1\n\tcnt += 1\n\tif N - 3 == cnt:\n\t\tbreak\n\nprint(ans)', 'N = int(input())\nS = input()\n\ncnt = 0\nans = 0\nprint(S)\nfor i in S:\n\tif S[cnt:cnt+3] == "ABC":\n\t\tans += 1\n\tcnt += 1\n\tif cnt == (N - 3):\n\t\tbreak\nprint(ans)', 'N = int(input())\nS = input()\n\ncnt = 0\nans = 0\nfor i in S:\n\tif S[cnt:cnt+3] == "ABC":\n\t\tans += 1\n\tcnt += 1\n\tif cnt == (N - 3):\n\t\tif S[cnt:cnt+3] == "ABC":\n\t\t\tans += 1\n\t\tbreak\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s036379754', 's671559983', 's863636913', 's675642009'] | [3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [173, 173, 153, 184] |
p02812 | u604055101 | 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)? | ['text = input().split("ABC")\nprint(len(text)-1)', 'input()\ntext = input().split("ABC")\nprint(len(text)-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s134129235', 's598510641'] | [2940.0, 2940.0] | [17.0, 17.0] | [46, 55] |
p02812 | u607729897 | 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 functools import lru_cache\nimport sys\n\nsys.setrecursionlimit(10**8)\n\nN = int(input())\nS = str(input())\n\n@lru_cache(maxsize=None)\ndef dp(s):\n print(s.count("ABC"))\nprint(dp(S))\n\n', 'from functools import lru_cache\nimport sys\n\nsys.setrecursionlimit(10**8)\n\nN = int(input())\nS = input()\n\n@lru_cache(maxsize=None)\ndef dp(s):\n result = s.count("ABC")\n return result\nprint(dp(S))\n\n'] | ['Wrong Answer', 'Accepted'] | ['s179259372', 's971894972'] | [3572.0, 3572.0] | [24.0, 24.0] | [185, 200] |
p02812 | u609814378 | 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-2):\n if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":\n ans = ans + 1\n ', 'N = int(input())\nS = input()\n\nans = 0\n\nfor i in range(N-2):\n if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":\n ans = ans + 1\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s754285919', 's838375358'] | [2940.0, 3060.0] | [17.0, 24.0] | [148, 153] |
p02812 | u612635771 | 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 = input()\ns = input()\nprint(s.count("ABC")', 'a = input()\ns = input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s675138929', 's576614819'] | [8916.0, 9024.0] | [24.0, 31.0] | [44, 45] |
p02812 | u619144316 | 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(i,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 = list(input())\ncnt = 0\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)"] | ['Runtime Error', 'Accepted'] | ['s728381086', 's088009316'] | [2940.0, 3060.0] | [17.0, 17.0] | [148, 149] |
p02812 | u629186149 | 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 = input()\nb = input()\nprint(b.count("abc"))', 'a = input()\nb = input()\nprint(b.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s810910569', 's846256628'] | [2940.0, 2940.0] | [17.0, 17.0] | [45, 45] |
p02812 | u629607744 | 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()\n\ncount=0\nfor i in range(a-2):\n if b[i]='a'and b[i+1]='b' and b[i+2]='c':\n count+=1\nprint(count)", "a=int(input())\nb=input()\n\ncount=0\nfor i in range(a-2):\n if b[i]=='a'and b[i+1]=='b' and b[i+2]=='c':\n count+=1\nprint(count)\n", 'N=int(input())\nS=input()\n\nif', 'def i():\n\treturn int(input())\ndef i2():\n\treturn map(int,input().split())\ndef s():\n\treturn str(input())\ndef l():\n\treturn list(input())\ndef intl():\n\treturn list(int(k) for k in input().split())\n\nn = i()\ns = s()\n\ncnt = 0\nfor i in range(n-2):\n\tif s[i]+s[i+1]+s[i+2] == "ABC":\n\t\tcnt += 1\n\nprint(cnt)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s421882613', 's834181691', 's964870417', 's328698516'] | [2940.0, 2940.0, 2940.0, 9196.0] | [17.0, 17.0, 17.0, 28.0] | [124, 128, 28, 294] |
p02812 | u631460433 | 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())\nx=input()\nx.count("ABC")', 'n=int(input())\nx=input()\ny=x.count("ABC")\nprint(y)'] | ['Wrong Answer', 'Accepted'] | ['s687315985', 's080711027'] | [2940.0, 2940.0] | [18.0, 17.0] | [39, 50] |
p02812 | u631579948 | 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=list(input())\nans=0\nfor i in range(len(N)-2):\n if N[i]=='A':\n if N[i+1]=='B':\n if N[i+2]=='C':\n ans=ans+1\nprint(N) ", "M=int(input())\nN=list(input())\nans=0\nfor i in range(len(N)-2):\n if N[i]=='A':\n if N[i+1]=='B':\n if N[i+2]=='C':\n ans=ans+1\nprint(ans) "] | ['Wrong Answer', 'Accepted'] | ['s645556670', 's699947456'] | [2940.0, 2940.0] | [18.0, 17.0] | [140, 157] |
p02812 | u631998785 | 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",0,N))', 'N,S=input()\nprint(S.count("abc"))', 'N=int(input())\nS=input()\nprint(S.count("ABC",0,N))'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s205925191', 's471947367', 's557722458', 's283344543'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [46, 50, 33, 50] |
p02812 | u635759013 | 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 = [int(input()) for _ in range(2))\nprint(s.count("ABC"))', 'n,s = [input() for _ in range(2)]\nprint(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s798461282', 's014127936'] | [8952.0, 9088.0] | [22.0, 28.0] | [60, 55] |
p02812 | u644546699 | 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 resolve():\n _, S = [input() for i in range(2)]\n\n print(S.count(\'abc\'))\n\n\nif __name__ == "__main__":\n resolve()', 'def resolve():\n _, S = [input() for i in range(2)]\n\n print(S.count(\'abc\') + S.count(\'ABC\'))\n\n\nif __name__ == "__main__":\n resolve()'] | ['Wrong Answer', 'Accepted'] | ['s395351939', 's467649818'] | [2940.0, 2940.0] | [17.0, 17.0] | [123, 140] |
p02812 | u652656291 | 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(inout())\nprint(s.count('ABC'))", "n = int(input())\ns = input()\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s293468835', 's978422837'] | [2940.0, 9052.0] | [17.0, 31.0] | [55, 50] |
p02812 | u655135177 | 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()) s = input() print(s.count('ABC'))", "n = int(input())\ns = input() \nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s893723914', 's201156217'] | [2940.0, 2940.0] | [17.0, 17.0] | [273, 207] |
p02812 | u665224938 | 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(len(S.split("ABC") - 1))', '_ = input()\nS = input()\nprint(len(S.split("ABC") - 1)', '_ = input()\nS = input()\nprint(len(S.split("ABC")) - 1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s170721964', 's708149965', 's165960764'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [54, 53, 54] |
p02812 | u668352391 | 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 print(s[i:i+3])\n if s[i:i+3] == 'ABC':\n count += 1\nprint(count)", "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)"] | ['Wrong Answer', 'Accepted'] | ['s879414988', 's544009991'] | [2940.0, 2940.0] | [17.0, 18.0] | [130, 112] |
p02812 | u671889550 | 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\nlist=[]\n\nfor i in range(N-1):\n if S[i]=='a' and S[i+1]=='b' and S[i+2]=='c':\n list.append(i)\nprint(len(list))", "N = int(input())\nS = input()\ncnt = 0\n\nfor i in range(N):\n if S[i] == 'C' and S[i - 1] == 'B' and S[i - 2] == 'A':\n cnt += 1\nprint(cnt)"] | ['Wrong Answer', 'Accepted'] | ['s824791451', 's524981341'] | [9036.0, 9100.0] | [26.0, 24.0] | [150, 144] |
p02812 | u674588203 | 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\nS.replace('ABC','x')\nprint(S.count('x'))", "N=input()\nS=input()\n\nans=S.replace('ABC','x')\nprint(ans.count('x'))"] | ['Wrong Answer', 'Accepted'] | ['s235228578', 's913529205'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 67] |
p02812 | u674934587 | 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())\ncount=0\ns=input()\nfor i in s:\n if i=="ABC":\n count+=1 \nprint(count)', 'n=int(input())\ns=input()\nprint(s.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s452274304', 's909492159'] | [9164.0, 9140.0] | [30.0, 29.0] | [87, 46] |
p02812 | u692453235 | 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-3):\n if S[i]S[i+1]S[i+2] == ABC:\n count = +1\n else:\n continue\nprint(count)', 'N = int(input())\nS = input()\n\n\n#print(S.split("ABC"))\nprint(len(S.split("ABC")) - 1)\n\n'] | ['Runtime Error', 'Accepted'] | ['s162743223', 's481271963'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 96] |
p02812 | u692498898 | 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.replace('ABC','a')\nprint(s.count('a'))", "n=int(input())\ns=input()\ns.replace('ABC','a2c')\nprint(s.count('a2c'))", "n=int(input())\ns=input()\nt=s.replace('ABC','c')\nprint(t.count('a'))", "n=int(input())\ns=input()\nt=s.replace('ABC','a')\nprint(t.count('a'))"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s581663531', 's595082507', 's875459126', 's276538455'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 18.0] | [65, 69, 67, 67] |
p02812 | u696419801 | 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\nstr_list = list(S)\n\ncount = 0\nfor i in range(len(str_list)):\n string = str_list[i]\n if string == 'A':\n i += 1\n string = str_list[i]\n if string == 'B':\n i += 1\n string = str_list[i]\n if string == 'C':\n count += 1\n\nprint(count)", 'N=int(input())\nS=input()\n\nprint(S.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s323664460', 's233589131'] | [3060.0, 2940.0] | [18.0, 17.0] | [298, 47] |
p02812 | u697601622 | 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()\nacs = 65\ncount=0\nflag=0\n\nif N>=3 and N<=50:\n if len(S) == N:\n for i in S:\n if ord(i) == acs:\n acs+=1\n count+=1\n else:\n acs=65\n if count==3:\n flag+=1\n count=0\n\nprint(flag)\n \n', 'N = int(input())\nS = str(input())\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s065497365', 's065783870'] | [3060.0, 2940.0] | [17.0, 17.0] | [339, 55] |
p02812 | u698849142 | 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'))"] | ['Runtime Error', 'Accepted'] | ['s267018916', 's579698985'] | [2940.0, 2940.0] | [18.0, 17.0] | [49, 50] |
p02812 | u703890795 | 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()\nc = 0\nfor i in range(N-2):\n if S[i:i+3]=="ABC":\n c += 0\nprint(c)', 'N = int(input())\nS = input()\nc = 0\nfor i in range(N-2):\n if S[i:i+3]=="ABC":\n c += 1\nprint(c)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s179622113', 's566786248'] | [2940.0, 2940.0] | [17.0, 19.0] | [97, 99] |
p02812 | u704284486 | 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()\nN = len(s)\nans = 0\nif N < 3:print(0);exit()\ni = 0\nwhile i < N-3:\n if s[i:i+3] == 'ABC':ans += 1;i += 3\n else:i+=1\n\nprint(ans)\n", "s = input()\nN = len(s)\nans = 0\nif N < 3:print(0);exit()\nfor i in range(N-3):\n if s[i:i+3] == 'ABC':ans += 1\n\nprint(ans)", "s = input()\nN = len(s)\nans = 0\nif N < 3:print(0);exit()\nfor i in range(N-2):\n if s[i]=='A' and s[i+1]=='B' and s[i+2] == 'C':ans += 1\n\nprint(ans)\n", "s = input()\nN = len(s)\nans = 0\nfor i in range(N-2):\n if s[i:i+3] == 'ABC':ans += 1\n\nprint(ans)\n", "N = int(input())\ns = input()\nans = 0\nif N < 3:print(0);exit()\nfor i in range(N-2):\n if s[i:i+3] == 'ABC':ans += 1\n\nprint(ans)\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s327388509', 's409396569', 's590351839', 's699184361', 's021200055'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [140, 120, 147, 96, 127] |
p02812 | u709686535 | 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)? | ['total = int(input())\ntext = input()\n\nres = 0\n\nif total < 3:\n for x in range(0, total - 1):\n if text[x] == "A":\n if x + 2 <= total:\n if text[x + 1] == "B" and text[x + 2] == "C":\n res += 1\n\nprint(res)', 'total = int(input())\ntext = input()\n\nres = 0\n\nfor x in range(0, total-1):\n if x == "A":\n if x+2 =< total:\n if text[x+1] == "B" and text[x+2] == "C":\n res += 1\n \nprint(res)', 'total = int(input())\ntext = input()\n\nres = 0\n\nif total >= 3:\n for x in range(0, total - 1):\n if text[x] == "A":\n if x + 3 <= total:\n if text[x + 1] == "B" and text[x + 2] == "C":\n res += 1\n\nprint(res)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s077766835', 's146375209', 's188306840'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [254, 192, 255] |
p02812 | u718559100 | 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()\nString S = input()\nprint(s.count('ABC'))", "N = input()\nS = input()\nprint(s.count('ABC'))", "N = input()\nS = input()\nprint(S.count('ABC'))"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s395451574', 's937179553', 's908074302'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [56, 45, 45] |
p02812 | u718949306 | 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()\ncut = 0\nfor n in range(N+1):\n if S[n] == 'A' and S[n + 1] == 'B' and S[n + 2] == 'C':\n cut += 1\n\nprint(cut)", "N = int(input())\nS = input()\n\ncnt = 0\n\nfor n in range(N-2):\n if S[n] == 'A' and S[n+1] == 'B' and S[n+2] == 'C':\n cnt += 1\nprint(cnt)"] | ['Runtime Error', 'Accepted'] | ['s199971087', 's354406407'] | [2940.0, 2940.0] | [18.0, 17.0] | [146, 143] |
p02812 | u723790132 | 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)? | ['\nS = str(input())\nprint(S.count("ABC"))\n', 'N = int(input())\nS = str(input())\nprint(S.count("ABC"))\n'] | ['Wrong Answer', 'Accepted'] | ['s528016240', 's052960944'] | [2940.0, 2940.0] | [17.0, 19.0] | [40, 56] |
p02812 | u726154863 | 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'))"] | ['Wrong Answer', 'Accepted'] | ['s117499231', 's926601771'] | [2940.0, 2940.0] | [18.0, 17.0] | [41, 41] |
p02812 | u729119068 | 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(sum(S[i]==A and S[i+1]==B and S[i+2]==C for i in range(N-2))) ', "N=int(input())\nS=input()\nprint(sum(S[i]=='A' and S[i+1]=='B' and S[i+2]=='C' for i in range(N-2)))"] | ['Runtime Error', 'Accepted'] | ['s326461925', 's163793637'] | [9064.0, 9108.0] | [22.0, 27.0] | [96, 98] |
p02812 | u736995123 | 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)? | ['\nimport sys\ndef read_int(): return int(input())\ndef read_str_n(): return list(map(str, input().split()))\n\ndef error_print(*args): print(*args, file=sys.stderr)\ndef mt(f):\n import time\n \n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n \n error_print(e - s, \'sec\')\n return ret\n \n return wrap\n\n\n\n__DEBUG__ = False\n\nif __DEBUG__:\n N = 33\n S = list(\'ABCCABCBABCCABACBCBBABCBCBCBCABCB\')\nelse:\n N = read_int()\n S = read_str_n()\n\n@mt\ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n continue\n \n \n print(f"{count}")\n \nif __name__ == \'__main__\':\n solution()\n', 'def read_int(): return int(input())\nN = read_int()\ndef read_str(): return input().strip()\nS = list(read_str())\n \n__DEBUG__ = False\n \ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n # continue\n return count\n \n \nif __name__ == \'__main__\':\n \timport sys, threading\n \tsys.setrecursionlimit(200000)\n threading.stack_size(10240000)\n print(solution())\n \n', '\nimport sys\ndef read_int(): return int(input())\ndef read_str(): return input().strip()\ndef read_str_n(): return list(map(str, input().split()))\n\ndef error_print(*args): print(*args, file=sys.stderr)\ndef mt(f):\n import time\n \n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n \n error_print(e - s, \'sec\')\n return ret\n \n return wrap\n\n\n\n__DEBUG__ = False\n\nif __DEBUG__:\n N = 33\n S = list(\'ABCCABCBABCCABACBCBBABCBCBCBCABCB\')\nelse:\n N = read_int()\n # print(f"N = {N}")\n S = list(read_str())\n # print(f"S = {S}")\n \n\n@mt\ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n continue\n return count\n\n \nif __name__ == \'__main__\':\n solution()', '\nimport sys\ndef read_int(): return int(input())\ndef read_str_n(): return list(map(str, input().split()))\n\ndef error_print(*args): print(*args, file=sys.stderr)\ndef mt(f):\n import time\n \n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n \n error_print(e - s, \'sec\')\n return ret\n \n return wrap\n\n\n\n__DEBUG__ = False\n\nif __DEBUG__:\n N = 33\n S = list(\'ABCCABCBABCCABACBCBBABCBCBCBCABCB\')\nelse:\n N = read_int()\n S = read_str_n()\n\n@mt\ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n continue\n \n \n print(f"{count}")\n \nif __name__ == \'__main__\':\n solution()\n', 'N = int(input())\nS = str(input())\n \n__DEBUG__ = False\n \ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n # continue\n return count\n \n \nif __name__ == \'__main__\':\n \timport sys, threading\n \tsys.setrecursionlimit(200000)\n threading.stack_size(10240000)\n print(solution())\n \n', 'def read_int(): return int(input())\nN = read_int()\ndef read_str(): return input().strip()\nS = list(read_str())\n \n__DEBUG__ = False\n \ndef solution():\n count = 0 \n for i in range(N-2):\n if __DEBUG__: print(f"checking {S[i]} at index: {i}")\n if S[i] == \'A\':\n if S[i+1] == \'B\' and S[i+2] == \'C\':\n count += 1\n # continue\n return count\n \n \nif __name__ == \'__main__\':\n \timport sys\n \tsys.setrecursionlimit(200000)\n print(solution())\n ', "N = int(input())\nS = str(input())\n \n\n\ncount = 0 \nfor i in range(N-2):\n if S[i] == 'A':\n if S[i+1] == 'B' and S[i+2] == 'C':\n count += 1\n \nprint(count)\n \n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s029435382', 's381183720', 's496278744', 's926222264', 's953526788', 's985426571', 's347052448'] | [3064.0, 2940.0, 3064.0, 3064.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [897, 551, 978, 897, 474, 504, 171] |
p02812 | u739843002 | 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(len(input().split("ABC")) - 1)', 'print(len(input().split("ABC")))', 'n = input()\nprint(len(input().split("ABC")) - 1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s452928829', 's849856162', 's283121922'] | [9084.0, 9024.0, 9024.0] | [28.0, 28.0, 26.0] | [36, 32, 48] |
p02812 | u740047492 | 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(s))\n if s[i]=="A":\n if s[i+1]=="B":\n if s[i+2]=="C":\n count+=1\nprint(count)\n', 'n=int(input())\ns=input()\ncount=0\nfor i in range(n):\n if s[i]=="A":\n if i+1<n and s[i+1]=="B":\n if i+2<n and s[i+2]=="C":\n count+=1\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s042451483', 's064780666'] | [2940.0, 2940.0] | [17.0, 17.0] | [164, 180] |
p02812 | u747515887 | 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 = int(input())\n s = input()\n\n prev = ''\n c = 0\n\n for i in s:\n if prev == '':\n if i == 'A':\n prev = 'A'\n elif prev == 'A':\n if i == 'A':\n pass\n elif i == 'A':\n prev = 'B'\n else:\n i == ''\n elif prev == 'B':\n if i == 'A':\n prev = 'A'\n elif i == 'C':\n c += 1\n prev = ''\n else:\n prev = ''\n\n print(c)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n n = int(input())\n s = input()\n\n prev = ''\n c = 0\n\n for i in s:\n if prev == '':\n if i == 'A':\n prev = 'A'\n elif prev == 'A':\n if i == 'A':\n prev = 'A'\n elif i == 'B':\n prev = 'B'\n else:\n prev = ''\n elif prev == 'B':\n if i == 'A':\n prev = 'A'\n elif i == 'C':\n c += 1\n prev = ''\n else:\n prev = ''\n\n print(c)\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s839631541', 's799394077'] | [3060.0, 3060.0] | [18.0, 18.0] | [586, 594] |
p02812 | u749614185 | 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 (0,n-2):\n if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":\n ans+=1\nprint(ans)', 'N=int(input())\nS=input()\nans=0\nfor i in range (0,N-2):\n if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s943102595', 's639373221'] | [9140.0, 9152.0] | [26.0, 30.0] | [124, 124] |
p02812 | u752522099 | 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 = "ABC"\nprint(n.count(s2))', 'n = int(input())\ns = list(input())\ning_total = 0\n\nwhile i < n - 2\n if s[i] == "A":\n if s[i + 1] == "B":\n if s[i+2] == "C":\n ing_total+= 1\nprint(ing_total)\n', 'n = int(input())\ns = input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s577985219', 's835683636', 's681039959'] | [2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0] | [58, 191, 50] |
p02812 | u756693875 | 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\n\nfor i in range(n-2):\n if s[i]+s[i+1]+s[i+2] == 'abc':\n count += 1\n\nprint(count)", 'n = int(input())\ns = input()\ncount = 0\n\nfor i in range(len(s-2)):\n if s[i,i+2] == abc:\n count += 1\n\nprint(count)', "n = int(input())\ns = input()\ncount = 0\n\nfor i in range(n-2):\n if s[i]+s[i+1]+s[i+2] == 'ABC':\n count += 1\n\nprint(count)"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s804795971', 's868949798', 's224026410'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [129, 122, 129] |
p02812 | u763177133 | 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()\nl = len(s)\ns.replace('ABC', '')\n\nl2 = len(s)\n\nprint(l-l2 // 3)", "input()\ns = input()\nl = len(s)\ns.replace('ABC', '')\n \nl2 = len(s)\n \nprint((l-l2) // 3)", "input()\ns = input()\nl = len(s)\ns2 = s.replace('ABC', '')\n \nl2 = len(s2)\n \nprint((l-l2) // 3)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s019982392', 's821678947', 's813371212'] | [8924.0, 9044.0, 8956.0] | [29.0, 24.0, 28.0] | [82, 86, 92] |
p02812 | u766628743 | 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()\nflag = 0\nfor i in range(1,int(n)-1):\n\tif s[i-1]+s[i]+[i+1] = "ABC"\n \tflag++\nprint(flag) ', 'n = input()\ns = input()\nflag = 0\nfor i in range(1,int(n)-1):\n\tif s[i-1]+s[i]+[i+1] = "ABC"\n \tflag += 1\nprint(flag) ', 'n = input()\ns = input()\nflag = 0\nfor i in range(1,n-1):\n\tif s[i-1]+s[i]+[i+1] = "ABC":\n \tflag++\nprint(flag) ', 'S = input()\nprint(S.count("ABC"))', '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)', ' n = input()\n s = input()\n flag = 0\n for i in range(1,int(n)-1):\n \tif s[i-1]+s[i]+[i+1] = "ABC":\n \tflag += 1\n print(flag) ', 'n = input()\ns = input()\nflag = 0\nfor i in range(1,n-1):\n\tif s[i-1]+s[i]+[i+1] = "ABC"\n \tflag=flag+1\nprint(flag) ', '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)', 'N = int(input())\nS = input()\nprint(S.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s088860504', 's304104078', 's375392883', 's467631972', 's598363702', 's690788821', 's736424102', 's838845659', 's954344219'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [120, 123, 116, 33, 133, 152, 120, 133, 50] |
p02812 | u768890894 | 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(N.count("ABC"))', 'N=int(input())\nS=input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s608997963', 's137095466'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 46] |
p02812 | u773686010 | 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)? | ['moji = str(input())\nprint(moji.count("ABC"))', 'N = int(input())\nmoji = str(input())\nprint(moji.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s532428509', 's891478730'] | [9016.0, 9124.0] | [25.0, 27.0] | [44, 61] |
p02812 | u785723272 | 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\n\n\nfor i in range(n-2):\n if s[i:i+3] == "ABC":\n res += 1\n\nprint(ans)', "n = int(input())\ns = input()\nans = 0\n\n\nfor i in range(n-2):\n if s[i:i+2] == 'ABC':\n res += 1\n\nprint(ans)", "n = int(input())\n s = input()\n ans = 0\n for i in range(n - 2):\n if s[i:i+3] == 'ABC':\n ans += 1 \n print(ans) ", 'n = int(input())\ns = input()\nans = 0\n\n\nfor i in range(n-2):\n if s[i:i+3] == "ABC":\n res += 1\n\nprint(ans)', "n = int(input())\ns = input()\nans = 0\n\n\nfor i in range(n):\n if s[i:i+3] == 'ABC':\n res += 1\n\nprint(ans)", "n = int(input())\ns = input()\n\nprint(s.count('ABC'))\n"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s173144212', 's263305698', 's827331789', 's944048313', 's950626585', 's480777212'] | [3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [114, 114, 121, 114, 112, 52] |
p02812 | u796708718 | 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)? | ['txt = input().split("A")\nn = 0\nfor cnt in txt:\n if cnt == "ABC":\n n += 1\nprint(n)', 'N = int(input())\ntxt = input().split("ABC")\nprint(str(N - len(txt) /3))', 'N = int(input())\ntxt = input().split("ABC")\nprint(N - len(txt) /3)', 'N = int(input())\ntxt = input().split("ABC")\nprint("(N - len(txt)) /3")', 'N = int(input())\nS = lst(input())\n\ncnt = 0\n\nfor i in range(0,4):\n if S[i] == "A" and S[i+1] == "C" and S[i+2] == "C":\n cnt += 1\n \nprint(cnt)', 'N = int(input())\nS = list(input())\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'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s307851961', 's625458242', 's663325021', 's872048374', 's968757857', 's951361667'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [85, 71, 66, 70, 147, 151] |
p02812 | u797550216 | 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)? | ["for i in range(0,n-2):\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n c += 1\n \nprint(c)", "n = int(input())\ns = input()\n\nc = 0\n\nfor i in range(0,n-2):\n if s[i] == 'A':\n if s[i+1] == 'B':\n if s[i+2] == 'C':\n c += 1\n \nprint(c)"] | ['Runtime Error', 'Accepted'] | ['s809911324', 's488800735'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 176] |
p02812 | u808705768 | 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() # Do Not use\nS = input()\nprint(S.find("ABC"))', 'N = input() # Do Not use\nS = input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s640966799', 's850672316'] | [2940.0, 2940.0] | [17.0, 17.0] | [57, 58] |
p02812 | u808799019 | 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'] | ['s736969062', 's020141696'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 50] |
p02812 | u809192419 | 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()\ni = s.find('ABC')\nn = 0\nwhile i != -1:\n i = s.find('ABC')\n s = s[i + 3:]\nprint(n)\n", "input()\ns = input()\ni = s.find('ABC')\nn = 0\nwhile i != -1:\n i = s.find('ABC'[i+3:])\nprint(n)\n", "input()\ns = input()\nn = 0\ni = 0\nwhile i != -1:\n i = s.find('ABC')\n s = s[i+3:]\n n += 1\nprint(n-1)\n"] | ['Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s431387813', 's546519324', 's295951646'] | [2940.0, 2940.0, 2940.0] | [18.0, 2104.0, 18.0] | [104, 94, 101] |
p02812 | u811853862 | 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)? | ["# -*- coding: utf-8 -*-\ncnt = int(input())\nstr = input()\nprint(srt.count('ABC'))", "cnt = int(input())\ns = input()\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s056111046', 's127442293'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 52] |
p02812 | u816070625 | 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().split()\nprint(B.count("ABC"))\n', 'A=int(input())\nB=input()\nprint(B.count("ABC"))\n'] | ['Wrong Answer', 'Accepted'] | ['s178625042', 's557089934'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 47] |
p02812 | u821989875 | 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)'] | ['Runtime Error', 'Accepted'] | ['s793637809', 's960033514'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 105] |
p02812 | u823885866 | 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)? | ["import sys\nn = int(sys.stdin.readline())\ns = sys.stdin.readline().strip()\ni = 0\ncnt = 0\nwhile i <= n -3:\n if s[i:i+3] == 'ABC':\n cnt += 1\nprint(cnt)", "import sys\nn = int(sys.stdin.readline())\ns = sys.stdin.readline().strip()\nprint(s.count('ABC'))"] | ['Time Limit Exceeded', 'Accepted'] | ['s306258908', 's641617179'] | [2940.0, 2940.0] | [2104.0, 17.0] | [152, 95] |
p02812 | u830054172 | 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-2):\n if s[i:i+3] == "ABC":\n cnt += 1\n print(i)\nprint(cnt)', 'n = int(input())\ns = input()\ncnt = 0\nfor i in range(0, n-2):\n if s[i:i+3] == "ABC":\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s325882510', 's554297331'] | [2940.0, 2940.0] | [17.0, 18.0] | [127, 114] |
p02812 | u830162518 | 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'] | ['s458219781', 's673907920'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 46] |
p02812 | u831835224 | 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 = int(input())\n \nword = input()\n \ncounter = 0\nfor i in range(len(word)):\n if len(word[i:]) >= 3:\n print(word[i:i+3])\n if word[i:i+3] == 'abc':\n counter += 1\n \nprint(counter)", "l = int(input())\n \nword = input()\n \ncounter = 0\nfor i in range(len(word)):\n if len(word[i:]) >= 3:\n if word[i:i+3] == 'abc':\n counter += 1\n \nprint(counter)", "l = int(input())\n\nword = input()\n\ncounter = 0\nfor i in range(len(word)):\n if len(word[i:]) >= 3:\n if word[i:i+2] == 'abc':\n counter += 1\n \nreturn counter", "l = int(input())\n \nword = input()\n \ncounter = 0\nfor i in range(len(word)-2):\n if word[i:i+3] == 'ABC':\n counter += 1\n \nprint(counter)"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s053484988', 's354695891', 's383963244', 's579229857'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 19.0, 18.0, 17.0] | [192, 169, 167, 142] |
p02812 | u835924161 | 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'))", "n=input()\nprint(input().count('ABC'))"] | ['Wrong Answer', 'Accepted'] | ['s650431517', 's466900344'] | [2940.0, 2940.0] | [17.0, 17.0] | [27, 37] |
p02812 | u841599623 | 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()\nc = 0\nfor i in range(N-2):\n S[i] + S[i+1] + S[i+2] == 'ABC'\n c += 1\nprint(c)\n", "N = int(input())\nS = input()\nc = 0\nfor i in range(N-2):\n if (S[i] + S[i+1] + S[i+2]) == 'ABC':\n c += 1\nprint(c)"] | ['Wrong Answer', 'Accepted'] | ['s337192902', 's189628533'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 115] |
p02812 | u842878495 | 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'] | ['s254725123', 's376670883'] | [2940.0, 9144.0] | [17.0, 29.0] | [33, 50] |
p02812 | u843845221 | 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 = input().split()\nk = int(k) * 500\nif (k >= int(x)):\n print("Yes")\nelse:\n print("No")', 'n = input()\ns = input()\nif (len(s) == int(n)):\n print(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s228591970', 's812514833'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 72] |
p02812 | u847033024 | 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 = input()\nprint(a.count('ABC'))", "a = input()\nb = input()\nprint(b.count('ABC'))\n"] | ['Wrong Answer', 'Accepted'] | ['s708648429', 's204549693'] | [9028.0, 9080.0] | [25.0, 27.0] | [33, 46] |
p02812 | u849756457 | 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()\nnewS = S.replace("ABC", "")\nprint(S, newS)\nprint((len(S) - len(newS)) // 3)', '_ = input()\nS = input()\nnewS = S.replace("ABC", "")\nprint((len(S) - len(newS)) // 3)'] | ['Wrong Answer', 'Accepted'] | ['s917311261', 's255074096'] | [9104.0, 9012.0] | [28.0, 24.0] | [99, 84] |
p02812 | u854612823 | 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 = list(int(input())\nS = list(input())\nS.count('ABC')", "N = int(input())\nS = input()\nS.count('ABC')", "S = input()\nS.count('ABC')", "n = int(input())\ns = input()\nprint (s.count('ABC'))"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s258773875', 's416445819', 's672324252', 's384330305'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 19.0, 18.0] | [54, 43, 26, 51] |
p02812 | u863370423 | 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)? | ["s1=input()\n\ncount=0\nfor i in range ((len(s1))-2):\n if(s1[i]=='A' and s1[i+1]=='B' and s1[i+2]=='C'):\n count=count+1\n \nprint(count)\n", "n=input()\ns1= input()\n\ncount=0\nfor i in range(len(s1)-2):\n if(s1[i]=='A' and s1[i+1]=='B' and s1[i+2]=='C'):\n count=count+1\n\nprint(count)"] | ['Wrong Answer', 'Accepted'] | ['s636151235', 's215416612'] | [8904.0, 8904.0] | [26.0, 29.0] | [144, 148] |
p02812 | u864276028 | 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()\nctr = 0\nfor i in range (N):\n if S(i) == 'A' and S(i+1) == 'B' and S(i+2) == 'C':\n ctr += 1\nprint(ctr)", "N = int(input())\nS = input()\nprint(S.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s760083655', 's635138082'] | [9108.0, 9136.0] | [27.0, 31.0] | [134, 50] |
p02812 | u868982936 | 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[k:k+3] == "ABC":\n count +=1\nprint("%d"%(count)) ', 'N = int(input())\nS = str(input())\n\ncount = 0\nfor i in range(N):\n if i == "ABC":\n count += 1\nprint("%d"%(count) ', "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)"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s165380990', 's195642163', 's963423381', 's169410368'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [122, 118, 105, 105] |
p02812 | u869267486 | 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=map(int,input())\ns=str(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\nprint(count)', 'n=map(int,input())\ns=list(map(str,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\nprint(count)', 'n=int(input())\ns=str(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\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s903254067', 's907497920', 's987522721'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [172, 182, 168] |
p02812 | u870684607 | 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\nif N >= 3 and N <= 50:\n\tfor i in range(1,N-1):\n \t\tif S[i-1] + S[i] + s[i+1] == "ABC":\n \tcount = count + 1\nprint (count)', "S = input()\nN = int(input())\ncount = 0\nS = S.split('ABC')\nfor i in S:\n if i == '':\n count += 1\n else: continue\nprint (count)", "S = input()\nN = int(input())\ncount = 0\nS = S.split('ABC')\nfor i in S:\n if i == '':\n count += 1\n else: continue\nprint (count)", 'N = int(input())\nS = input()\ncount = 0\nfor i in range(1,N-1):\n if S[i-1] + S[i] + s[i+1] == "ABC":\n count = count + 1\nprint (count)', 'N = int(input)\nS = input()\ncount = 0\nfor i in range(1,N-1):\n if S[i-1] + S[i] + s[i+1] == "ABC":\n count += 1\n\tprint (count)', "S = input()\nN = int(input())\ncount = 0\na = S.split('ABC')\nfor i in a:\n if i == '':\n count += 1\n else: continue\nprint (count)", 'N = int(input)\nS = input()\ncount = 0\nfor i in range(1,N-1):\n if S[i-1] + S[i] + s[i+1] == "ABC":\n count = count + 1\nprint (count)', "S = input()\nN = int(input())\ncount = 0\nd = ''\nfor j in S:\n d += j\n if len(d) == N:break\na = d.split('ABC')\nfor i in a:\n if i == '':\n count += 1\n else: continue\nprint (count)\n", "N = int(input())\nS = input()\ncount = 0\nfor i in range(1, N - 1):\n if S[i-1] + S[i] + S[i + 1] = 'ABC':\n count += 1\nprint (count)", "S = input()\nN = int(input())\ncount = 0\nif N >= 3 and N <= 50:\n\td = ''\n\tfor j in S:\n \td += j\n \tif len(d) == N:break\n\ta = d.split('ABC')\n\tfor i in a:\n \tif i == '':\n \tcount += 1\n \telse: continue\nprint (count)", 'N = int(input())\nS = input()\nprint(S.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s043529053', 's114431852', 's334805547', 's393128378', 's438287439', 's497766084', 's596245372', 's807654315', 's945500911', 's992205740', 's331370017'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [160, 137, 137, 135, 127, 137, 133, 193, 132, 224, 50] |
p02812 | u876414382 | 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\nif int(n) >= 3 and int(n) =< 50:\n print(s.count('ABC'))", "n = int(input())\ns = input()\n\nprint(s.count('ABC'))"] | ['Runtime Error', 'Accepted'] | ['s925626173', 's005081045'] | [2940.0, 2940.0] | [18.0, 18.0] | [83, 51] |
p02812 | u879866069 | 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().split()[1]\nprint(s.count("ABC"))', 's = input().split()[1]\ns.count("ABC")', 's = input()\ns = input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s683044053', 's900978439', 's233552582'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [44, 37, 45] |
p02812 | u884601206 | 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', 'n=int(input())\ns=input()\nans=0\nfor i in range(n-2):\n if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":\n ans+=1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s040704576', 's688927011'] | [2940.0, 3064.0] | [17.0, 17.0] | [32, 122] |
p02812 | u886459614 | 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\tif S[i]+S[i+1]+S[i+2]=='ABC':\n\t\tans+=1\nprint(ans)", 'n=int(input())\ns=input()\nans=0\nfor i in range(n-2):\n\tif s[i]+s[i+1]+s[i+2]=="ABC":\n\t\tans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s890682627', 's870796009'] | [2940.0, 2940.0] | [17.0, 18.0] | [102, 104] |
p02812 | u895536055 | 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 = 0\n\nfor i in range(2, len(S)):\n if S[i-2] == 'A' and S[i-1] == 'B' and S[i] == 'C':\n ans += 1\nprint(ans)", "S = input()\nans = 0\n\nfor i in range(2, len(S) + 1):\n if S[i-2] == 'A' and S[i-1] == 'B' and S[i] == 'C':\n ans += 1\nprint(ans)\n", 'N = input()\nS = input()\nprint(S.count("ABC"))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s204670182', 's550344041', 's691531836'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [125, 130, 45] |
p02812 | u896181359 | 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'))"] | ['Wrong Answer', 'Accepted'] | ['s223278649', 's771322252'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 52] |
p02812 | u898967808 | 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\nquery = 'ABC'\nans = 0\ni = 0 \nwhile i<n:\n i = s.find(query,i)\n print(i)\n if i>=0:\n ans +=1\n i+=1\n else:\n break \n\nprint(ans) ", "n = int(input())\ns = input()\n\nquery = 'ABC'\nans = 0\ni = 0 \nwhile i<n:\n i = s.find(query,i) \n if i>=0:\n ans +=1\n i+=1\n else:\n break \n\nprint(ans) "] | ['Wrong Answer', 'Accepted'] | ['s229170302', 's822195457'] | [3060.0, 3060.0] | [17.0, 17.0] | [172, 163] |
p02812 | u901582103 | 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()\nc=0\nfor i in range(n - 2):\n print(s[i:i + 3])\n if s[i:i + 3] == 'ABC':\n c += 1\nprint(c)", "n = int(input())\ns = input()\nc=0\nfor i in range(n - 2):\n print(s[i:i + 3])\n if s[i:i + 3] == 'ABC':\n c += 1\nprint(c)", "n = int(input())\ns = input()\nc=0\nfor i in range(n - 2):\n if s[i:i + 3] == 'ABC':\n c += 1\nprint(c)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s017238743', 's168800515', 's500762072'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [129, 129, 107] |
p02812 | u904639778 | 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)? | ["import re\n\nn = int(input())\ns = input()\n\nabc = re.compile('ABC')\n\ncount = abc.findall(s)\nprint(count)", "import re\n \nn = int(input())\ns = input()\n \nabc = re.compile('ABC')\n \ncount = len(abc.findall(s))\nprint(count)"] | ['Wrong Answer', 'Accepted'] | ['s849098767', 's505766431'] | [3188.0, 3188.0] | [19.0, 19.0] | [101, 109] |
p02812 | u914330401 | 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-2):\n print(s[i:i+3])\n if s[i:i+3] == "ABC":\n count += 1\nprint(count)\n', 'n = int(input())\ns = input()\ncount = 0\nfor i in range(n-2):\n if s[i:i+3] == "ABC":\n count += 1\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s376390616', 's985668117'] | [2940.0, 2940.0] | [17.0, 18.0] | [130, 112] |
p02812 | u914671452 | 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()\nx = list(s)\ny = 0\na = 0\nwhile y <= n - 3:\n z = x[y] + x[y + 1] + x[y + 2]\n if z == "abc":\n a += 1\n y += 1\n else:\n a += 0\n y += 1\n\nprint(a)\n', 'n = int(input())\ns = input()\nx = list(s)\ny = 0\na = 0\nwhile y <= n - 3:\n z = x[y] + x[y + 1] + x[y + 2]\n if z == "ABC":\n a += 1\n y += 1\n else:\n a += 0\n y += 1\nprint(a)'] | ['Wrong Answer', 'Accepted'] | ['s322783068', 's216645183'] | [3060.0, 2940.0] | [18.0, 17.0] | [183, 181] |
p02812 | u918363735 | 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()\nx = 0\nfor i in range(n - 2)\n\tif s[i:3] == "ABC"\n \t\tx += 1', 'n = int(input())\ns = input()\nx = 0\n\nfor i in range(n-2):\n if s[i:i+3] == "ABC":\n x += 1\n\nprint(x)'] | ['Runtime Error', 'Accepted'] | ['s282941132', 's836050939'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 107] |
p02812 | u922952729 | 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\nS=S.replace("ABC","")\nprint((N-len(S))/3)\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\n\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s121366977', 's586234438'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 110] |
p02812 | u923270446 | 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()\nlist = [str(x) for x in S]\nindex = 0\nabc = 0\nfor alphabet in list:\n if alphabet == "A" and list[index + 1] == "B" and list[index + 2] == "C":\n abc += 1\n index += 1\nif index != N - 1:\n break\nprint(abc)', 'n = int(input())\ns = input()\nprint(count("ABC"))', 'n = int(input())\ns = input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s178124016', 's930435624', 's088907952'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [235, 48, 50] |
p02812 | u923744479 | 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)? | ['string = input()\nprint(string.count("ABC")) ', 'n = int(input())\ns = str(input().upper())\nprint(s.count("ABC"))'] | ['Wrong Answer', 'Accepted'] | ['s115823758', 's887670657'] | [3064.0, 2940.0] | [17.0, 18.0] | [44, 63] |
p02812 | u932864155 | 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()\nlength = len(S)\nnum = 0\nprint(length)\nfor i in range(length-2) :\n if S[i:i+3] == "ABC" :\n num += 1\nprint(num)', 'N = int(input())\nS = input()\nlength = len(S)\nnum = 0\nfor i in range(length-2) :\n if S[i:i+3] == "ABC" :\n num += 1\nprint(num)'] | ['Wrong Answer', 'Accepted'] | ['s720986919', 's274822272'] | [2940.0, 2940.0] | [17.0, 18.0] | [142, 128] |
p02812 | u935840914 | 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.find('ABC'))", 'n = int(input())\ns = input()\nprint(s.count("ABC"))\n'] | ['Wrong Answer', 'Accepted'] | ['s579344210', 's188962369'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 51] |
p02812 | u939026953 | 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(n-3):\n clipped_S = S[i:i+2]\n if clipped_S == "ABC"\n A += 1\nprint(A)', 'n = int(input())\nS = input()\nA = 0\nfor i in range(n-2):\n clipped_S = S[i:i+3]\n if clipped_S == "ABC":\n A += 1\nprint(A)'] | ['Runtime Error', 'Accepted'] | ['s564804005', 's912216237'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 123] |
p02812 | u940402366 | 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()\na=0\na=s.count('ABC')\nprint(a)", "n=int(input())\ns=input()\na=s.count('ABC')\nprint(a)"] | ['Wrong Answer', 'Accepted'] | ['s541333620', 's150500519'] | [2940.0, 2940.0] | [17.0, 17.0] | [39, 50] |
p02812 | u940652437 | 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=int(input())\nprint(s.count("ABC"))', 'n=int(input())\ns=input()\nprint(s.count("ABC"))'] | ['Runtime Error', 'Accepted'] | ['s943645688', 's475577029'] | [9140.0, 9092.0] | [24.0, 28.0] | [51, 46] |
p02812 | u944015274 | 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)? | ["import re\n\ninput()\nprint(len(re.findall('ABC', input()))\n", "import re\n\ninput()\nprint(len(re.findall(input(), 'ABC'))", "import re\n\ninput()\nprint(len(re.findall('ABC', input())))\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s560840841', 's925052465', 's223430870'] | [2940.0, 3064.0, 3188.0] | [17.0, 17.0, 19.0] | [57, 56, 58] |
p02812 | u945140822 | 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())\nword = input()\nif len(word) >= num:\n print(word[0:num].count('ABC'))\nprint(0) \n \n", "num = int(input())\nword = input()\nif len(word) >= num:\n print(word[0:num].count('ABC'))\nelse:\n print(0) "] | ['Wrong Answer', 'Accepted'] | ['s225478132', 's677501615'] | [2940.0, 2940.0] | [18.0, 18.0] | [114, 112] |
p02812 | u951985579 | 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'] | ['s526462837', 's980687563'] | [8984.0, 9068.0] | [30.0, 27.0] | [33, 50] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.