Notice
Recent Posts
Recent Comments
Link
반응형
목록바이너리탐색 (1)
변명은 만개 결과는 한개
[이분 탐색 01]
더보기 #include using namespace std; int A, B, V; int minn = 1000; int ansDay = 0; int dayHeight(int day){ int yesterdayHeight = (A - B) * (day - 1); int todayHeight = yesterdayHeight + A; // int tomorrowHeight = tdayHeight - B; return todayHeight; } int main() { scanf_s("%d %d %d", &A, &B, &V); int right = V + 1;// int left = 0;// //printf("left,right : %d,%d\n", left, right); int result = right; ..
공부/Problem Solving
2020. 7. 1. 01:18