아기개발자의 개발이야기

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define ll long long int board[9][9]; vector zeros; int cnt=0; bool found = false; bool check(pair p) { int xs = p.first / 3; int ys = p.second / 3; for (int i = 0; i < 9; i++) { if (board[p.first][i] == board[p.first][p.second] &&i!=p.second) { return false; } if (board[i][p.second] == board[p.first][p.second] &&i!=p.first) { return ..

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define ll long long int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector v, v2; for (int i = 0,x; i > x; v.push_back(x); } int m; cin>> m; for (int i = 0, x; i > x; v2.push_back(x); } sort(v.begin(), v.end()); for (int i = 0; i < m; i++) { cout

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define ll long long int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; vector v; int Max = 0; for (int i = 0,x; i > x; v.push_back(x); Max = max(Max, x); } int left = 1; int right = Max; int ans = 0; sort(v.rbegin(), v.rend()); while (left

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define ll long long int main() { cin.tie(0)->sync_with_stdio(0); ll x, y; cin >> x >> y; int z = (y*100) / x; if (z >= 99) { cout

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define ll long long int main() { cin.tie(0)->sync_with_stdio(0); long x, y; cin >> x >> y; int z = (y*100) / x; if (z >= 99) { cout

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define pb push_back #define ss stable_sort #define ll long long int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; vector v; for (int i = 0,x; i > x; v.pb(x); } //입력 int Max = *max_element(v.begin(), v.end()); //최대길이 떡이 end int start = 1; int end = Max; int ans=0; while (start mid) { sum += v[i] -m..

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define pb push_back #define ss stable_sort #define ll long long int paper[128][128]; int white , blue; void Devide(int x, int y, int s) { //분할 함수 int color = paper[x][y]; //왼쪽 모서리 색깔저장 for (int i = x; i < x + s; i++) { for (int j = y; j < y + s; j++) { //사이즈내를 돌면서 if (color == 0 && paper[i][j]==1) { color = 2; } else if (color == 1 &..

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define pb push_back #define ss stable_sort #define ll long long int arr[100005]; int arr2[100005]; //길이의 절반, 넉넉하게 5더해줌 int Min=200005; //뚫는 장애물의 합 = 길이 +5(추가) int cnt; //뚫는 장애물의 개수 int main() { cin.tie(0)->sync_with_stdio(0); int n, h; cin >> n >> h; //입력 for (int i = 0; i > arr[i]>> arr2[i]; } sor..

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define pb push_back #define ss stable_sort #define ll long long struct cmp { bool operator()(const string& a, const string& b) const { return a > b; } }; int main() { cin.tie(0)->sync_with_stdio(0); // for(int i=0; i> n; vector v; set se; while (n--) { string s, s2; cin >> s >> s2; if (s2 == "enter") { se.emplace..

#define _CRT_SECURE_NO_WARNINGS #include using namespace std; #define pb push_back #define ss stable_sort #define ll long long int gcd(int x, int y) { int r; while (y!=0) { r = x % y; x = y; y = r; } return x; } int main() { cin.tie(0)->sync_with_stdio(0); // for(int i=0; i> t; int x, y; while(t--){ cin >> x >> y; cout