Submission

Status:

PPPPPPPPPP

Score: 100

User: Khiem

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

Submitted On: 2024-09-25 14:06:06

#include <bits/stdc++.h>
typedef long long ll;
ll f[111];
signed main(){
	int n; scanf("%d", &n); f[1] = f[2] = 1;
	for(int i = 3; i<=n; ++i) f[i] = f[i-1] + f[i-2];
	printf("%lld", f[n]);  
}