:: ADVANCE ::

[BaekJoon][1236] 성 지키기

BAEKJOON ONLINE JUDGE 1236번 성 지키기 https://www.acmicpc.net/problem/1236 1234567891011121314151617181920212223242526272829303132333435363738394041424344#include int max(int first, int second){ if (first > second) return first; return second;} int main(){ int n, m; int i, j; char map[51][51]; int wcnt = 0, hcnt = 0; scanf("%d %d", &n, &m); for (i = 0; i
Algorithm/구현 | ETC 2016. 4. 11. 02:13
[BaekJoon][1193] 분수 찾기

BAEKJOON ONLINE JUDGE 1193번 분수 찾기 https://www.acmicpc.net/problem/1193 12345678910111213141516171819#include int main(){ int n; int x = 0; int d; scanf("%d", &n); while (x * (x + 1) / 2 > n; int t1, t2; for (int i = 1;; i++) { if (n - i
Algorithm/구현 | ETC 2016. 4. 11. 02:09
[BaekJoon][1181] 단어 정렬

BAEKJOON ONLINE JUDGE 1181번 단어 정렬 12345678910111213141516171819202122232425262728293031323334#include #include #include #include using namespace std; bool cmp(const string &first, const string &second){ if (first.size() == second.size()) return first
Algorithm/sort 2016. 4. 11. 02:03
Prev 1 ··· 46 47 48 49 50 51 52 ··· 99 Next