QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#328370#7054. Fibonacci Sequence66E61dAC ✓1ms3652kbC++141.2kb2024-02-15 19:39:322024-02-15 19:39:32

Judging History

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

  • [2024-02-15 19:39:32]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3652kb
  • [2024-02-15 19:39:32]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define endl '\n'
#define VI vector<int>
#define pii pair<int, int>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define per(i, j, k) for (int i = j; i >= k; --i)
#define print(a) cout << a << endl;

const int inf = 0x3f3f3f3f;
const long long llinf = (long long)0x3f3f3f3f3f3f3f3f;
const long long MOD = (long long)1e9 + 7LL;
const size_t N = (size_t)1e6 + 5;

#define IO                       \
    ios::sync_with_stdio(false); \
    std::cin.tie(0);             \
    std::cout.tie(0)

#define debug(a) std::cerr << "\033[34m" << #a << ':' << a << "\033[0m" << endl

#define debugList(list)                        \
    std::cerr << "\033[34m" << #list << ": ["; \
    for (auto& e : list) {                     \
        std::cerr << e << ", ";                \
    }                                          \
    std::cerr << "\b\b]\033[0m" << endl

#define otto auto

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

signed main() {
    IO;
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    solve();
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3652kb

input:



output:

1 1 2 3 5

result:

ok single line: '1 1 2 3 5'