baekjoon 20260209

code_study/Baekjoon/c/27172.c

@@ -0,0 +1,36 @@
+#include <stdio.h>
+#include <stdbool.h>
+#include <stdlib.h>
+
+int score[1000001];
+bool valid[1000001];
+
+int main() {
+    int N;
+    scanf("%d",&N);
+    int* card = (int*)malloc(sizeof(int)*N);
+
+    for(int i=0; i<N; i++) {
+        scanf("%d",&card[i]);
+        valid[card[i]] = true;
+    }
+
+    for(int i=1; i<=1000000; i++) {
+        if(!valid[i]) continue;
+
+        for(int j=2*i; j<=1000000; j+=i) {
+            if(valid[j]) {
+                score[i] += 1;
+                score[j] -= 1;
+            }
+        }
+    }
+
+    for(int i=0; i<N; i++) {
+        printf("%d ",score[card[i]]);
+    }
+
+    free(card);
+
+    return 0;
+}

code_study/Baekjoon/java/_2576.java

@@ -0,0 +1,22 @@
+import java.util.*;
+
+public class _2576 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int res = 0, min = 101;
+        for(int i=0; i<7; i++) {
+            int n = sc.nextInt();
+            if(n % 2 == 1) {
+                res += n;
+                min = Math.min(min, n);
+            }
+        }
+        sc.close();
+
+        if(res == 0) System.out.println(-1);
+        else {
+            System.out.println(res);
+            System.out.println(min);
+        }
+    }
+}