#503869 (PyPy3) No.1081 和の和

• 問題: No.1081 和の和
• ユーザー: 👑 Kazun
• 提出日時: 2020-06-27 03:49:35
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 49 ms / 2,000 ms
• コード長: 2,733 bytes
• コンパイル時間: 146 ms
• コンパイル使用メモリ: 81,892 KB
• 実行使用メモリ: 60,672 KB
• 最終ジャッジ日時: 2024-07-05 08:36:56
• 合計ジャッジ時間: 1,307 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 8

ソースコード

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
104
105
106
107
108
109
110
111
112
class Modulo_Error(Exception):
    pass
class Modulo():
    def __init__(self,a,n):
        self.a=a%n
        self.n=n
    def __str__(self):
        return "{} (mod {})".format(self.a,self.n)
    #+,-
    def __pos__(self):
        return self
    def __neg__(self):
        return  Modulo(-self.a,self.n)
    #等号,不等号
    def __eq__(self,other):
        if isinstance(other,Modulo):
            return (self.a==other.a) and (self.n==other.n)
        elif isinstance(other,int):
            return (self-other).a==0
    def __neq__(self,other):
        return not(self==other)
    
    #加法
    def __add__(self,other):
        if isinstance(other,Modulo):
            if self.n!=other.n:
                raise Modulo_Error("異なる法同士の演算です.")
            return Modulo(self.a+other.a,self.n)
        elif isinstance(other,int):
            return Modulo(self.a+other,self.n)
    def __radd__(self,other):
        if isinstance(other,int):
            return Modulo(self.a+other,self.n)
        
    #減法
    def __sub__(self,other):
        return self+(-other)
    def __rsub__(self,other):
        if isinstance(other,int):
            return -self+other
        
    #乗法
    def __mul__(self,other):
        if isinstance(other,Modulo):
            if self.n!=other.n:
                raise Modulo_Error("異なる法同士の演算です.")
            return Modulo(self.a*other.a,self.n)
        elif isinstance(other,int):
            return Modulo(self.a*other,self.n)
        
    def __rmul__(self,other):
        if isinstance(other,int):
            return Modulo(self.a*other,self.n)
        
    #Modulo逆数
    def Modulo_Inverse(self):
        x0, y0, x1, y1 = 1, 0, 0, 1
        a,b=self.a,self.n
        while b != 0:
            q, a, b = a // b, b, a % b
            x0, x1 = x1, x0 - q * x1
            y0, y1 = y1, y0 - q * y1
        if a!=1:
            raise Modulo_Error("{}の逆数が存在しません".format(self))
        else:
            return Modulo(x0,self.n)
        
    #除法
    def __truediv__(self,other):
        return self*other.Modulo_Inverse()
    #累乗
    def __pow__(self,m):
        u=abs(m)
        r=Modulo(1,self.n)
        while u>0:
            if u%2==1:
                r*=self
            self*=self
            u=u>>1
        if m>=0:
            return r
        else:
            return r.Modulo_Inverse()
#-----------------------------------------------------------------------------
M=10**9+7
def f(L):
    if len(L)<=1:
        return L[0]
    else:
        return f([L[i]+L[i+1] for i in range(len(L)-1)])
def g(N):
    return Modulo(int(N),M)
N=int(input())
A=list(map(g,input().split()))
print(f(A).a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX