#381680 (C++14) No.891 隣接3項間の漸化式

• 問題: No.891 隣接3項間の漸化式
• ユーザー: yakamoto
• 提出日時: 2019-09-20 22:37:25
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,666 bytes
• コンパイル時間: 1,771 ms
• コンパイル使用メモリ: 174,204 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-14 18:34:55
• 合計ジャッジ時間: 2,956 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

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

ソースコード

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
143
144
145
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */
#include <iostream>
#include <fstream>
#ifndef SOLUTION_COMMON_H
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PI = pair<int, int>;
template<class T> using V = vector<T>;
using VI = V<int>;
#define _1 first
#define _2 second
#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif
template<class T>
inline void debug(T &A) {
  DEBUG(
      for (const auto &a : A) {
        cerr << a << " ";
      }
      cerr << '\n';
  )
}
template<class T, class Func>
inline void debug_with_format(T &A, Func f) {
  DEBUG(
      for (const auto &a : A) {
        cerr << f(a) << " ";
      }
      cerr << '\n';
  )
}
template<class T>
inline void debug_dim2(T &A) {
  DEBUG(
      for (const auto &as : A) {
        debug(as);
      }
  )
}
template<typename ... Args>
inline void debug(const char *format, Args const &... args) {
  DEBUG(
      fprintf(stderr, format, args ...);
      cerr << '\n';
  )
}
template<typename ... Args>
string format(const string &fmt, Args ... args) {
  size_t len = snprintf(nullptr, 0, fmt.c_str(), args ...);
  vector<char> buf(len + 1);
  snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
  return string(&buf[0], &buf[0] + len);
}
template<class T1, class T2>
string fmtP(pair<T1, T2> a) {
  stringstream ss;
  ss << "(" << a._1 << "," << a._2 << ")";
  return ss.str();
}
#define SOLUTION_COMMON_H
#endif //SOLUTION_COMMON_H
V<V<ll>> mat_mul(V<V<ll>> a, V<V<ll>> b, int m) {
  assert(a[0].size() == b.size());
  ll th = (ll)7e18;
  int r = (int)a.size();
  int c = (int)b[0].size();
  int len = (int)a[0].size();
  V<V<ll>> res(a.size(), V<ll>(b[0].size()));
  for (int i = 0; i < r; ++i) {
    for (int j = 0; j < c; ++j) {
      ll v = 0ll;
      for (int k = 0; k < len; ++k) {
        v += a[i][k] * b[k][j];
        if (v > th) v %= m;
      }
      res[i][j] = v >= m ? v % m : v;
    }
  }
  return res;
}
V<V<ll>> mat_pow(V<V<ll>> a, int n, int m) {
  if (n == 1) return a;
  V<V<ll>> res = mat_pow(mat_mul(a, a, m), n / 2, m);
  if (n % 2 == 1)
    return mat_mul(res, a, m);
  else
    return res;
}
const int MOD = 1000000007;
class E {
public:
  void solve(std::istream& in, std::ostream& out) {
    int a, b, n;
    in >> a >> b >> n;
    if (n == 0) {
      out << 0;
      return;
    }
    if (n == 1) {
      out << 1;
      return;
    }
    V<V<ll>> A = {{a, b}, {1, 0}};
    auto B = mat_pow(A, n, MOD);
    out << B[1][0];
  }
};
int main() {
    E solver;
    std::istream& in(std::cin);
    std::ostream& out(std::cout);
    solver.solve(in, out);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX