목록2016/10/09 (6)
:: ADVANCE ::
BAEKJOON ONLINE JUDGE 3649 로봇 프로젝트 https://www.acmicpc.net/problem/3649 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859#include #include using namespace std; int len;int n;int lego[1000001]; int bsearch(int num){ int s = 0, e = n - 1; int m; while (s
BAEKJOON ONLINE JUDGE 3079 입국심사 https://www.acmicpc.net/problem/3079 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include #include using namespace std; int n, m;int time[100001]; bool cmp(const int &first, const int &second) { return first > second;} int ispossible(long long t){ int num = m; int i = 0; while (i 0) { num = num - t / time[i]; i+..
BAEKJOON ONLINE JUDGE 3020 개똥벌레 https://www.acmicpc.net/problem/3020 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576#include #include using namespace std; int n, h;int bottom[100100], top[100100];int cut[500001]; int bsearch(int num){ int s = 0, e = n / 2 - 1; int m; int ans; while (s
BAEKJOON ONLINE JUDGE 10815 숫자 카드 2 https://www.acmicpc.net/problem/10816 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include #include using namespace std; int n;int card[500001]; int bsearch(int num){ int s = 0, e = n - 1; int m, cnt = 0; while (s
BAEKJOON ONLINE JUDGE 1620 나는야 포켓몬 마스터 이다솜 https://www.acmicpc.net/problem/1620 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667#include #include #include using namespace std; int n, m;int index[100001];char pocketmon[100001][21]; bool cmp(const int &first, const int &second){ string F = pocketmon[first]; string S = poc..
BAEKJOON ONLINE JUDGE 10815 숫자 카드 https://www.acmicpc.net/problem/10815 123456789101112131415161718192021222324252627282930313233343536373839404142434445#include #include using namespace std; int n;int number[500001]; int bsearch(int num){ int s = 0, e = n - 1; while (s