oj.uz

Submission #9289

# Submission time Handle Problem Language Result Execution time Memory
9289 2014-09-28T05:23:48 Z dolpang2 Phibonacci (kriii2_P) C++14
0 / 4
 0 ms 1672 KB 
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>

const int a = 1000000007;
int main() {
  std::vector<int> fibo;

  fibo.push_back(0);
  fibo.push_back(1);

  int n;
  int k;
  
  scanf("%d%d", &n, &k);
  if (k == 1) {
    for (int i = 2; i <= n; ++i) {
      int ret = (fibo[i - 1] % a);
      ret += (fibo[i - 2] % a);
      fibo.push_back(ret);
    }
    std::cout << fibo[n] << " " << fibo[n - 1];
  } else {
    puts("no");
  }
}

Subtask #1
0.0 / 1.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 1672 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -