[백준 5567번] 결혼식
소스코드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
2018.04.01