QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#199627 | #7054. Fibonacci Sequence | MahmoudAtia# | AC ✓ | 0ms | 3356kb | C++14 | 417b | 2023-10-04 13:22:08 | 2023-10-04 13:22:09 |
Judging History
answer
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, 0, 0, 1, -1, 1};
int dj[] = {0, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18;
const int N = 2e5 + 5, M = 1e5 + 5, MOD = 998244353;
#define EPS 1e-9
ll n, c, y, a[N];
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << "1 1 2 3 5";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3356kb
input:
output:
1 1 2 3 5
result:
ok single line: '1 1 2 3 5'