QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#233860#7054. Fibonacci Sequencegondozu#AC ✓0ms3732kbC++14708b2023-11-01 01:46:302023-11-01 01:46:31

Judging History

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

  • [2023-11-01 01:46:31]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3732kb
  • [2023-11-01 01:46:30]
  • 提交

answer

#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define Gondozu ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const int OO = 1e9 + 5;
const int N = 2e5 + 5;

void TC()
{
 cout << "1 1 2 3 5";
}

int32_t main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#endif
    Gondozu
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

input:



output:

1 1 2 3 5

result:

ok single line: '1 1 2 3 5'