Submission #202844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
202844	2020-02-18T08:04:00 Z	coloredrabbit	Phibonacci (kriii2_P)	C++17	1 / 4	5 ms	376 KB

P

#include<iostream>
#include<cstring>
using namespace std;
using ll = __int128;
const int LIMIT = 126, M = 1e9 + 7;
const ll MOD = (long long)M * M;
struct _mt {
	ll m[2][2];
	_mt() { memset(m, 0, sizeof m);  }
	void E() { for (int i = 0; i < 2; i++) m[i][i] = 1; }
	_mt operator*(const _mt& o) {
		_mt r;
		int i, j, k;
		for (i = 0; i < 2; i++)for (j = 0; j < 2; j++) for (k = 0; k < 2; k++)
			r.m[i][j] = (r.m[i][j] + m[i][k] * o.m[k][j]) % MOD;
		return r;
	}
}F[LIMIT], NK, K;
ll _pow(ll a, ll n) {
	if (n == 1) return a;
	ll h = _pow(a, n >> 1);
	return (h * h % M) * (n % 2 ? a : 1) % M;
}
int main() {
	ll n, k, A, B, i, nk, bitset_v = 1, x;
	long long tN, tK;
	cin >> tN >> tK;
	n = tN, k = tK;
	F[0].m[0][0] = F[0].m[0][1] = F[0].m[1][0] = 1;
	NK.E(); K.E();
	nk = k * n;
	for (i = 1; i < LIMIT; i++) F[i] = F[i - 1] * F[i - 1];
	for (i = 0; i < LIMIT; i++) {
		if ((bitset_v << i) & nk) NK = NK * F[i];
		if ((bitset_v << i) & k) K = K * F[i];
	}
	A = NK.m[0][1] * _pow(K.m[0][1], MOD - 2) % MOD;
	B = (NK.m[1][1] - A * K.m[1][1] % MOD + MOD) % M;
	cout << (long long)(A % M) << ' ' << (long long)B;
	return 0;
}

Compilation message

P.cpp: In function 'int main()':
P.cpp:25:38: warning: unused variable 'x' [-Wunused-variable]
  ll n, k, A, B, i, nk, bitset_v = 1, x;
                                      ^

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	4 ms	128 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	4 ms	376 KB	Output is correct
12	Correct	5 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	4 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct

Subtask #2

0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	5 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Incorrect	5 ms	376 KB	Output isn't correct
20	Halted	0 ms	0 KB	-