소스코드1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556#include #define n 9#define m 5using namespace std; int dx[4] = { 0, 0, -1, 1 }, dy[4] = {-1,1,0,0}, Min, ret;char map[m+1][n+1]; void find(char curmap[m+1][n+1], int depth) { int cnt = 0; for (int i = 0; i

소스코드1234567891011121314151617181920212223242526#include using namespace std;int n, m, f[501], map[501][501], a, b,cnt=0;int main() { cin >> n >> m; while (m--) { cin >> a >> b; map[a][b] = 1, map[b][a]=1; if (a == 1) { f[b] = 1; } else if (b == 1) { f[a] = 1; } } for (int i = 2; i

소스코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 #include using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a%b); } int main() { int n, m; cin >> n >> m; cout

소스코드123456789101112131415#include using namespace std; int main() { int n, t,a, sum=0, cnt=0; cin >> n >> t; while (n--) { cin >> a; sum += a; if (sum > t) { break; } else { cnt++; } } cout

소스코드12345678910111213141516171819202122232425#include using namespace std; int main() { char a[31], b[31]; int aleng=-1, bleng = -1, aidx,bidx; bool chkFlag = false; cin >> a >> b; while (a[++aleng] != '\0') {} while (b[++bleng] != '\0') {} for (int i = 0; i

소스코드1234567891011121314151617181920212223242526272829303132#include using namespace std; int main() { int h, w, r[101][101]; cin >> h >> w; for (int i = 0; i a; if (a == 'c') { r[i][j] = 0; } else { r[i][j] = -1; } } } for (int i = 0; i