結果
問題 | No.1329 Square Sqsq |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 15:02:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 254 ms / 2,000 ms |
コード長 | 1,397 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 87,340 KB |
実行使用メモリ | 92,680 KB |
最終ジャッジ日時 | 2023-08-17 07:06:57 |
合計ジャッジ時間 | 7,909 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
92,556 KB |
testcase_01 | AC | 254 ms
92,460 KB |
testcase_02 | AC | 247 ms
92,476 KB |
testcase_03 | AC | 244 ms
92,444 KB |
testcase_04 | AC | 244 ms
92,332 KB |
testcase_05 | AC | 238 ms
92,644 KB |
testcase_06 | AC | 239 ms
92,576 KB |
testcase_07 | AC | 243 ms
92,464 KB |
testcase_08 | AC | 245 ms
92,660 KB |
testcase_09 | AC | 254 ms
92,620 KB |
testcase_10 | AC | 253 ms
92,664 KB |
testcase_11 | AC | 250 ms
92,680 KB |
testcase_12 | AC | 254 ms
92,432 KB |
testcase_13 | AC | 250 ms
92,348 KB |
testcase_14 | AC | 250 ms
92,616 KB |
testcase_15 | AC | 250 ms
92,432 KB |
testcase_16 | AC | 242 ms
92,504 KB |
testcase_17 | AC | 245 ms
92,484 KB |
testcase_18 | AC | 244 ms
92,444 KB |
testcase_19 | AC | 246 ms
92,612 KB |
testcase_20 | AC | 251 ms
92,588 KB |
testcase_21 | AC | 247 ms
92,592 KB |
testcase_22 | AC | 245 ms
92,500 KB |
testcase_23 | AC | 248 ms
92,348 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(): N = input() print(int(ceil(len(N)/2))) if __name__ == '__main__': main()