Solve #23 (달팽이는올라가고싶다), #25 (루트 2) by Junhui Kim

junhuikim/2869-달팽이는올라가고싶다.cpp

@@ -0,0 +1,25 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <iostream>
+
+using namespace std;
+
+int main(void) {
+    int A, B, V;
+
+    scanf("%d %d %d", &A, &B, &V);
+
+    int todo = V-A;
+    int dV = A-B;
+
+    int day = 1;
+
+    if(todo % dV == 0) {
+        day += todo/dV;
+    } else {
+        day += todo/dV + 1;
+
+    }
+
+    printf("%d", day);
+}

junhuikim/rootN.cpp

@@ -0,0 +1,43 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <iostream>
+
+using namespace std;
+
+// This calculates root N.
+// After starting this program, put the N you want.
+int main(void) {
+    double N;
+
+    double start, mid, end;
+
+    double result;
+
+    scanf("%lf", &N);
+
+    start = 0;
+    end = N;
+
+    mid = (start + end) / 2;
+
+    for (int i = 0; i < 100; i++) {
+        result = mid * mid;
+
+        if (result == N) {
+            break;
+        }
+
+        if (result > N) {
+            end = mid;
+        }
+
+        if (result < N) {
+            start = mid;
+        }
+
+        mid = (start + end) / 2;
+    }
+
+    printf("%lf", mid);
+    return 0;
+}