Submission #9583

#	Time	Username	Problem	Language	Result	Execution time	Memory
9583		dolpang2	Phibonacci (kriii2_P)	C++14	0 / 4	1000 ms	1084 KiB

P

#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 / 1
• Subtask 2: 0 / 3