oj.uz

Submission #9680

# Submission time Handle Problem Language Result Execution time Memory
9680 2014-09-28T08:04:10 Z yukariko Phibonacci (kriii2_P) C
0 / 4
 0 ms 1088 KB 
#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;
}

Subtask #1
0.0 / 1.0

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

Subtask #2
0.0 / 3.0

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