Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

#include<stdio.h>

int climbStairs(int n) {
    int i;
    int res[n+1];
    res[0]=0;
    res[1]=1;
    res[2]=2;
    for(i=3;i<=n;i++) {
        res[i]=res[i-1]+res[i-2];
        //printf("%d\n",res[i]);
    }
    return res[n];
}

void main(){
    printf("%d\n",climbStairs(10));
}