알고리즘 문제 풀이/1DP_과제(~180615)
180126_1328_고층 빌딩
//https://www.acmicpc.net/problem/1328#include #define MOD 1000000007using namespace std;long long dp[101][101][101]; int main(){ int n, l, r; long long temp; cin >> n >> l >> r; dp[1][1][1]=1; dp[2][1][2]=dp[2][2][1]=1; for(int i=3; i
