본문 바로가기

백준 알고리즘/시뮬레이션43

백준 1152번 C++ #include #include using namespace std; string s; int answer = 0; int main() { getline(cin, s); int index = 0; while (index < s.length()) { if (s[index] == ' ') answer++; index++; } if (s[0] == ' ') answer--; if (s[s.length() - 1] == ' ') answer--; cout 2019. 8. 30.
백준 1551번 C++ #include #include using namespace std; const int MAX = 21; int num[MAX]; int main() { int n, k; scanf("%d %d", &n, &k); for (int i = 0; i < n; i++) { scanf("%d", &num[i]); getchar(); } for (int i = 0; i < k; i++) { for (int j = 0; j < n - 1; j++) { num[j] = num[j + 1] - num[j]; } n--; } for (int i = 0; i < n - 1; i++) cout 2019. 8. 30.
백준 1022번 C++ #include #include #include #include using namespace std; struct Move { int x, y, z; }; Move mv[4] = { {0,1,1},{-1,0,1},{0,-1,1},{1,0,1} }; int main(void) { int r1, c1, r2, c2; int maxrange; int map[50][5]; cin >> r1 >> c1 >> r2 >> c2; maxrange = max(max(abs(r1), abs(c1)), max(abs(r2), abs(c2))); if (abs(0 - r1) >= 0 && abs(0 - r1) = 0 && abs(0 - c1) = maxrange && lasty >= maxrange) { flag = 1; b.. 2019. 8. 30.
백준 1526번 C++ #include #include using namespace std; int main(void) { int n,num; cin >> n; queue q; if (n >= 4) q.push(4); if (n >= 7) q.push(7); while (!q.empty()) { num = q.front(); q.pop(); if(num * 10 + 4 2019. 8. 29.

티스토리툴바