implementation

Author: KHJcode

Baeckjoon/C/11047.c

@@ -7,7 +7,7 @@ int main() {
   scanf("%d %d", &n, &k);
 
   int* values = (int*)malloc(sizeof(int) * n);
-  for (int i = n - 1; i >= 0; i--) {
+  for (i = n - 1; i >= 0; i--) {
     scanf("%d", &values[i]);
   }
 

Study/implementation/C/02.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <string.h>
+
+int main() {
+  int n, i, sum, count = 0;
+  char hour[3], minute[3], second[3];
+
+  scanf("%d", &n);
+
+  sum = n * 3600 + 3599;
+
+  for (i = 0; i < sum + 1; i++) {
+    sprintf(hour, "%d", i / 3600);
+    sprintf(minute, "%d", i % 3600 / 60);
+    sprintf(second, "%d", i % 60);
+    if (
+      strstr(hour, "3") != NULL ||
+      strstr(minute, "3") != NULL ||
+      strstr(second, "3") != NULL
+    ) {
+      count += 1;
+    }
+  }
+
+  printf("%d", count);
+
+  return 0;
+}

Study/implementation/Python/01.py

@@ -0,0 +1,18 @@
+x, y = 1, 1
+mode = ['L', 'R', 'U', 'D']
+move_x = [0, 0, -1, 1]
+move_y = [-1, 1, 0, 0]
+
+n = int(input())
+plan = list(input().split())
+
+for s in plan:
+  i = mode.index(s)
+  if s == mode[i]:
+    _x = x + move_x[i]
+    _y = y + move_y[i]
+    if _x < 1 or _x > n or _y < 1 or _y > n:
+      continue
+    x, y = _x, _y
+
+print(x, y)

Study/implementation/Python/02.py

@@ -0,0 +1,12 @@
+n = int(input())
+sum = n * 3600 + 3599
+count = 0
+
+for i in range(sum + 1):
+  hour = str(i // 3600)
+  minute = str(i % 3600 // 60)
+  second = str(i % 60)
+  if '3' in hour + minute + second:
+    count += 1
+
+print(count)

Study/implementation/Python/03.py

@@ -0,0 +1,14 @@
+move_x = [-1, -2, -2, -1, 1, 2, 2, 1]
+move_y = [-2, -1, 1, 2, 2, 1, -1, -2]
+case = 0
+
+scan = input()
+x, y = ord(scan[0]) - 96, int(scan[1])
+
+for i in range(8):
+  _x = x + move_x[i]
+  _y = y + move_y[i]
+  if _y > 0 and _y < 9 and _x > 0 and _x < 9:
+    case += 1
+
+print(case)

Study/implementation/Python/04.py

@@ -0,0 +1,16 @@
+alphabet, number = [], []
+
+scan = input()
+
+for s in scan:
+  if s.isalpha():
+    alphabet.append(s)
+    continue
+  number.append(int(s))
+
+for i in range(len(alphabet)):
+  for j in range(len(alphabet) - 1):
+    if ord(alphabet[j]) > ord(alphabet[j + 1]):
+      alphabet[j], alphabet[j + 1] = alphabet[j + 1], alphabet[j]
+
+print(''.join(alphabet) + str(sum(number)) if len(number) != 0 else '')