[BOJ] 2240번 : 자두나무

1. problem : https://www.acmicpc.net/problem/2240 2. solution 1 :#include using namespace std;int t, w; int d[1005][32][3]; int cherry[1005];int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> t >> w; for (int i = 1; i > cherry[i]; for (int i = 1; i source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/blob/master/workbook/0x10.md basic-algo-lecture/workbook/0x10.md at..

2024.09.20