// This file is generated by mkfile.py
// Date: 2025-12-05

#include <solution/509.h>
int fib(int n)
{
    int dp[n + 1];
    dp[0] = 0;
    if (n >= 1)
        dp[1] = 1;
    for (int i = 2; i <= n; i++)
        dp[i] = dp[i - 1] + dp[i - 2];
    return dp[n];
}