Compute Fibonacci Number

Given a non-negative integer \(n\), compute the \(n\)th Fibonacci number using dynamic programming. The Fibonacci sequence is defined as follows:

\( F(0)=0 \)

\( F(1)=1 \)

For \( n \ge 2 \), \( F(n)=F(n-1)+F(n-2) \).

Implement an efficient solution that computes \( F(n) \) by building up values from \( 0 \) to \( n \) using a bottom-up approach.

inputFormat

The input consists of a single integer \( n \) read from standard input (stdin), where \( 0 \le n \le 10^5 \) (or a reasonable bound for this problem).

outputFormat

Output the \( n \)th Fibonacci number to standard output (stdout).

0

0