전체 글412 2252 줄세우기 123456789101112131415161718192021222324252627282930313233343536373839#include #include #include using namespace std; int indegree[33000] = { 0 };vector adj(33000);queue q; int main() { int n, m; scanf("%d %d", &n, &m); for (int i = 0; i 2019. 3. 9. 1516 게임개발 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455#include #include #include #include using namespace std; int cost[600] = { 0 };int indegree[600] = { 0 };int rst[600] = { 0 };vector adj(600);queue q; int main() { int n; scanf("%d", &n); for (int i = 1; i 2019. 3. 9. 2623 음악 프로그램 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758#include #include #include using namespace std; int indegree[1100] = { 0 };vector adj(1100);queue q;queue rst; int main() { int n, m; scanf("%d %d", &n, &m); // indegree, 인접행렬 초기화 for (int i = 0; i 2019. 3. 9. 오목 더블릿 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105#include int arr[30][30] = { 0 }; int main() { for (int i = 1; i 2019. 3. 7. QuadTree 더블릿 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384#include #include #include #include #include using namespace std;queue q;stack change;stack rst;int arr[550][550] = { 0 }; int main() { int n; scanf("%d", &n); for (int i = 1; i 2019. 3. 5. blurred vision 더블릿 123456789101112131415161718192021222324252627#include int arr[20][20] = { 0 }; int main() { char stend[10]; int a, b; scanf("%s %d %d", stend, &a, &b); for(int j = 0 ; j 2019. 3. 1. (잘못된풀이) 누가 더 클까 더블릿 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758#include #include using namespace std;vector par;int tall, small, flag = 0; void dfs(int x) { if (x == tall) { flag = 1; return; } if (par[x].size() == 0) return; for (int i = 0; i 2019. 3. 1. world cup 더블릿 123456789101112131415161718#include int main() { int t, n; scanf("%d %d", &t, &n); int tmp = 0; while (t--) { char country[10]; int score; scanf("%s %d", country, &score); tmp += score; } int rst = 3 * n - tmp; printf("%d", rst);} Colored by Color Scriptercs 2019. 2. 28. 검은 점 세기 더블릿 1234567891011121314151617181920212223242526272829303132333435363738#include int arr[200][200] = { 0 }; int main() { int n; scanf("%d", &n); char order[10]; int x, y, len; while (n--) { scanf("%s %d %d %d", order, &x, &y, &len); if (order[0] == 'B') { for (int i = y; i 2019. 2. 28. 달팽이 더블릿 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146#include #include using namespace std; int arr[500][500] = { 0 };int.. 2019. 2. 28. 팩토리얼 숫자 빈도수 더블릿 123456789101112131415161718192021222324252627282930313233343536373839#include #define ten 10 int arr[1000000] = { 0 };int cnt = 1;int num[20] = { 0 }; int main() { int n,up=0; scanf("%d", &n); arr[1] = 1; if (n == 1) num[1] = 1; for (int i = 2; i 2019. 2. 28. 팩토리얼 구하기 더블릿 123456789101112131415161718192021222324252627#include #define ten 10 int arr[1000000] = { 0 };int cnt = 1; int main() { int n,up=0; scanf("%d", &n); arr[1] = 1; for (int i = 2; i 2019. 2. 28. 이전 1 ··· 26 27 28 29 30 31 32 ··· 35 다음