Submission #9638

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9638	2014-09-28 07:47:00	dolpang2	Phibonacci (kriii2_P)	C++14	1 / 4	0 ms	1088 KiB

P

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
#include <cstdio>
const int MODULO = 1000000007;
struct Matrix {
  long long M[2][2];
};
Matrix matrix;
Matrix multiplyOfMatrix(Matrix x, Matrix y) {
  Matrix ret;
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < 2; ++j) {
      int sum = 0;
      for (int k = 0; k < 2; ++k) {
        sum += ((x.M[i][k] % MODULO) * (y.M[k][j] % MODULO)) % MODULO;
      }
      sum = sum % MODULO;
      ret.M[i][j] = sum;
    }
  }
  return ret;
}
Matrix powerOfMatrix(Matrix matrix, long long valueOfPower) {
  if (valueOfPower == 1) {
    return matrix;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 0 / 3