제출 #9680

#제출 시각아이디문제언어결과실행 시간메모리
9680yukarikoPhibonacci (kriii2_P)C11
0 / 4
0 ms1088 KiB
#include <stdio.h>
#include <string.h>
 
int main(){
    int i,n,k;
    unsigned long long p[2];
    scanf("%d %d",&n,&k);
    p[0]=0;
    p[1]=1;
    for(i=2;i<=n;i++){
        p[i%2] = (p[i%2]+p[(i+1)%2])%1000000007;
    }
    if(n<1) printf("0 1");
    else printf("%lld %lld",p[(i+1)%2],p[i%2]);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...