소스코드123456789101112131415161718192021222324252627282930313233#include using namespace std; int n, num[101], result=0;long long dp[101][1001]; long long cal(int idx, int sum) { if (sum 20) { return 0; } if (idx == n - 1) { if (sum == num[n - 1]) dp[idx][sum] = 1; else dp[idx][sum] = 0; return dp[idx][sum]; } if (dp[idx][sum] != -1) { return dp[idx][sum]; } long long ret = 0; ret += cal(idx + 1, s..

소스코드12345678910#include using namespace std; int main() { int i, n, num[101] = {0}; cin >> n; for (i = 1; i > num[i]; num[i] *= i; } for (i = 1; i

소스코드12345678910111213141516#include using namespace std; int main() { for (int i = 0; i > sh >> sm >> ss >> eh >> em >> es; if (es - ss

소스코드12345678910111213141516171819202122232425#include using namespace std; int main() { int result=1, n, k, destIdx, d[4][1001]; cin >> n >> k; for (int i = 0; i > d[0][i] >> d[1][i] >> d[2][i] >> d[3][i]; if (d[0][i] == k) { destIdx = i; } } for (int i = 0; i

소스코드1234567891011121314151617#include using namespace std; int main() { int i,j,n,a[3],Max=0; cin >> n; for (i = 0; i > a[i]; if (Max

소스코드123456789101112131415161718#include using namespace std; int main() { int a[10],c=0, min=987654321,r; while (c > a[c]; if (c > 0) { a[c] += a[c - 1]; } int compare = a[c] > 100 ? a[c] - 100 : 100 - a[c]; if (min >= compare) { min = compare; r = a[c]; } c++; } cout