結果
問題 | No.1005 BOT対策 |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 14:20:04 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,399 bytes |
コンパイル時間 | 2,258 ms |
コンパイル使用メモリ | 82,288 KB |
実行使用メモリ | 89,728 KB |
最終ジャッジ日時 | 2024-04-18 12:57:38 |
合計ジャッジ時間 | 5,843 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
89,496 KB |
testcase_01 | AC | 139 ms
89,728 KB |
testcase_02 | AC | 137 ms
89,220 KB |
testcase_03 | AC | 137 ms
89,124 KB |
testcase_04 | WA | - |
testcase_05 | AC | 135 ms
89,652 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 133 ms
89,608 KB |
testcase_09 | AC | 137 ms
89,388 KB |
testcase_10 | AC | 134 ms
89,580 KB |
testcase_11 | AC | 143 ms
89,320 KB |
testcase_12 | WA | - |
testcase_13 | AC | 137 ms
89,608 KB |
testcase_14 | AC | 141 ms
89,536 KB |
testcase_15 | AC | 136 ms
89,584 KB |
testcase_16 | AC | 134 ms
89,256 KB |
testcase_17 | AC | 134 ms
89,592 KB |
testcase_18 | AC | 131 ms
89,324 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 132 ms
89,612 KB |
testcase_22 | AC | 134 ms
89,560 KB |
testcase_23 | AC | 138 ms
89,528 KB |
testcase_24 | AC | 140 ms
89,584 KB |
testcase_25 | AC | 138 ms
89,608 KB |
testcase_26 | AC | 139 ms
89,628 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 132 ms
89,460 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): S = input() T = input() print(S.count(T)) if __name__ == '__main__': main()