結果

問題 No.1946 ロッカーの問題
ユーザー McGregorshMcGregorsh
提出日時 2022-07-28 18:48:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,941 ms / 3,000 ms
コード長 2,600 bytes
コンパイル時間 396 ms
コンパイル使用メモリ 87,084 KB
実行使用メモリ 140,540 KB
最終ジャッジ日時 2023-09-25 11:43:54
合計ジャッジ時間 24,183 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 234 ms
92,304 KB
testcase_01 AC 220 ms
92,340 KB
testcase_02 AC 2,933 ms
95,452 KB
testcase_03 AC 1,976 ms
127,416 KB
testcase_04 AC 2,941 ms
95,436 KB
testcase_05 AC 1,988 ms
95,000 KB
testcase_06 AC 2,285 ms
95,372 KB
testcase_07 AC 1,666 ms
94,736 KB
testcase_08 AC 624 ms
113,328 KB
testcase_09 AC 1,746 ms
124,552 KB
testcase_10 AC 1,453 ms
140,540 KB
testcase_11 AC 267 ms
93,844 KB
testcase_12 AC 931 ms
97,572 KB
testcase_13 AC 230 ms
92,468 KB
testcase_14 AC 232 ms
92,196 KB
testcase_15 AC 337 ms
93,772 KB
testcase_16 AC 228 ms
92,368 KB
testcase_17 AC 764 ms
113,448 KB
testcase_18 AC 1,668 ms
135,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

###約数列挙###

def make_divisors(n):
	  lower_divisors, upper_divisors = [], []
	  i = 1
	  while i * i <= n:
	  	  if n % i == 0:
	  	  	  lower_divisors.append(i)
	  	  	  if i != n // i:
	  	  	  	  upper_divisors.append(n//i)
	  	  i += 1
	  return lower_divisors + upper_divisors[::-1]


###順列###

def nPr(n, r):
	  npr = 1
	  for i in range(n, n-r, -1):
	  	  npr *= i
	  return npr


###組合せ###

def nCr(n, r):
	  factr = 1
	  r = min(r, n - r)
	  for i in range(r, 1, -1):
	  	  factr *= i
	  return nPr(n, r)/factr



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
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, m = i_map()
   A = i_list()
   a_set = set()
   for i in range(m):
   	  a_set.add(A[i])
   
   counts = [0] * (n+1)
   for i in range(1, n+1):
   	  lines = make_divisors(i)
   	  for j in range(len(lines)):
   	  	  counts[lines[j]] += 1
   
   ans = 0
   for i in range(n, 0, -1):
   	  if counts[i] % 2 == 0:
   	  	  if i in a_set:
   	  	  	  ans += 1
   	  	  	  nums = make_divisors(i)
   	  	  	  for j in range(len(nums)):
   	  	  	  	  counts[nums[j]] -= 1
   	  else:
   	  	  if i not in a_set:
   	  	  	  ans += 1
   	  	  	  nums = make_divisors(i)
   	  	  	  for j in range(len(nums)):
   	  	  	  	  counts[nums[j]] -= 1
   	  #print(counts)
   print(ans)
   	  	  
   	  
if __name__ == '__main__':
    main()
0