전체 글439 백준 1697번 C++ #include #include #include using namespace std; int m, n;int z = 0;int visited[100001]; void bfs() {queue q;q.push(make_pair(m, z));visited[m] = 1; while (!q.empty()) {int M = q.front().first;int Z = q.front().second;q.pop(); if (M == n)cout m >> n; if (m == n) {cout 2019. 1. 7. 백준 2606번 C++ #include using namespace std; int computernum, computercnt;int comconnect[100][100];int visit[100]; void bfs(int a,int b) {int com1 = a;int com2 = b; comconnect[com1][com2] = 0;visit[com2] = 1;for (int i = 0; i > computernum >> computercnt; for (int i = 0; i < 100; i++) {for (int j = 0; j < 100; j++) {co.. 2019. 1. 5. 백준 7568번 C++ #include #include using namespace std; typedef struct {int height;int k;}Info; int main(void) {int count; cin >> count;Info arr[51];for (int i = 0; i > height >> k;arr[i].height = height;arr[i].k = k;} for (int i = 0; i < count; i++) {int ans = 0;for (int j = 0; j < count; j ++ ) {if ((arr[i].height < arr[j].height) && (arr[i].k < arr[j].k))ans++;}cout 2019. 1. 5. 백준 1065번 C++ #include #include using namespace std; int findnum(int x) {int num = x;int ans = 100, count = 99;while (ans > num; if (num >= 100)num = findnum(num); cout 2019. 1. 5. 이전 1 ··· 87 88 89 90 91 92 93 ··· 110 다음
