-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path453-fibonacci-cubes.cpp
More file actions
40 lines (37 loc) · 943 Bytes
/
Copy path453-fibonacci-cubes.cpp
File metadata and controls
40 lines (37 loc) · 943 Bytes
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
/*
* Fibonacci Cubes [2111B]
* Problem: https://codeforces.com/problemset/problem/2111/B
* Verdict: ACCEPTED Solved: 2025-08-29
* Language: C++23 (GCC 14-64, msys2)
* Runtime: 156 ms Memory: 0 KB
* Tags: brute force, dp, implementation, math
* Author: BidoTeima
* Source: https://codeforces.com/contest/2111/submission/336073596
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
int f[n+1];
f[1] = 1;
f[2] = 2;
for(int i = 3; i <= n; i++) f[i] = f[i - 1] + f[i - 2];
for(int i = 0; i < m; i++){
int w,l,h;
cin>>w>>l>>h;
if(max({w,l,h}) >= f[n]+f[n-1] && min({w,l,h}) >= f[n])cout<<1;
else cout<<0;
}
cout<<'\n';
}
return 0;
}