QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#786688 | #7054. Fibonacci Sequence | wifi32767 | AC ✓ | 412ms | 3596kb | C++20 | 660b | 2024-11-26 22:52:14 | 2024-11-26 22:52:27 |
Judging History
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 = 3e4 + 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();
}
详细
Test #1:
score: 100
Accepted
time: 412ms
memory: 3596kb
input:
output:
1 1 2 3 5
result:
ok single line: '1 1 2 3 5'