QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#786685#7054. Fibonacci Sequencewifi32767TL 0ms0kbC++20660b2024-11-26 22:51:512024-11-26 22:52:17

Judging History

你现在查看的是最新测评结果

  • [2024-11-26 22:52:17]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-11-26 22:51:51]
  • 提交

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

input:



output:


result: