![]()
#include #include #include #include using namespace std; int count = 0; void GroupWord(string input,int &count) { bool alp[26] = { 0, }; bool group = true; for(int i = 0; i 0) { if (input[i] != input[i - 1] && alp[input[i] - 97] == true) { group = false; break; } } alp[input[i] - 97] = true; } if (group == true) { count++; } } int main() { ios_base::sync_with_stdio..
![]()
#include #include #include #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector box; string input = ""; while (true) { getline(cin, input); //한줄 통채로 입력받기 if (input == "END") { break; } reverse(input.begin(), input.end()); //코드 뒤집기 box.push_back(input); } for (int i = 0; i < box.size(); i++) { cout
![]()
#include #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int input; cin >> input; int cnt = 0; input = 1000 - input; cnt += input / 500; input = input % 500; cnt += input / 100; input = input % 100; cnt += input / 50; input = input % 50; cnt += input / 10; input = input % 10; cnt += input / 5; input = input % 5; cnt += input / 1; input ..
![]()
#include #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string a, b; cin >> a >> b; //모두 5로 바꾼게 최솟값 모두 6으로 바꾼게 최대값 for (int i = 0; i < a.length(); i++) { if (a[i] == '6') { a[i] = '5'; } } for (int i = 0; i < a.length(); i++) { if (b[i] == '6') { b[i] = '5'; } } cout
![]()
#include #include #include using namespace std; int a[30][30]; int group[30][30]; int dx[] = {0,0,1,-1}; int dy[] = {1,-1,0,0}; int n; int ans[25*25]; void bfs(int x, int y, int cnt) { queue q; q.push(make_pair(x,y)); group[x][y] = cnt; while (!q.empty()) { x = q.front().first; y = q.front().second; q.pop(); for (int k=0; k
