#568396 (Crystal) No.573 a^2[i] = a[i]

• 問題: No.573 a^2[i] = a[i]
• ユーザー: yuruhiya
• 提出日時: 2020-10-17 11:49:34
• 言語: Crystal (1.14.0)
• 結果: AC
• 実行時間: 25 ms / 2,000 ms
• コード長: 2,100 bytes
• コンパイル時間: 11,486 ms
• コンパイル使用メモリ: 295,316 KB
• 実行使用メモリ: 9,984 KB
• 最終ジャッジ日時: 2024-06-30 21:22:57
• 合計ジャッジ時間: 13,375 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
other	AC * 47

ソースコード

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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
lib C
  fun strtoll(s : UInt8*, p : UInt8**, b : Int32) : Int64
end
class String
  def to_i64
    C.strtoll(self, nil, 10)
  end
end
struct ModInt
  @@MOD = 1_000_000_007i64
  def self.mod
    @@MOD
  end
  def self.zero
    ModInt.new(0)
  end
  def initialize(n)
    @n = n.to_i64 % @@MOD
  end
  getter n : Int64
  def + : self
    self
  end
  def - : self
    ModInt.new(n != 0 ? @@MOD - @n : 0)
  end
  def +(m)
    ModInt.new(@n + m.to_i64 % @@MOD)
  end
  def -(m)
    ModInt.new(@n - m.to_i64 % @@MOD)
  end
  def *(m)
    ModInt.new(@n * m.to_i64 % @@MOD)
  end
  def /(m)
    raise DivisionByZeroError.new if m == 0
    a, b, u, v = m.to_i64, @@MOD, 1i64, 0i64
    while b != 0
      t = a // b
      a -= t * b
      a, b = b, a
      u -= t * v
      u, v = v, u
    end
    ModInt.new(@n * u)
  end
  def //(m)
    self / m
  end
  def **(m : Int)
    t, res = self, ModInt.new(1)
    while m > 0
      res *= t if m.odd?
      t *= t
      m >>= 1
    end
    res
  end
  def ==(m)
    @n == m.to_i64
  end
  def !=(m)
    @n != m.to_i64
  end
  def succ
    self + 1
  end
  def pred
    self - 1
  end
  def to_i64 : Int64
    @n
  end
  delegate to_s, to: @n
  delegate inspect, to: @n
end
struct Int
  def to_mint : ModInt
    ModInt.new(self)
  end
end
class Comb(T)
  def initialize(@Max = 300009)
    @fac = Array(T).new(@Max, T.zero)
    @finv = Array(T).new(@Max, T.zero)
    @inv = Array(T).new(@Max, T.zero)
    @fac[0] = @fac[1] = T.new(1)
    @finv[0] = @finv[1] = T.new(1)
    @inv[1] = T.new(1)
    (2...@Max).each do |i|
      @fac[i] = @fac[i - 1] * i
      @inv[i] = -@inv[T.mod % i] * (T.mod / i)
      @finv[i] = @finv[i - 1] * @inv[i]
    end
  end
  def p(n, r)
    (n < r || n < 0 || r < 0) ? 0 : @fac[n] * @finv[n - r]
  end
  def c(n, r)
    (n < r || n < 0 || r < 0) ? 0 : @fac[n] * @finv[r] * @finv[n - r]
  end
  def h(n, r)
    (n < 0 || r < 0) ? 0 : r == 0 ? 1 : c(n + r - 1, r)
  end
  def fact(n)
    @fac[n]
  end
end
n = read_line.to_i
combi = Comb(ModInt).new
puts (0..n).sum { |i|
  i.to_mint ** (n - i) * combi.c(n, i)
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX