QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#786652#7054. Fibonacci Sequencewifi32767AC ✓0ms3628kbC++20475b2024-11-26 22:39:412024-11-26 22:39:42

Judging History

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

  • [2024-11-26 22:39:42]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3628kb
  • [2024-11-26 22:39:41]
  • 提交

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 = 5e3 + 5, mod = 1e9 + 7;

int n;
void solve(){
    int cnt = 0;
    for (int i = 0; i < 2e9; i ++){
        cnt += i * i;
    }
    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: 100
Accepted
time: 0ms
memory: 3628kb

input:



output:

1 1 2 3 5

result:

ok single line: '1 1 2 3 5'