본문 바로가기

분류 전체보기

 (35)
백준 1654 #pragma warning(disable:6385) #include #include using namespace std; int num; int set; long long arr[10001]; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> num; cin >> set; for (int i = 0; i > arr[i]; } sort(arr, arr + num); long long begin = 0; long long end = arr[num - 1]; long long mid ; long long cnt=0; long long res=0; while (begin
백준 11727 #include #include #include using namespace std; long long arr[1001]; long long num = 0; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> num; arr[1] = 1; arr[2] = 3; arr[3] = 5; for (int i = 4; i
백준 9095 #include #include #include using namespace std; int test; int arr[11]; vector lst; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> test; for (int i = 0; i > tmp; lst.push_back(tmp); } for (int i = 0; i < test; i++) { int temp = lst[i]; arr[1] = 1; arr[2] = 2; arr[3] = 4; for (int i = 4; i
백준 2805 #pragma warning(disable:4946) #pragma warning(disable:6385) #include #include #define size 1000001 using namespace std; long long N, M; long long tree[size]; long long cut = 0; long long res = 0; int main() { scanf("%lld", &N); scanf("%lld", &M); for (int i = 0; i < N; i++) { scanf("%lld", &tree[i]); } sort(tree, tree + N); long long start = 0; long long end = tree[ N - 1]; while (start 0) { sum..
백준 1920 #pragma warning(disable:4996) #include #include #define size 1000001 using namespace std; int numA,numB; int A[size]; int B[size]; int main() { scanf("%d", &numA); for (int i = 0; i < numA; i++) { scanf("%d", &A[i]); } scanf("%d", &numB); for (int i = 0; i < numB; i++) { scanf("%d", &B[i]); } sort(A, A + numA); for (int i = 0; i < numB; i++) { int start = 0; int end = numA - 1; bool cnt = false;..
백준 1026 #include #include using namespace std; int num; int A[50]; int B[50]; bool check[50] = { false, }; int maxi = 0; int sum = 0; int find() { maxi = 0; for (int i = 0; i = maxi && check[i] != true) { maxi = B[i]; } } for (int i = 0; i < num; i++) { if (B[i] == maxi&& check[i]==false) { check[i] = true; break; } } return maxi; } int main() { cin.tie(0); ios_base::sync_with_st..
백준 2667 #include #include #include #include #define size 26 using namespace std; int arr[size][size]; bool check[size][size] = { false, }; vectorcnt_d; int posX[4] = { 0,0,-1,1 }; int posY[4] = { 1,-1 ,0,0, }; string temp; int n; int cal = 0; int cal_d=0; int nx, ny; int x, y; void dfs(int x, int y) { cal_d++; for (int i = 0; i = 0 && ny >= 0 && nx..
백준 1541 #include #include using namespace std; string str; int main(void) { cin >> str; string temp = ""; int sum = 0; bool check = false; for (int i = 0; i

티스토리툴바