QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#786685 | #7054. Fibonacci Sequence | wifi32767 | TL | 0ms | 0kb | C++20 | 660b | 2024-11-26 22:51:51 | 2024-11-26 22:52:17 |
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
#define endl '\n'
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
const int MAX = 5e4 + 5, mod = 1e9 + 7;
int n;
bool a[MAX], b[MAX];
void solve(){
// bitset<MAX> a("00110011");
// bitset<MAX> b;
// for (int i = 0; i < MAX; i ++) b |= a;
// (void*) &b;
for (int i = 0; i < MAX; i ++){
for (int j = 0; j < MAX; j ++){
b[j] |= a[j];
}
}
cout << "1 1 2 3 5";
}
signed main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// int T=1;cin>>T;while(T--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded