結果

問題 No.129 お年玉(2)
ユーザー バカらっく
提出日時 2019-10-03 08:17:32
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 1,700 ms / 5,000 ms
コード長 1,872 bytes
コンパイル時間 414 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 13,696 KB
最終ジャッジ日時 2024-10-03 06:06:59
合計ジャッジ時間 23,828 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# -*- coding:utf-8 -*-
def getPrimeList(num):
    flags = [False for i in range(num + 1)]
    primeList = []
    for i in range(2, num + 1):
        if flags[i]:
            continue
        lastIndex = int(num / i)
        for j in range(1, lastIndex + 1):
            if i * j >= len(flags):
                break
            flags[j * i] = True
        primeList.append(i)
    return primeList
def getPrimeDic(num, primeList):
    current = num
    dic = {}
    if num <=1:
        return dic
    for i in primeList:
        if current < i:
            break
        if current % i != 0:
            continue
        dic[i] = 0
        while current % i == 0:
            current /= i
            dic[i] += 1
    return dic
def dicPlusDic(dic1:dict, dic2:dict):
    dic3 = {}
    for (i,v) in dic1.items():
        dic3[i] = v
    for(i,v) in dic2.items():
        if i in dic3.keys():
            dic3[i] += v
        else:
            dic3[i] = v
    return dic3
def dicMinusDic(dic1:dict, dic2:dict):
    dic3 = {}
    for (i,v) in dic1.items():
        dic3[i] = v
    for(i,v) in dic2.items():
        if i in dic3.keys():
            dic3[i] -= v
            if dic3[i] <= 0:
                del dic3[i]
    return dic3
yosan = int(input())
kodomo = int(input())
atari = int(yosan / 1000) % kodomo
if atari == 0:
    print(1)
    exit(0)
primeList = getPrimeList(kodomo)
primeCount = [getPrimeDic(i, primeList) for i in range(0, kodomo + 1)]
ansDic = {}
for i in [kodomo - j for j in range(atari)]:
    if i <= 1:
        continue
    ansDic = dicPlusDic(ansDic, primeCount[i])
sortDic = {}
for i in range(atari + 1):
    if i <= 1:
        continue
    sortDic = dicPlusDic(sortDic, primeCount[i])
ansDic = dicMinusDic(ansDic, sortDic)
mod = 1000000000
ans = 1
for (i,v) in ansDic.items():
    for j in range(v):
        ans *= i
print(ans%mod)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0