#1049026 (PyPy3) No.434 占い

• 問題: No.434 占い
• ユーザー: 已经死了
• 提出日時: 2025-03-03 19:50:56
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 256 ms / 2,000 ms
• コード長: 2,952 bytes
• コンパイル時間: 375 ms
• コンパイル使用メモリ: 82,644 KB
• 実行使用メモリ: 99,728 KB
• 最終ジャッジ日時: 2025-03-03 19:51:07
• 合計ジャッジ時間: 8,426 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 27

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
import os,sys,random,threading
#sys.exit() 退出程序
#sys.setrecursionlimit(10**6) #调整栈空间
from random import randint,choice,shuffle
#randint(a,b)从[a,b]范围随机选择一个数
#choice(seq)seq可以是一个列表,元组或字符串,从seq中随机选取一个元素
#shuffle(x)将一个可变的序列x中的元素打乱
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,迭代对象)
from bisect import bisect_left,bisect_right
#bisect_left(x) 大于等于x的第一个下标
#bisect_right(x) 大于x的第一个下标
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)用a序列生成一个累积迭代器，一般list化前面放个[0]做前缀和用
#combinations(a,k)a序列选k个 组合迭代器
#permutations(a,k)a序列选k个 排列迭代器
from heapq import  heapify,heappop,heappush
#heapify将列表转为堆
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#小写字母，大写字母，十进制数字
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceil向上取整，floor向下取整 ，sqrt开方 ，factorial阶乘
from decimal import Decimal,getcontext
#Decimal(s) 实例化Decimal对象,一般使用字符串
#getcontext().prec=100 修改精度
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)]  # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)]  # →↘↓↙←↖↑↗
# https://github.com/EndlessCheng/codeforces-go/blob/master/copypasta/math_comb.go
# https://www.codechef.com/practice-old/tags/combinatorics
# https://yukicoder.me/problems?tags=%e7%b5%84%e5%90%88%e3%81%9b
mod = 9
N=10**5+10
fac=[0]*N
fac[1]=1
c3=[0]*N
a=list(range(N))
for i in range(2,N):
    c3[i]=c3[i-1]
    while a[i]%3==0:
        c3[i]+=1
        a[i]//=3
    fac[i]=fac[i-1]*a[i]%mod
ifac=[0]*N
ifac[N-1]=pow(fac[N-1],-1,mod)
for i in range(N-2,-1,-1):
    ifac[i]=ifac[i+1]*a[i+1]%mod
p3=[1]*N
for i in range(1,N):
    p3[i]=p3[i-1]*3%mod
def C(n: int, k: int) -> int:  #不重复组合数，n个不同物品不重复无序的取出k个
    res=fac[n]*ifac[k]*ifac[n-k]%mod
    t3=c3[n]-c3[k]-c3[n-k]
    return res*p3[t3]%mod
t=ii()
for _ in range(t):
    s=input()
    s=[int(i) for i in s]
    if len(s)==1:
        print(s[0])
    elif sum(s)==0:
        print(0)
    else:
        res=0
        for i,c in enumerate(s):
            res+=C(len(s)-1,i)*c
            res%=9
        if res==0:
            res=9
        print(res)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX