We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 5168789 commit 2bdcc6bCopy full SHA for 2bdcc6b
1 file changed
khj20006/202511/17 BOJ G5 비요뜨의 징검다리 건너기.md
@@ -0,0 +1,25 @@
1
+```cpp
2
+#include <bits/stdc++.h>
3
+using namespace std;
4
+using ll = long long;
5
+
6
+ll MOD = 1e9 + 7;
7
8
+ll power(ll a) {
9
+ if (a <= 1) return (1 << a);
10
+ ll h = power(a >> 1) % MOD;
11
+ h = h * h % MOD;
12
+ return (a & 1) ? h * 2 % MOD : h;
13
+}
14
15
+int main() {
16
+ cin.tie(0)->sync_with_stdio(0);
17
18
+ ll T, N, MOD = 1e9 + 7;
19
+ for (cin >> T; T--;) {
20
+ cin >> N;
21
+ cout << (N <= 2 ? 1 : power(N - 2)) << '\n';
22
+ }
23
24
25
+```
0 commit comments