목록분류 전체보기 (172)

시나브로

[D3] 7732. 시간 개념

#include int main() { int test_case = 0; scanf("%d", &test_case); char buffer = 0; scanf("%c", &buffer); for (int q = 0; q < test_case; q++) { int present_hours = 0; int present_min = 0; int present_second = 0; int future_hours = 0; int future_min = 0; int future_second = 0; int remain_hours = 0; int remain_second = 0; int remain_min = 0; scanf("%d:%d:%d",&present_hours,&present_min,&present_sec..
알고리즘/SW Expert Academy 2019. 10. 6. 11:12
[D5] 8191. 만화책 정렬하기

#include int main() { int test_case = 0; scanf("%d", &test_case); char buffer = 0; scanf("%c", &buffer); for (int q = 0; q < test_case; q++) { int test_amount = 0; scanf("%d", &test_amount); int box = 0; int m[200002] = { 0 }; int memory_point = 0; for (int i = 0; i < test_amount; i++) { scanf("%d", &box); if (m[box-1] == 1) { m[box] = 1; } else { m[box] = 1; memory_point++; } } printf("#%d %d\n..
알고리즘/SW Expert Academy 2019. 10. 6. 11:10
[D4] 7965. 퀴즈

#include long long sequal[1000002][2] = { 0 }; int main() { int test_case = 0; scanf("%d", &test_case); char buffer = 0; scanf("%c", &buffer); long long last_point = 0; sequal[0][0] = 0; sequal[0][1] = 0; for (int q = 0; q < test_case; q++) { long long number = 0; scanf("%d", &number); for (int i = last_point+1; i
알고리즘/SW Expert Academy 2019. 10. 6. 11:10
[D3] 8016. 홀수 피라미드

#include int main() { int test_case = 0; scanf("%d", &test_case); for (int q = 0; q < test_case; q++) { long long layer = 0; scanf("%d", &layer); long long box = 2 * (layer - 1)*(layer - 1) + 1; printf("#%lld %lld %lld\n",q+1 ,box, box + 4*(layer - 1)); } return 0; }
알고리즘/SW Expert Academy 2019. 10. 6. 11:09
Prev 1 ··· 36 37 38 39 40 41 42 43 Next