oj.uz

Submission #9583

# Submission time Handle Problem Language Result Execution time Memory
9583 2014-09-28T07:25:35 Z dolpang2 Phibonacci (kriii2_P) C++14
0 / 4
 1000 ms 1084 KB 
#include <cstdio>

const int kModulo = 1000000007;

int main() {
  long long n = 0;
  int k = 0;

  scanf("%lld%d", &n, &k);
  int a = 0;
  int b = 1;
  for (long long i = 2; i <= n; ++i) {
    int ret = (a % kModulo + b % kModulo) % kModulo;

    a = b;
    b = ret;
  }
  printf("%d %d", b, a);
}

Subtask #1
0.0 / 1.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 1084 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.0

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