finish

src/apple.c

@@ -1,17 +1,44 @@
+
 #include <stdio.h>
 
 int n;
 int k;
 int A[100000];
 
+unsigned int check(int x){
+    int res = 0;
+    for (int t=0;t<n;t++){
+        res+=(A[t]+x-1)/x;
+    }
+    return  res;
+}
+
+unsigned int binary_search (int lb, int ub, int k){
+    while (ub - lb > 1){
+        int mid = (lb + ub ) / 2;
+        if (check(mid)) ub = mid ;
+        else lb = mid ;
+
+}  
+return ub ;
+}
 
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
+    int i, ub, lb;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
-  }
+    }
+
+
+    lb=0;
+    ub=1000000000;
+
+
+    int res=0;
+    res = binary_search(lb, ub, k);
+    printf("%d\n", res);
 
 
-  return 0;
+    return 0;
 }

src/array.c

@@ -1,18 +1,35 @@
+
 #include <stdio.h>
 
 int n;
 int k;
 int A[100000];
 
+unsigned int binary_search (int lb, int ub, int k){
+  while (ub - lb > 1){
+    int mid = (lb + ub ) / 2;
+    if (A[ mid ] >= k) ub = mid ;
+    else lb = mid ;
+  }
+return ub ;
+}
 
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
+    int i, ub, lb;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
-  }
+    }
+
+
+    lb=-1;
+    ub=n+1;
+
 
+    int res=0;
+    res = binary_search(lb, ub, k);
+    printf("%d\n", res);
 
 
-  return 0;
+    return 0;
 }

src/spear.c

@@ -1,17 +1,44 @@
+
 #include <stdio.h>
 
 int n;
 int k;
 int A[100000];
 
+unsigned int number_of_spear(int x){
+    int res = 0;
+    for (int t=0;t<n;t++){
+        res+=A[t]/x;
+    }
+    return  res;
+}
+
+unsigned int binary_search (int lb, int ub, int k){
+    while (ub - lb > 1){
+        int mid = (lb + ub ) / 2;
+        if (number_of_spear(mid) >= k) lb = mid ;
+        else ub = mid ;
+        }
+    return lb ; // 少し変更
+}
+
 
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
+    int i, ub, lb;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
-  }
+    }
+
+
+    lb=-1;
+    ub=1000000001;
+
+
+    int res=0;
+    res = binary_search(lb, ub, k);
+    printf("%d\n", res);
 
 
-  return 0;
+    return 0;
 }

src/works.c

@@ -1,17 +1,51 @@
+
 #include <stdio.h>
 
 int n;
 int k;
 int A[100000];
 
+int check(int x){
+    int tmp=0, count=1;
+    for(int t=0;t<n;t++){
+        tmp+=A[t];
+        if(tmp > x){
+            t--;
+            tmp=0;
+            count++;
+        }
+        if(count > k)return 0;
+    }
+    return 1;
+}
+
+unsigned int binary_search (int lb, int ub, int k){
+    while (ub - lb > 1){
+        int mid = (lb + ub ) / 2;
+        if (check(mid)) ub = mid ;
+        else lb = mid ;
+
+}
+    return ub ;
+}
+
 
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
+    int i, ub, lb;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
-  }
+    }
+
+
+    lb=0;
+    ub=1000000000;
+
+
+    int res=0;
+    res = binary_search(lb, ub, k);
+    printf("%d\n", res);
 
 
-  return 0;
+    return 0;
 }