소스코드12345678910111213141516171819#include using namespace std; int main() { char a[5][16]; for (int i = 0; i > a[i]; while (a[i][j++] != '\0') {} for (int aa = j - 1; aa

소스코드123456789101112131415161718192021222324252627282930313233#include using namespace std; bool v[10];int tmp[10]; void dfs(int num, int d, int n) { tmp[d] = num; if (d == n) { for (int i = 1; i

소스코드12345678910111213141516171819202122232425#include using namespace std; int main() { int N, m, M, T, R; cin >> N >> m >> M >> T >> R; int cur = m, dest = 0, cnt = 0; bool flag = false; while (1) { if (dest == N){ break; } if (cur + T = m) { cur -= R, cnt++, flag = false; continue; } if (cur - R

소스코드12345678910111213141516171819202122232425262728#include using namespace std; int main() { int num[52][52],n, m, r, Max=1; cin >> n >> m; r = n > m ? m : n; for (int i = 0; i a; num[i][j] = a - '0'; } } for (int i = 0; i

소스코드12345678910111213141516171819#include using namespace std; int n, a[3][51]; int main() { cin >> n; for (int i = 0; i > a[0][i] >> a[1][i]; for (int i = 0; i

소스코드123456789101112131415161718192021#include using namespace std; int cal(int num) { int sum = num; while (num!=0) { sum += num % 10; num /= 10; } return sum;} int main() { int n; cin >> n; for (int i = 1; i