2869)달팽이 등산 (c, python)
#include int main() { int oneday, down, mezase; double day = 0; scanf("%d %d %d", &oneday, &down, &mezase); day = ceil((double)(mezase - oneday) / (double)(oneday - down)); day++; printf("%d\n", (int)day); return 0; } /////////////////////////////////////// a, b, v = map(int, input().split()) day = 0 if (v - b) % (a - b) != 0: day = ((v - b) // (a - b)) +1 else: day = ((v - b) // (a - b)) print(..