oj.uz

Submission #950294

# Submission time Handle Problem Language Result Execution time Memory
950294 2024-03-20T07:47:05 Z berr Fibonacci representations (CEOI18_fib) C++17
0 / 100
 1 ms 452 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod =1e9+7;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    vector<int> a(n);
    int cnt=1;
    for(auto &i: a) i=cnt*cnt, cnt++;
    int ans=1;
    for(int i=0; i<n; i++){
        if(a[i]==1) cout<<ans<<" ";
        else ans*=2, ans%=mod, cout<<ans<<" ";
    }


}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -